./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.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 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:00:25,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:00:25,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:00:25,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:00:25,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:00:25,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:00:25,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:00:25,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:00:25,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:00:25,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:00:25,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:00:25,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:00:25,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:00:25,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:00:25,687 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:00:25,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:00:25,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:00:25,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:00:25,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:00:25,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:00:25,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:00:25,691 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 -> 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 [2025-03-17 12:00:25,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:00:25,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:00:25,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:00:25,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:00:25,922 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:00:25,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2025-03-17 12:00:27,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fec85e3e/e9741606ee6d4bcdb05dfe67842198dc/FLAG396e344fe [2025-03-17 12:00:27,337 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:00:27,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2025-03-17 12:00:27,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fec85e3e/e9741606ee6d4bcdb05dfe67842198dc/FLAG396e344fe [2025-03-17 12:00:27,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fec85e3e/e9741606ee6d4bcdb05dfe67842198dc [2025-03-17 12:00:27,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:00:27,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:00:27,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:00:27,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:00:27,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:00:27,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b32687c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27, skipping insertion in model container [2025-03-17 12:00:27,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:00:27,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:00:27,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:00:27,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:00:27,521 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:00:27,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27 WrapperNode [2025-03-17 12:00:27,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:00:27,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:00:27,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:00:27,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:00:27,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,544 INFO L138 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-03-17 12:00:27,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:00:27,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:00:27,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:00:27,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:00:27,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,570 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 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 [1, 0]. [2025-03-17 12:00:27,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:00:27,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:00:27,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:00:27,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:00:27,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (1/1) ... [2025-03-17 12:00:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:00:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:27,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:00:27,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:00:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:00:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:00:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:00:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:00:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:00:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:00:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:00:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:00:27,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:00:27,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:00:27,858 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: 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-17 12:00:27,871 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 12:00:27,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:00:27,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:00:27,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:00:27,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:27 BoogieIcfgContainer [2025-03-17 12:00:27,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:00:27,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:00:27,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:00:27,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:00:27,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:00:27" (1/3) ... [2025-03-17 12:00:27,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c34c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:00:27, skipping insertion in model container [2025-03-17 12:00:27,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:27" (2/3) ... [2025-03-17 12:00:27,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c34c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:00:27, skipping insertion in model container [2025-03-17 12:00:27,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:27" (3/3) ... [2025-03-17 12:00:27,892 INFO L128 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-write.c [2025-03-17 12:00:27,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:00:27,906 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ArraysWithLenghtAtDeclaration_-write.c that has 1 procedures, 22 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-17 12:00:27,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:00:27,955 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;@5bbde4ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:00:27,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 12:00:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:00:27,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:27,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:00:27,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:27,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1784222, now seen corresponding path program 1 times [2025-03-17 12:00:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44675427] [2025-03-17 12:00:27,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:28,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:00:28,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:00:28,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:28,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44675427] [2025-03-17 12:00:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44675427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:28,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:00:28,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:00:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56472305] [2025-03-17 12:00:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:28,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:00:28,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:00:28,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:00:28,237 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 21 states have internal predecessors, (25), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:28,332 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-03-17 12:00:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:00:28,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 12:00:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:28,338 INFO L225 Difference]: With dead ends: 42 [2025-03-17 12:00:28,339 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 12:00:28,342 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-17 12:00:28,345 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:28,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 12:00:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 24. [2025-03-17 12:00:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.6875) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-17 12:00:28,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 4 [2025-03-17 12:00:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:28,378 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-17 12:00:28,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-17 12:00:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:00:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:28,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:00:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:00:28,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 55317848, now seen corresponding path program 1 times [2025-03-17 12:00:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106872078] [2025-03-17 12:00:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:00:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:00:28,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:28,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106872078] [2025-03-17 12:00:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106872078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:28,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:00:28,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:00:28,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103449617] [2025-03-17 12:00:28,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:28,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:00:28,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:28,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:00:28,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:00:28,510 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 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-17 12:00:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:28,557 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-03-17 12:00:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:00:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-17 12:00:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:28,557 INFO L225 Difference]: With dead ends: 23 [2025-03-17 12:00:28,557 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 12:00:28,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-17 12:00:28,558 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:28,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 12:00:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 12:00:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.625) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-17 12:00:28,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 5 [2025-03-17 12:00:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:28,562 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-17 12:00:28,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-17 12:00:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-17 12:00:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:00:28,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:28,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:00:28,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:00:28,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:28,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 55317849, now seen corresponding path program 1 times [2025-03-17 12:00:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707456890] [2025-03-17 12:00:28,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:28,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:00:28,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:00:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707456890] [2025-03-17 12:00:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707456890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:00:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:00:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777583438] [2025-03-17 12:00:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:00:28,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:28,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:00:28,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:00:28,697 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 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-17 12:00:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:28,767 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-17 12:00:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:00:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-17 12:00:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:28,768 INFO L225 Difference]: With dead ends: 27 [2025-03-17 12:00:28,768 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 12:00:28,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-17 12:00:28,770 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:28,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 18 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 12:00:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-17 12:00:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.6111111111111112) 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-17 12:00:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-17 12:00:28,773 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 5 [2025-03-17 12:00:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:28,773 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 12:00:28,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-17 12:00:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-17 12:00:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:00:28,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:28,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:00:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:00:28,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1293441861, now seen corresponding path program 1 times [2025-03-17 12:00:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133503564] [2025-03-17 12:00:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:28,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:00:28,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:00:28,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:28,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:28,853 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-17 12:00:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133503564] [2025-03-17 12:00:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133503564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850390716] [2025-03-17 12:00:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:28,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:28,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:28,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:00:28,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:00:28,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:00:28,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:28,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:28,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 12:00:28,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:28,974 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-17 12:00:28,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:29,005 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-17 12:00:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850390716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:29,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:29,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 12:00:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290520867] [2025-03-17 12:00:29,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:00:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:29,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:00:29,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:00:29,008 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.375) 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-17 12:00:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:29,089 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-17 12:00:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:00:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) 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 8 [2025-03-17 12:00:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:29,090 INFO L225 Difference]: With dead ends: 30 [2025-03-17 12:00:29,090 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 12:00:29,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:00:29,090 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:29,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 12:00:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-03-17 12:00:29,092 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-17 12:00:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-17 12:00:29,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 8 [2025-03-17 12:00:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-17 12:00:29,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) 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-17 12:00:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-17 12:00:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:00:29,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:29,095 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:00:29,102 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-17 12:00:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:29,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1293441636, now seen corresponding path program 1 times [2025-03-17 12:00:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748580832] [2025-03-17 12:00:29,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:29,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:00:29,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:00:29,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:29,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:29,363 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-17 12:00:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748580832] [2025-03-17 12:00:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748580832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651386109] [2025-03-17 12:00:29,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:29,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:29,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:29,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:00:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:00:29,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:00:29,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:29,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:00:29,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:29,414 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-17 12:00:29,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:29,451 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-17 12:00:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651386109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:29,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:29,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 12:00:29,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529855958] [2025-03-17 12:00:29,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:00:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:29,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:00:29,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:00:29,453 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:29,505 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-17 12:00:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:00:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 8 [2025-03-17 12:00:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:29,507 INFO L225 Difference]: With dead ends: 35 [2025-03-17 12:00:29,507 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 12:00:29,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-17 12:00:29,507 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 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-17 12:00:29,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 12:00:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 12:00:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.5) internal successors, (42), 34 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-17 12:00:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-17 12:00:29,513 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 8 [2025-03-17 12:00:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:29,514 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-17 12:00:29,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-17 12:00:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:00:29,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:29,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 12:00:29,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:00:29,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:29,719 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:29,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1441985060, now seen corresponding path program 1 times [2025-03-17 12:00:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:29,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554422330] [2025-03-17 12:00:29,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:00:29,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:00:29,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:29,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:29,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554422330] [2025-03-17 12:00:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554422330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649241299] [2025-03-17 12:00:29,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:29,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:29,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:29,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:00:29,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:00:29,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:00:29,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:29,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:29,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:00:29,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:29,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:00:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:29,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:30,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649241299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:30,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:30,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 12:00:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321769630] [2025-03-17 12:00:30,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:30,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:00:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:30,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:00:30,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:00:30,025 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:30,135 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-17 12:00:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:00:30,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-17 12:00:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:30,136 INFO L225 Difference]: With dead ends: 36 [2025-03-17 12:00:30,136 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 12:00:30,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 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-17 12:00:30,136 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:30,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 33 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 12:00:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 12:00:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-03-17 12:00:30,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 9 [2025-03-17 12:00:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:30,143 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-03-17 12:00:30,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-03-17 12:00:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:00:30,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:30,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 12:00:30,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:00:30,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:30,344 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-17 12:00:30,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash 85932376, now seen corresponding path program 2 times [2025-03-17 12:00:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:30,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991114921] [2025-03-17 12:00:30,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:30,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 12:00:30,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 12 statements. [2025-03-17 12:00:30,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:00:30,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991114921] [2025-03-17 12:00:30,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991114921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:30,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:00:30,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:00:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665665488] [2025-03-17 12:00:30,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:30,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:00:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:30,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:00:30,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:00:30,381 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:30,393 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-03-17 12:00:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:00:30,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 12:00:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:30,394 INFO L225 Difference]: With dead ends: 34 [2025-03-17 12:00:30,394 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 12:00:30,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:00:30,395 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:30,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 12:00:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 12:00:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-17 12:00:30,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2025-03-17 12:00:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:30,397 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 12:00:30,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-17 12:00:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:00:30,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:30,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 12:00:30,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:00:30,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:30,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 85932377, now seen corresponding path program 1 times [2025-03-17 12:00:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49103924] [2025-03-17 12:00:30,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:30,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:00:30,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:00:30,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:30,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:30,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49103924] [2025-03-17 12:00:30,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49103924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:30,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:00:30,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:00:30,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158599986] [2025-03-17 12:00:30,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:30,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:00:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:30,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:00:30,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:00:30,470 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:30,499 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-17 12:00:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:00:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 12:00:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:30,500 INFO L225 Difference]: With dead ends: 57 [2025-03-17 12:00:30,500 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 12:00:30,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 12:00:30,501 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:30,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 12:00:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-03-17 12:00:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-17 12:00:30,508 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 12 [2025-03-17 12:00:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:30,508 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-17 12:00:30,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-17 12:00:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:00:30,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:30,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:00:30,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:00:30,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:30,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2052342379, now seen corresponding path program 1 times [2025-03-17 12:00:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44944778] [2025-03-17 12:00:30,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:00:30,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:00:30,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:30,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44944778] [2025-03-17 12:00:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44944778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890169319] [2025-03-17 12:00:30,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:30,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:30,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:00:30,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:00:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:00:30,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:30,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 12:00:30,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:30,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:30,750 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 22 treesize of output 18 [2025-03-17 12:00:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890169319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:30,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 12:00:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524723222] [2025-03-17 12:00:30,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:00:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:00:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:00:30,800 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:30,856 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2025-03-17 12:00:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:00:30,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2025-03-17 12:00:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:30,857 INFO L225 Difference]: With dead ends: 59 [2025-03-17 12:00:30,857 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 12:00:30,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:00:30,857 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:30,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 15 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 12:00:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-17 12:00:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-03-17 12:00:30,864 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2025-03-17 12:00:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:30,864 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-03-17 12:00:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-03-17 12:00:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:00:30,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:30,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:00:30,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:31,065 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-17 12:00:31,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:31,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash -911039059, now seen corresponding path program 1 times [2025-03-17 12:00:31,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:31,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902885459] [2025-03-17 12:00:31,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:31,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:00:31,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:00:31,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:31,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:31,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902885459] [2025-03-17 12:00:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902885459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145598829] [2025-03-17 12:00:31,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:31,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:31,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:31,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:31,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:00:31,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:00:31,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:00:31,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:31,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:31,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 12:00:31,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:31,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:31,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145598829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:31,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-17 12:00:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824071435] [2025-03-17 12:00:31,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:31,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:00:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:31,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:00:31,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:00:31,298 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:31,429 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2025-03-17 12:00:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:00:31,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 18 [2025-03-17 12:00:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:31,431 INFO L225 Difference]: With dead ends: 115 [2025-03-17 12:00:31,431 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 12:00:31,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 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-17 12:00:31,431 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:31,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 35 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 12:00:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2025-03-17 12:00:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 108 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-17 12:00:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2025-03-17 12:00:31,441 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 136 transitions. Word has length 18 [2025-03-17 12:00:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:31,441 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 136 transitions. [2025-03-17 12:00:31,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2025-03-17 12:00:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:00:31,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:31,442 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2025-03-17 12:00:31,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:00:31,644 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,SelfDestructingSolverStorable9 [2025-03-17 12:00:31,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:31,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 996990963, now seen corresponding path program 2 times [2025-03-17 12:00:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945346630] [2025-03-17 12:00:31,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:31,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 12:00:31,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:00:31,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:31,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:00:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945346630] [2025-03-17 12:00:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945346630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863648248] [2025-03-17 12:00:31,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:31,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:31,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:31,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:31,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:00:31,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 12:00:31,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:00:31,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:31,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:31,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 12:00:31,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:31,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:00:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863648248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:00:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-17 12:00:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618633303] [2025-03-17 12:00:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:31,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:00:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:31,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:00:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:00:31,853 INFO L87 Difference]: Start difference. First operand 109 states and 136 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:31,914 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-03-17 12:00:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:00:31,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2025-03-17 12:00:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:31,915 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:00:31,915 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:00:31,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:00:31,915 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:31,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:00:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 12:00:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 98 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2025-03-17 12:00:31,922 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 20 [2025-03-17 12:00:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:31,922 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2025-03-17 12:00:31,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2025-03-17 12:00:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:00:31,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:31,922 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1] [2025-03-17 12:00:31,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:00:32,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:32,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:32,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1009761244, now seen corresponding path program 1 times [2025-03-17 12:00:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642017514] [2025-03-17 12:00:32,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:32,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:00:32,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:00:32,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:32,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642017514] [2025-03-17 12:00:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642017514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112304218] [2025-03-17 12:00:32,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:32,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:32,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:00:32,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:00:32,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:00:32,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:32,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:32,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:00:32,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:32,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:32,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112304218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:32,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 12:00:32,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154657595] [2025-03-17 12:00:32,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:32,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:00:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:32,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:00:32,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:00:32,408 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:32,539 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2025-03-17 12:00:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:00:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 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 24 [2025-03-17 12:00:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:32,540 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:00:32,540 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:00:32,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:00:32,541 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:32,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:00:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 12:00:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 98 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-03-17 12:00:32,546 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 24 [2025-03-17 12:00:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-03-17 12:00:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-03-17 12:00:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:00:32,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:32,547 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1] [2025-03-17 12:00:32,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:32,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:32,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -263798663, now seen corresponding path program 2 times [2025-03-17 12:00:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205180030] [2025-03-17 12:00:32,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:32,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 12:00:32,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:00:32,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:32,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:00:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205180030] [2025-03-17 12:00:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205180030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653265967] [2025-03-17 12:00:32,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:32,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:32,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:32,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:32,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:00:32,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 12:00:32,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:00:32,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:32,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:32,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 12:00:32,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:32,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:00:32,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:00:32,977 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-17 12:00:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:00:33,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:00:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653265967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:33,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 12:00:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791699433] [2025-03-17 12:00:33,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:33,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:00:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:33,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:00:33,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:00:33,208 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:33,276 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-03-17 12:00:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:00:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 28 [2025-03-17 12:00:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:33,277 INFO L225 Difference]: With dead ends: 125 [2025-03-17 12:00:33,277 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:00:33,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:00:33,278 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:33,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:00:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-03-17 12:00:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 118 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2025-03-17 12:00:33,281 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 28 [2025-03-17 12:00:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2025-03-17 12:00:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2025-03-17 12:00:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:00:33,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:33,282 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-03-17 12:00:33,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:33,486 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,SelfDestructingSolverStorable12 [2025-03-17 12:00:33,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 31469430, now seen corresponding path program 1 times [2025-03-17 12:00:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979184836] [2025-03-17 12:00:33,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:00:33,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:00:33,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:33,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 53 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:00:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979184836] [2025-03-17 12:00:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979184836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216684401] [2025-03-17 12:00:33,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:33,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:33,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:33,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:00:33,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:00:33,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:00:33,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:33,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:33,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:00:33,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:00:33,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:00:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216684401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:33,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-17 12:00:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545964241] [2025-03-17 12:00:33,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:00:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:33,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:00:33,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:00:33,780 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:33,912 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2025-03-17 12:00:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:00:33,913 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 12:00:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:33,913 INFO L225 Difference]: With dead ends: 113 [2025-03-17 12:00:33,913 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 12:00:33,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:00:33,914 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:33,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 12:00:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 12:00:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 112 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2025-03-17 12:00:33,916 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 32 [2025-03-17 12:00:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:33,916 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2025-03-17 12:00:33,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2025-03-17 12:00:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:00:33,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:33,918 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 3, 2, 2, 2, 1, 1] [2025-03-17 12:00:33,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:34,118 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,SelfDestructingSolverStorable13 [2025-03-17 12:00:34,118 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:34,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash 270329494, now seen corresponding path program 2 times [2025-03-17 12:00:34,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:34,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630173790] [2025-03-17 12:00:34,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:34,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 12:00:34,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:00:34,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:34,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 143 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:00:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630173790] [2025-03-17 12:00:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630173790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648913368] [2025-03-17 12:00:34,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:34,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:34,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:00:34,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 12:00:34,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:00:34,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:34,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:34,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 12:00:34,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 37 proven. 130 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:00:34,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 37 proven. 130 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:00:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648913368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:34,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2025-03-17 12:00:34,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527278654] [2025-03-17 12:00:34,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:34,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:00:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:34,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:00:34,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:00:34,611 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 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-17 12:00:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:34,840 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2025-03-17 12:00:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:00:34,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 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) Word has length 48 [2025-03-17 12:00:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:34,842 INFO L225 Difference]: With dead ends: 111 [2025-03-17 12:00:34,842 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 12:00:34,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:00:34,843 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:34,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 12:00:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 12:00:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.179245283018868) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2025-03-17 12:00:34,857 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 48 [2025-03-17 12:00:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2025-03-17 12:00:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 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-17 12:00:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2025-03-17 12:00:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 12:00:34,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:34,858 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 4, 3, 3, 3, 1, 1] [2025-03-17 12:00:34,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:00:35,059 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,SelfDestructingSolverStorable14 [2025-03-17 12:00:35,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1454940746, now seen corresponding path program 3 times [2025-03-17 12:00:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926623259] [2025-03-17 12:00:35,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:35,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 11 equivalence classes. [2025-03-17 12:00:35,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 64 statements. [2025-03-17 12:00:35,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 12:00:35,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 12:00:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926623259] [2025-03-17 12:00:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926623259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191734966] [2025-03-17 12:00:35,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:35,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:35,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:35,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:00:35,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 11 equivalence classes. [2025-03-17 12:00:35,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 64 statements. [2025-03-17 12:00:35,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 12:00:35,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:35,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 12:00:35,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 159 proven. 32 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 12:00:35,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 159 proven. 32 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 12:00:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191734966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:35,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:35,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2025-03-17 12:00:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101323111] [2025-03-17 12:00:35,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:35,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:00:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:35,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:00:35,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:00:35,448 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:35,696 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2025-03-17 12:00:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:00:35,696 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 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 64 [2025-03-17 12:00:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:35,697 INFO L225 Difference]: With dead ends: 157 [2025-03-17 12:00:35,697 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 12:00:35,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:00:35,698 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:35,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 134 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 12:00:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-17 12:00:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.269736842105263) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2025-03-17 12:00:35,701 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 64 [2025-03-17 12:00:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:35,702 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2025-03-17 12:00:35,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2025-03-17 12:00:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 12:00:35,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:35,703 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 4, 3, 3, 3, 1, 1] [2025-03-17 12:00:35,709 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-17 12:00:35,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:00:35,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:35,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2141477122, now seen corresponding path program 1 times [2025-03-17 12:00:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:35,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070737300] [2025-03-17 12:00:35,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:35,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 12:00:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 12:00:35,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:35,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 179 proven. 118 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 12:00:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070737300] [2025-03-17 12:00:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070737300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957722449] [2025-03-17 12:00:36,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:36,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:36,131 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:36,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:00:36,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 12:00:36,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 12:00:36,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:36,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:36,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 12:00:36,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 209 proven. 88 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 12:00:36,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 209 proven. 88 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 12:00:36,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957722449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:36,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:36,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2025-03-17 12:00:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202030213] [2025-03-17 12:00:36,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:36,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:00:36,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:36,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:00:36,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:00:36,402 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:36,622 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2025-03-17 12:00:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:00:36,623 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 12:00:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:36,624 INFO L225 Difference]: With dead ends: 157 [2025-03-17 12:00:36,624 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 12:00:36,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2025-03-17 12:00:36,625 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:36,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 12:00:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-17 12:00:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.25) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2025-03-17 12:00:36,628 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 65 [2025-03-17 12:00:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:36,628 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2025-03-17 12:00:36,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2025-03-17 12:00:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 12:00:36,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:36,629 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 4, 3, 3, 3, 1, 1] [2025-03-17 12:00:36,635 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-17 12:00:36,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:00:36,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1757389051, now seen corresponding path program 2 times [2025-03-17 12:00:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57364116] [2025-03-17 12:00:36,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:36,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-17 12:00:36,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 12:00:36,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:36,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 15 proven. 344 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 12:00:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57364116] [2025-03-17 12:00:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57364116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776174791] [2025-03-17 12:00:37,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:37,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:37,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:37,166 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:37,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:00:37,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-17 12:00:37,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 12:00:37,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:37,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:37,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:00:37,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:37,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:00:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 12:00:37,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 12:00:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776174791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:37,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 22 [2025-03-17 12:00:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053081402] [2025-03-17 12:00:37,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:00:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:00:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:00:37,800 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:38,575 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2025-03-17 12:00:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 12:00:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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 69 [2025-03-17 12:00:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:38,577 INFO L225 Difference]: With dead ends: 162 [2025-03-17 12:00:38,577 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 12:00:38,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=686, Invalid=2394, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 12:00:38,578 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 105 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:38,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 23 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:00:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 12:00:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2025-03-17 12:00:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 157 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2025-03-17 12:00:38,581 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 69 [2025-03-17 12:00:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:38,581 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2025-03-17 12:00:38,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2025-03-17 12:00:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 12:00:38,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:38,581 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-17 12:00:38,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 12:00:38,785 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,SelfDestructingSolverStorable17 [2025-03-17 12:00:38,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:38,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1971995833, now seen corresponding path program 2 times [2025-03-17 12:00:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393818012] [2025-03-17 12:00:38,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:38,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-17 12:00:38,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 74 statements. [2025-03-17 12:00:38,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:00:38,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 12:00:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393818012] [2025-03-17 12:00:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393818012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:38,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:00:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:00:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465814492] [2025-03-17 12:00:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:38,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:00:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:38,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:00:38,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:00:38,860 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:38,876 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2025-03-17 12:00:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:00:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 74 [2025-03-17 12:00:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:38,877 INFO L225 Difference]: With dead ends: 157 [2025-03-17 12:00:38,877 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 12:00:38,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 12:00:38,877 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:38,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 12:00:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2025-03-17 12:00:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 147 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2025-03-17 12:00:38,881 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 74 [2025-03-17 12:00:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:38,881 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2025-03-17 12:00:38,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2025-03-17 12:00:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 12:00:38,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:38,882 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-17 12:00:38,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:00:38,883 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-17 12:00:38,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:38,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1002326373, now seen corresponding path program 1 times [2025-03-17 12:00:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:38,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553461596] [2025-03-17 12:00:38,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:38,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 12:00:38,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 12:00:38,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:38,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 147 proven. 196 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 12:00:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553461596] [2025-03-17 12:00:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553461596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104877249] [2025-03-17 12:00:39,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:39,147 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:39,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:00:39,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 12:00:39,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 12:00:39,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:39,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:39,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 12:00:39,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 147 proven. 196 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 12:00:39,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 147 proven. 196 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 12:00:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104877249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:39,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 18 [2025-03-17 12:00:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783762469] [2025-03-17 12:00:39,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:39,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 12:00:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:39,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 12:00:39,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:00:39,442 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:39,703 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2025-03-17 12:00:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 12:00:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 18 states have internal predecessors, (85), 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 75 [2025-03-17 12:00:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:39,704 INFO L225 Difference]: With dead ends: 155 [2025-03-17 12:00:39,704 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 12:00:39,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=852, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:00:39,705 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:39,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 12:00:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2025-03-17 12:00:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.125) internal successors, (162), 147 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2025-03-17 12:00:39,712 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 75 [2025-03-17 12:00:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:39,712 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2025-03-17 12:00:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2025-03-17 12:00:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 12:00:39,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:39,713 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-17 12:00:39,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 12:00:39,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:39,913 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:39,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -347813154, now seen corresponding path program 2 times [2025-03-17 12:00:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:39,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124463454] [2025-03-17 12:00:39,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:39,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-17 12:00:39,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 12:00:39,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:39,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 12:00:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124463454] [2025-03-17 12:00:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124463454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796562589] [2025-03-17 12:00:40,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:40,055 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:40,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 12:00:40,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-17 12:00:40,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 12:00:40,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:40,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:00:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 32 proven. 227 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-17 12:00:40,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:40,518 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-17 12:00:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 32 proven. 227 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-17 12:00:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796562589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:40,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:40,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-17 12:00:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126035680] [2025-03-17 12:00:40,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:00:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:40,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:00:40,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:00:40,604 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:40,786 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2025-03-17 12:00:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:00:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-17 12:00:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:40,787 INFO L225 Difference]: With dead ends: 211 [2025-03-17 12:00:40,787 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 12:00:40,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 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-17 12:00:40,787 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:40,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 114 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:00:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 12:00:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2025-03-17 12:00:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.1208053691275168) internal successors, (167), 152 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2025-03-17 12:00:40,792 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 79 [2025-03-17 12:00:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:40,793 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2025-03-17 12:00:40,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2025-03-17 12:00:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 12:00:40,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:40,794 INFO L218 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 4, 3, 3, 3, 1, 1] [2025-03-17 12:00:40,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:40,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:40,999 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1504460671, now seen corresponding path program 4 times [2025-03-17 12:00:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138977878] [2025-03-17 12:00:40,999 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:00:41,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:41,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-17 12:00:41,030 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 12:00:41,030 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:00:41,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 247 proven. 500 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 12:00:41,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138977878] [2025-03-17 12:00:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138977878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121861421] [2025-03-17 12:00:41,260 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:00:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:41,262 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:41,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:00:41,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-17 12:00:41,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 12:00:41,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:00:41,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:41,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 12:00:41,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 209 proven. 539 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 12:00:41,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 209 proven. 539 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 12:00:41,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121861421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:41,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:41,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 35 [2025-03-17 12:00:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134663613] [2025-03-17 12:00:41,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:41,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 12:00:41,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:41,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 12:00:41,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 12:00:41,931 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 36 states, 36 states have (on average 4.361111111111111) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:42,731 INFO L93 Difference]: Finished difference Result 302 states and 336 transitions. [2025-03-17 12:00:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-17 12:00:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.361111111111111) internal successors, (157), 35 states have internal predecessors, (157), 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 92 [2025-03-17 12:00:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:42,738 INFO L225 Difference]: With dead ends: 302 [2025-03-17 12:00:42,738 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 12:00:42,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2298, Invalid=6074, Unknown=0, NotChecked=0, Total=8372 [2025-03-17 12:00:42,741 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 50 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:42,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:00:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 12:00:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 281. [2025-03-17 12:00:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 277 states have (on average 1.111913357400722) internal successors, (308), 280 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 308 transitions. [2025-03-17 12:00:42,747 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 308 transitions. Word has length 92 [2025-03-17 12:00:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 308 transitions. [2025-03-17 12:00:42,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.361111111111111) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 308 transitions. [2025-03-17 12:00:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 12:00:42,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:42,748 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 5, 5, 4, 4, 1, 1] [2025-03-17 12:00:42,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 12:00:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 12:00:42,953 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash -832076950, now seen corresponding path program 3 times [2025-03-17 12:00:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:42,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953952334] [2025-03-17 12:00:42,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:42,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 15 equivalence classes. [2025-03-17 12:00:42,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 96 statements. [2025-03-17 12:00:42,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 12:00:42,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 5 proven. 326 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-17 12:00:43,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:43,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953952334] [2025-03-17 12:00:43,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953952334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:43,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624557434] [2025-03-17 12:00:43,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:43,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:43,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:43,179 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:43,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 12:00:43,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 15 equivalence classes. [2025-03-17 12:00:43,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 96 statements. [2025-03-17 12:00:43,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 12:00:43,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:43,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 12:00:43,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:43,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:00:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:00:43,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 12:00:43,278 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-17 12:00:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 7 proven. 331 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-17 12:00:43,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-17 12:00:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624557434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:44,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2025-03-17 12:00:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196117539] [2025-03-17 12:00:44,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:44,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:00:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:44,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:00:44,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:00:44,538 INFO L87 Difference]: Start difference. First operand 281 states and 308 transitions. Second operand has 21 states, 20 states have (on average 2.9) internal successors, (58), 20 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-17 12:00:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:45,212 INFO L93 Difference]: Finished difference Result 280 states and 304 transitions. [2025-03-17 12:00:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:00:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 20 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 96 [2025-03-17 12:00:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:45,214 INFO L225 Difference]: With dead ends: 280 [2025-03-17 12:00:45,214 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 12:00:45,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 12:00:45,214 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:45,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 11 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:00:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 12:00:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-17 12:00:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 277 states have (on average 1.0974729241877257) internal successors, (304), 279 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 304 transitions. [2025-03-17 12:00:45,219 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 304 transitions. Word has length 96 [2025-03-17 12:00:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:45,219 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 304 transitions. [2025-03-17 12:00:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 20 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-17 12:00:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 304 transitions. [2025-03-17 12:00:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 12:00:45,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:45,220 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1] [2025-03-17 12:00:45,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 12:00:45,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:45,420 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:45,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1852233114, now seen corresponding path program 3 times [2025-03-17 12:00:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190018129] [2025-03-17 12:00:45,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:45,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 16 equivalence classes. [2025-03-17 12:00:45,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 11 of 106 statements. [2025-03-17 12:00:45,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 12:00:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-03-17 12:00:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190018129] [2025-03-17 12:00:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190018129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655978940] [2025-03-17 12:00:45,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:45,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:45,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:45,523 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:45,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 12:00:45,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 16 equivalence classes. [2025-03-17 12:00:45,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 11 of 106 statements. [2025-03-17 12:00:45,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 12:00:45,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:45,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 12:00:45,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:45,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:00:45,611 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 11 treesize of output 5 [2025-03-17 12:00:45,614 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-17 12:00:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-03-17 12:00:45,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:00:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655978940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:45,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:00:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-17 12:00:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309409250] [2025-03-17 12:00:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:00:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:45,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:00:45,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:00:45,892 INFO L87 Difference]: Start difference. First operand 280 states and 304 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-17 12:00:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:45,915 INFO L93 Difference]: Finished difference Result 279 states and 303 transitions. [2025-03-17 12:00:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:00:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 106 [2025-03-17 12:00:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:45,916 INFO L225 Difference]: With dead ends: 279 [2025-03-17 12:00:45,916 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 12:00:45,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:00:45,916 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:45,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:00:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 12:00:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-17 12:00:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 1.0817843866171004) internal successors, (291), 270 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 291 transitions. [2025-03-17 12:00:45,922 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 291 transitions. Word has length 106 [2025-03-17 12:00:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:45,922 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 291 transitions. [2025-03-17 12:00:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-17 12:00:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 291 transitions. [2025-03-17 12:00:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 12:00:45,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:45,923 INFO L218 NwaCegarLoop]: trace histogram [45, 44, 44, 44, 9, 8, 8, 8, 1, 1] [2025-03-17 12:00:45,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 12:00:46,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:46,128 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1481492797, now seen corresponding path program 5 times [2025-03-17 12:00:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162655503] [2025-03-17 12:00:46,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 12:00:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:46,150 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 212 statements into 27 equivalence classes. [2025-03-17 12:00:46,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 112 of 212 statements. [2025-03-17 12:00:46,220 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-17 12:00:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 2574 proven. 328 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2025-03-17 12:00:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162655503] [2025-03-17 12:00:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162655503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693228901] [2025-03-17 12:00:46,431 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 12:00:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:46,433 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:46,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 12:00:46,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 212 statements into 27 equivalence classes. [2025-03-17 12:00:46,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 112 of 212 statements. [2025-03-17 12:00:46,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-17 12:00:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:46,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 12:00:46,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 2512 proven. 411 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2025-03-17 12:00:46,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 2608 proven. 315 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2025-03-17 12:00:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693228901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:47,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:47,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2025-03-17 12:00:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345232276] [2025-03-17 12:00:47,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:47,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 12:00:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:47,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 12:00:47,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2025-03-17 12:00:47,076 INFO L87 Difference]: Start difference. First operand 271 states and 291 transitions. Second operand has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:47,561 INFO L93 Difference]: Finished difference Result 271 states and 286 transitions. [2025-03-17 12:00:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 12:00:47,561 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 states have internal predecessors, (118), 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 212 [2025-03-17 12:00:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:47,562 INFO L225 Difference]: With dead ends: 271 [2025-03-17 12:00:47,562 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 12:00:47,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 402 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=637, Invalid=1913, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 12:00:47,563 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:47,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 13 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:00:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 12:00:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-17 12:00:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 1.063197026022305) internal successors, (286), 270 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 286 transitions. [2025-03-17 12:00:47,567 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 286 transitions. Word has length 212 [2025-03-17 12:00:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:47,567 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 286 transitions. [2025-03-17 12:00:47,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 28 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 286 transitions. [2025-03-17 12:00:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-17 12:00:47,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:47,568 INFO L218 NwaCegarLoop]: trace histogram [49, 48, 48, 48, 9, 8, 8, 8, 1, 1] [2025-03-17 12:00:47,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:47,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:47,769 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:47,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1757671479, now seen corresponding path program 6 times [2025-03-17 12:00:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350782790] [2025-03-17 12:00:47,770 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 12:00:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:47,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 228 statements into 32 equivalence classes. [2025-03-17 12:00:47,873 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 136 of 228 statements. [2025-03-17 12:00:47,873 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-17 12:00:47,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5120 backedges. 2461 proven. 360 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2025-03-17 12:00:48,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:48,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350782790] [2025-03-17 12:00:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350782790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:48,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014839563] [2025-03-17 12:00:48,241 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 12:00:48,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:48,243 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:48,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 12:00:48,341 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 228 statements into 32 equivalence classes. [2025-03-17 12:00:48,502 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 136 of 228 statements. [2025-03-17 12:00:48,502 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-17 12:00:48,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:48,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:00:48,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5120 backedges. 2498 proven. 323 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2025-03-17 12:00:48,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5120 backedges. 2498 proven. 323 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2025-03-17 12:00:49,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014839563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:49,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:49,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 53 [2025-03-17 12:00:49,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450466177] [2025-03-17 12:00:49,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:49,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 12:00:49,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:49,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 12:00:49,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=2199, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 12:00:49,226 INFO L87 Difference]: Start difference. First operand 271 states and 286 transitions. Second operand has 53 states, 53 states have (on average 3.660377358490566) internal successors, (194), 53 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:49,747 INFO L93 Difference]: Finished difference Result 565 states and 597 transitions. [2025-03-17 12:00:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 12:00:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.660377358490566) internal successors, (194), 53 states have internal predecessors, (194), 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 228 [2025-03-17 12:00:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:49,749 INFO L225 Difference]: With dead ends: 565 [2025-03-17 12:00:49,749 INFO L226 Difference]: Without dead ends: 565 [2025-03-17 12:00:49,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 418 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1453, Invalid=5687, Unknown=0, NotChecked=0, Total=7140 [2025-03-17 12:00:49,751 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 172 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:49,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 3 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:00:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-17 12:00:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 299. [2025-03-17 12:00:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.0606060606060606) internal successors, (315), 298 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 315 transitions. [2025-03-17 12:00:49,756 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 315 transitions. Word has length 228 [2025-03-17 12:00:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 315 transitions. [2025-03-17 12:00:49,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.660377358490566) internal successors, (194), 53 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 315 transitions. [2025-03-17 12:00:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-17 12:00:49,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:49,758 INFO L218 NwaCegarLoop]: trace histogram [55, 54, 54, 54, 9, 8, 8, 8, 1, 1] [2025-03-17 12:00:49,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 12:00:49,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:00:49,959 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:49,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1269325979, now seen corresponding path program 7 times [2025-03-17 12:00:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:49,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79392415] [2025-03-17 12:00:49,959 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 12:00:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 12:00:50,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 12:00:50,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:50,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 4362 proven. 667 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2025-03-17 12:00:50,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79392415] [2025-03-17 12:00:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79392415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322590220] [2025-03-17 12:00:50,543 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 12:00:50,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:50,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:50,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 12:00:50,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 12:00:50,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 12:00:50,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:50,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:50,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 12:00:50,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 4395 proven. 922 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2025-03-17 12:00:51,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 4395 proven. 922 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2025-03-17 12:00:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322590220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:51,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 40 [2025-03-17 12:00:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351860087] [2025-03-17 12:00:51,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 12:00:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 12:00:51,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1274, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 12:00:51,359 INFO L87 Difference]: Start difference. First operand 299 states and 315 transitions. Second operand has 40 states, 40 states have (on average 4.575) internal successors, (183), 40 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:52,492 INFO L93 Difference]: Finished difference Result 299 states and 307 transitions. [2025-03-17 12:00:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-17 12:00:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.575) internal successors, (183), 40 states have internal predecessors, (183), 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 252 [2025-03-17 12:00:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:52,493 INFO L225 Difference]: With dead ends: 299 [2025-03-17 12:00:52,493 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 12:00:52,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 477 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1293, Invalid=5513, Unknown=0, NotChecked=0, Total=6806 [2025-03-17 12:00:52,495 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:52,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 7 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:00:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 12:00:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-17 12:00:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.0336700336700337) internal successors, (307), 298 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 307 transitions. [2025-03-17 12:00:52,499 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 307 transitions. Word has length 252 [2025-03-17 12:00:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:52,499 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 307 transitions. [2025-03-17 12:00:52,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.575) internal successors, (183), 40 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 307 transitions. [2025-03-17 12:00:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-17 12:00:52,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:52,501 INFO L218 NwaCegarLoop]: trace histogram [56, 55, 55, 55, 9, 8, 8, 8, 1, 1] [2025-03-17 12:00:52,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:52,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 12:00:52,702 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1381864322, now seen corresponding path program 8 times [2025-03-17 12:00:52,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:52,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37118026] [2025-03-17 12:00:52,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:52,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 256 statements into 2 equivalence classes. [2025-03-17 12:00:52,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 12:00:52,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:52,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6618 backedges. 4318 proven. 426 refuted. 0 times theorem prover too weak. 1874 trivial. 0 not checked. [2025-03-17 12:00:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37118026] [2025-03-17 12:00:53,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37118026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738268231] [2025-03-17 12:00:53,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:00:53,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:53,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:53,390 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:53,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 12:00:53,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 256 statements into 2 equivalence classes. [2025-03-17 12:00:53,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 12:00:53,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:00:53,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:53,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 12:00:53,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6618 backedges. 2295 proven. 3710 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-03-17 12:00:54,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6618 backedges. 2295 proven. 3710 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-03-17 12:00:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738268231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:54,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 49 [2025-03-17 12:00:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983100226] [2025-03-17 12:00:54,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:54,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 12:00:54,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:54,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 12:00:54,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 12:00:54,400 INFO L87 Difference]: Start difference. First operand 299 states and 307 transitions. Second operand has 49 states, 49 states have (on average 4.551020408163265) internal successors, (223), 49 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:55,352 INFO L93 Difference]: Finished difference Result 301 states and 307 transitions. [2025-03-17 12:00:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-17 12:00:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.551020408163265) internal successors, (223), 49 states have internal predecessors, (223), 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 256 [2025-03-17 12:00:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:55,354 INFO L225 Difference]: With dead ends: 301 [2025-03-17 12:00:55,354 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 12:00:55,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 479 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2977 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2008, Invalid=7892, Unknown=0, NotChecked=0, Total=9900 [2025-03-17 12:00:55,357 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:55,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 10 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:00:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 12:00:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-03-17 12:00:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.026936026936027) internal successors, (305), 298 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 305 transitions. [2025-03-17 12:00:55,361 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 305 transitions. Word has length 256 [2025-03-17 12:00:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:55,361 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 305 transitions. [2025-03-17 12:00:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.551020408163265) internal successors, (223), 49 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 305 transitions. [2025-03-17 12:00:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-17 12:00:55,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:55,363 INFO L218 NwaCegarLoop]: trace histogram [65, 64, 64, 64, 10, 9, 9, 9, 1, 1] [2025-03-17 12:00:55,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-17 12:00:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:00:55,563 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2097050832, now seen corresponding path program 9 times [2025-03-17 12:00:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545149444] [2025-03-17 12:00:55,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:55,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 296 statements into 33 equivalence classes. [2025-03-17 12:00:55,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 88 of 296 statements. [2025-03-17 12:00:55,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 12:00:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 2367 proven. 200 refuted. 0 times theorem prover too weak. 6363 trivial. 0 not checked. [2025-03-17 12:00:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545149444] [2025-03-17 12:00:55,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545149444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236514418] [2025-03-17 12:00:55,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:55,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:55,769 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:55,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 12:00:55,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 296 statements into 33 equivalence classes. [2025-03-17 12:00:55,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 88 of 296 statements. [2025-03-17 12:00:55,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 12:00:55,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:55,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 12:00:55,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 2367 proven. 200 refuted. 0 times theorem prover too weak. 6363 trivial. 0 not checked. [2025-03-17 12:00:56,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 2367 proven. 200 refuted. 0 times theorem prover too weak. 6363 trivial. 0 not checked. [2025-03-17 12:00:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236514418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:00:56,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:00:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-17 12:00:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143848094] [2025-03-17 12:00:56,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:56,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:00:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:56,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:00:56,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-03-17 12:00:56,283 INFO L87 Difference]: Start difference. First operand 299 states and 305 transitions. Second operand has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:58,571 INFO L93 Difference]: Finished difference Result 346 states and 375 transitions. [2025-03-17 12:00:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 12:00:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2025-03-17 12:00:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:58,572 INFO L225 Difference]: With dead ends: 346 [2025-03-17 12:00:58,572 INFO L226 Difference]: Without dead ends: 346 [2025-03-17 12:00:58,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:00:58,573 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:58,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:00:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-17 12:00:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-17 12:00:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 1.0901162790697674) internal successors, (375), 345 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 375 transitions. [2025-03-17 12:00:58,577 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 375 transitions. Word has length 296 [2025-03-17 12:00:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:58,577 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 375 transitions. [2025-03-17 12:00:58,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:00:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 375 transitions. [2025-03-17 12:00:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-17 12:00:58,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:58,578 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 64, 64, 10, 9, 9, 9, 1, 1] [2025-03-17 12:00:58,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 12:00:58,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:58,779 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:00:58,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash 584066344, now seen corresponding path program 3 times [2025-03-17 12:00:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091172282] [2025-03-17 12:00:58,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:58,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 297 statements into 33 equivalence classes. [2025-03-17 12:00:58,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 297 statements. [2025-03-17 12:00:58,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 12:00:58,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8994 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 6534 trivial. 0 not checked. [2025-03-17 12:00:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091172282] [2025-03-17 12:00:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091172282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537410443] [2025-03-17 12:00:58,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:00:58,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:58,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:58,892 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:00:58,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 12:00:59,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 297 statements into 33 equivalence classes. [2025-03-17 12:00:59,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 297 statements. [2025-03-17 12:00:59,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 12:00:59,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:59,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:00:59,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:59,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:00:59,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:00:59,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2025-03-17 12:00:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8994 backedges. 39 proven. 2421 refuted. 0 times theorem prover too weak. 6534 trivial. 0 not checked. [2025-03-17 12:00:59,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8994 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 6534 trivial. 0 not checked. [2025-03-17 12:01:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537410443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:00,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 12:01:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641156184] [2025-03-17 12:01:00,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:01:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:00,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:01:00,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:01:00,566 INFO L87 Difference]: Start difference. First operand 346 states and 375 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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-17 12:01:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:00,620 INFO L93 Difference]: Finished difference Result 345 states and 363 transitions. [2025-03-17 12:01:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:01:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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 297 [2025-03-17 12:01:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:00,621 INFO L225 Difference]: With dead ends: 345 [2025-03-17 12:01:00,621 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 12:01:00,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:01:00,622 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 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-17 12:01:00,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:01:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 12:01:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 12:01:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.055232558139535) internal successors, (363), 344 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 363 transitions. [2025-03-17 12:01:00,626 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 363 transitions. Word has length 297 [2025-03-17 12:01:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:00,626 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 363 transitions. [2025-03-17 12:01:00,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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-17 12:01:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 363 transitions. [2025-03-17 12:01:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-17 12:01:00,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:00,627 INFO L218 NwaCegarLoop]: trace histogram [77, 76, 76, 76, 10, 9, 9, 9, 1, 1] [2025-03-17 12:01:00,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-17 12:01:00,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:00,832 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1721964756, now seen corresponding path program 10 times [2025-03-17 12:01:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856297125] [2025-03-17 12:01:00,832 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:01:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:00,854 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 344 statements into 2 equivalence classes. [2025-03-17 12:01:00,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 344 of 344 statements. [2025-03-17 12:01:00,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:01:00,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12398 backedges. 1246 proven. 10437 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-17 12:01:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856297125] [2025-03-17 12:01:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856297125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978944608] [2025-03-17 12:01:01,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:01:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:01,859 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 12:01:02,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 344 statements into 2 equivalence classes. [2025-03-17 12:01:02,297 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 344 of 344 statements. [2025-03-17 12:01:02,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:01:02,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:02,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 12:01:02,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12398 backedges. 1022 proven. 10662 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2025-03-17 12:01:03,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12398 backedges. 1022 proven. 10662 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2025-03-17 12:01:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978944608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:03,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 77 [2025-03-17 12:01:03,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514533939] [2025-03-17 12:01:03,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:03,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-17 12:01:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:03,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-17 12:01:03,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=4354, Unknown=0, NotChecked=0, Total=6006 [2025-03-17 12:01:03,779 INFO L87 Difference]: Start difference. First operand 345 states and 363 transitions. Second operand has 78 states, 78 states have (on average 4.782051282051282) internal successors, (373), 77 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:08,494 INFO L93 Difference]: Finished difference Result 2187 states and 2340 transitions. [2025-03-17 12:01:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2025-03-17 12:01:08,495 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 4.782051282051282) internal successors, (373), 77 states have internal predecessors, (373), 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 344 [2025-03-17 12:01:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:08,499 INFO L225 Difference]: With dead ends: 2187 [2025-03-17 12:01:08,499 INFO L226 Difference]: Without dead ends: 2187 [2025-03-17 12:01:08,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 631 SyntacticMatches, 12 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62380 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=31887, Invalid=82019, Unknown=0, NotChecked=0, Total=113906 [2025-03-17 12:01:08,506 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:01:08,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2013 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 12:01:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-03-17 12:01:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2013. [2025-03-17 12:01:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 2012 states have (on average 1.0745526838966202) internal successors, (2162), 2012 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2162 transitions. [2025-03-17 12:01:08,529 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2162 transitions. Word has length 344 [2025-03-17 12:01:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:08,529 INFO L471 AbstractCegarLoop]: Abstraction has 2013 states and 2162 transitions. [2025-03-17 12:01:08,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 4.782051282051282) internal successors, (373), 77 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2162 transitions. [2025-03-17 12:01:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-03-17 12:01:08,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:08,534 INFO L218 NwaCegarLoop]: trace histogram [165, 164, 164, 164, 21, 20, 20, 20, 1, 1] [2025-03-17 12:01:08,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-17 12:01:08,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-17 12:01:08,735 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash 221734087, now seen corresponding path program 11 times [2025-03-17 12:01:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395041186] [2025-03-17 12:01:08,736 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 12:01:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:08,777 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 740 statements into 80 equivalence classes. [2025-03-17 12:01:08,880 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 148 of 740 statements. [2025-03-17 12:01:08,881 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 12:01:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 57872 backedges. 24979 proven. 1188 refuted. 0 times theorem prover too weak. 31705 trivial. 0 not checked. [2025-03-17 12:01:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395041186] [2025-03-17 12:01:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395041186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505588543] [2025-03-17 12:01:09,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 12:01:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:09,305 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:09,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 12:01:09,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 740 statements into 80 equivalence classes. [2025-03-17 12:01:09,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 148 of 740 statements. [2025-03-17 12:01:09,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 12:01:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:09,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:01:09,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 57872 backedges. 24772 proven. 422 refuted. 0 times theorem prover too weak. 32678 trivial. 0 not checked. [2025-03-17 12:01:10,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 57872 backedges. 24801 proven. 393 refuted. 0 times theorem prover too weak. 32678 trivial. 0 not checked. [2025-03-17 12:01:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505588543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:10,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 55 [2025-03-17 12:01:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853160467] [2025-03-17 12:01:10,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-17 12:01:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:10,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-17 12:01:10,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 12:01:10,410 INFO L87 Difference]: Start difference. First operand 2013 states and 2162 transitions. Second operand has 55 states, 55 states have (on average 4.072727272727272) internal successors, (224), 55 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:11,316 INFO L93 Difference]: Finished difference Result 1573 states and 1686 transitions. [2025-03-17 12:01:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 12:01:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.072727272727272) internal successors, (224), 55 states have internal predecessors, (224), 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 740 [2025-03-17 12:01:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:11,319 INFO L225 Difference]: With dead ends: 1573 [2025-03-17 12:01:11,319 INFO L226 Difference]: Without dead ends: 1573 [2025-03-17 12:01:11,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1534 GetRequests, 1444 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1859 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1657, Invalid=6353, Unknown=0, NotChecked=0, Total=8010 [2025-03-17 12:01:11,321 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:01:11,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 19 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:01:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-17 12:01:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-03-17 12:01:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1572 states have (on average 1.0725190839694656) internal successors, (1686), 1572 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1686 transitions. [2025-03-17 12:01:11,341 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1686 transitions. Word has length 740 [2025-03-17 12:01:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 1686 transitions. [2025-03-17 12:01:11,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.072727272727272) internal successors, (224), 55 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1686 transitions. [2025-03-17 12:01:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-03-17 12:01:11,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:11,346 INFO L218 NwaCegarLoop]: trace histogram [176, 175, 175, 175, 21, 20, 20, 20, 1, 1] [2025-03-17 12:01:11,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-17 12:01:11,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 12:01:11,547 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:11,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1536781702, now seen corresponding path program 12 times [2025-03-17 12:01:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041039098] [2025-03-17 12:01:11,548 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 12:01:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:11,592 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 784 statements into 87 equivalence classes. [2025-03-17 12:01:11,877 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 248 of 784 statements. [2025-03-17 12:01:11,877 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-17 12:01:11,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 65550 backedges. 6091 proven. 14524 refuted. 0 times theorem prover too weak. 44935 trivial. 0 not checked. [2025-03-17 12:01:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041039098] [2025-03-17 12:01:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041039098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276734355] [2025-03-17 12:01:12,713 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 12:01:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:12,715 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:12,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 12:01:12,938 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 784 statements into 87 equivalence classes. [2025-03-17 12:01:13,897 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 248 of 784 statements. [2025-03-17 12:01:13,897 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-17 12:01:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:13,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 12:01:13,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 65550 backedges. 6292 proven. 14926 refuted. 0 times theorem prover too weak. 44332 trivial. 0 not checked. [2025-03-17 12:01:14,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 65550 backedges. 153 proven. 21065 refuted. 0 times theorem prover too weak. 44332 trivial. 0 not checked. [2025-03-17 12:01:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276734355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:16,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28, 28] total 74 [2025-03-17 12:01:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27253259] [2025-03-17 12:01:16,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-17 12:01:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:16,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-17 12:01:16,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=4743, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 12:01:16,645 INFO L87 Difference]: Start difference. First operand 1573 states and 1686 transitions. Second operand has 76 states, 75 states have (on average 3.44) internal successors, (258), 75 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:23,810 INFO L93 Difference]: Finished difference Result 3322 states and 3619 transitions. [2025-03-17 12:01:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-17 12:01:23,811 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 3.44) internal successors, (258), 75 states have internal predecessors, (258), 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 784 [2025-03-17 12:01:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:23,817 INFO L225 Difference]: With dead ends: 3322 [2025-03-17 12:01:23,818 INFO L226 Difference]: Without dead ends: 3322 [2025-03-17 12:01:23,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1685 GetRequests, 1510 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10498 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7045, Invalid=23755, Unknown=0, NotChecked=0, Total=30800 [2025-03-17 12:01:23,820 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 616 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:01:23,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 10 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:01:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2025-03-17 12:01:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2429. [2025-03-17 12:01:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 2428 states have (on average 1.0675453047775947) internal successors, (2592), 2428 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 2592 transitions. [2025-03-17 12:01:23,846 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 2592 transitions. Word has length 784 [2025-03-17 12:01:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:23,847 INFO L471 AbstractCegarLoop]: Abstraction has 2429 states and 2592 transitions. [2025-03-17 12:01:23,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 3.44) internal successors, (258), 75 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2592 transitions. [2025-03-17 12:01:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2025-03-17 12:01:23,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:23,853 INFO L218 NwaCegarLoop]: trace histogram [193, 192, 192, 192, 21, 20, 20, 20, 1, 1] [2025-03-17 12:01:23,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-17 12:01:24,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:24,054 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash -183861517, now seen corresponding path program 13 times [2025-03-17 12:01:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459330607] [2025-03-17 12:01:24,055 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 12:01:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-03-17 12:01:24,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-03-17 12:01:24,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:01:24,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 78368 backedges. 38234 proven. 558 refuted. 0 times theorem prover too weak. 39576 trivial. 0 not checked. [2025-03-17 12:01:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459330607] [2025-03-17 12:01:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459330607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861348401] [2025-03-17 12:01:25,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 12:01:25,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:25,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:25,926 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:25,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 12:01:26,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-03-17 12:01:26,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-03-17 12:01:26,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:01:26,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:26,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 12:01:26,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 78368 backedges. 35548 proven. 1861 refuted. 0 times theorem prover too weak. 40959 trivial. 0 not checked. [2025-03-17 12:01:26,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 78368 backedges. 35548 proven. 1861 refuted. 0 times theorem prover too weak. 40959 trivial. 0 not checked. [2025-03-17 12:01:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861348401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:27,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 42 [2025-03-17 12:01:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712764482] [2025-03-17 12:01:27,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 12:01:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:27,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 12:01:27,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 12:01:27,133 INFO L87 Difference]: Start difference. First operand 2429 states and 2592 transitions. Second operand has 42 states, 42 states have (on average 4.809523809523809) internal successors, (202), 42 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:28,753 INFO L93 Difference]: Finished difference Result 1901 states and 2038 transitions. [2025-03-17 12:01:28,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-17 12:01:28,753 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.809523809523809) internal successors, (202), 42 states have internal predecessors, (202), 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 852 [2025-03-17 12:01:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:28,757 INFO L225 Difference]: With dead ends: 1901 [2025-03-17 12:01:28,757 INFO L226 Difference]: Without dead ends: 1901 [2025-03-17 12:01:28,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1791 GetRequests, 1669 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3513 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2050, Invalid=9292, Unknown=0, NotChecked=0, Total=11342 [2025-03-17 12:01:28,758 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:01:28,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 8 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:01:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-17 12:01:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1901. [2025-03-17 12:01:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.0726315789473684) internal successors, (2038), 1900 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2038 transitions. [2025-03-17 12:01:28,775 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2038 transitions. Word has length 852 [2025-03-17 12:01:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:28,776 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2038 transitions. [2025-03-17 12:01:28,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.809523809523809) internal successors, (202), 42 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2038 transitions. [2025-03-17 12:01:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2025-03-17 12:01:28,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:28,782 INFO L218 NwaCegarLoop]: trace histogram [205, 204, 204, 204, 21, 20, 20, 20, 1, 1] [2025-03-17 12:01:28,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-17 12:01:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:28,982 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1729358001, now seen corresponding path program 14 times [2025-03-17 12:01:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341766603] [2025-03-17 12:01:28,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:01:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:29,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 900 statements into 2 equivalence classes. [2025-03-17 12:01:29,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 900 of 900 statements. [2025-03-17 12:01:29,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:01:29,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 88112 backedges. 47442 proven. 1560 refuted. 0 times theorem prover too weak. 39110 trivial. 0 not checked. [2025-03-17 12:01:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341766603] [2025-03-17 12:01:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341766603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410486812] [2025-03-17 12:01:31,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:01:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:31,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:31,389 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:31,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 12:01:31,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 900 statements into 2 equivalence classes. [2025-03-17 12:01:31,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 900 of 900 statements. [2025-03-17 12:01:31,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:01:31,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:31,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 3339 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:01:31,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 88112 backedges. 49579 proven. 2965 refuted. 0 times theorem prover too weak. 35568 trivial. 0 not checked. [2025-03-17 12:01:32,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 88112 backedges. 49579 proven. 2965 refuted. 0 times theorem prover too weak. 35568 trivial. 0 not checked. [2025-03-17 12:01:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410486812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:32,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 49 [2025-03-17 12:01:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739536422] [2025-03-17 12:01:32,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:32,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 12:01:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:32,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 12:01:32,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1925, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 12:01:32,858 INFO L87 Difference]: Start difference. First operand 1901 states and 2038 transitions. Second operand has 49 states, 49 states have (on average 5.020408163265306) internal successors, (246), 49 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:35,040 INFO L93 Difference]: Finished difference Result 1225 states and 1302 transitions. [2025-03-17 12:01:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-17 12:01:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.020408163265306) internal successors, (246), 49 states have internal predecessors, (246), 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 900 [2025-03-17 12:01:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:35,043 INFO L225 Difference]: With dead ends: 1225 [2025-03-17 12:01:35,043 INFO L226 Difference]: Without dead ends: 1225 [2025-03-17 12:01:35,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1915 GetRequests, 1759 SyntacticMatches, 20 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5801 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3492, Invalid=15414, Unknown=0, NotChecked=0, Total=18906 [2025-03-17 12:01:35,046 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 75 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:01:35,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 3 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:01:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-17 12:01:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-17 12:01:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 1.0637254901960784) internal successors, (1302), 1224 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1302 transitions. [2025-03-17 12:01:35,055 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1302 transitions. Word has length 900 [2025-03-17 12:01:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1302 transitions. [2025-03-17 12:01:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.020408163265306) internal successors, (246), 49 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1302 transitions. [2025-03-17 12:01:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2025-03-17 12:01:35,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:35,061 INFO L218 NwaCegarLoop]: trace histogram [218, 217, 217, 217, 21, 20, 20, 20, 1, 1] [2025-03-17 12:01:35,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-17 12:01:35,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:35,262 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1585131720, now seen corresponding path program 15 times [2025-03-17 12:01:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:35,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834694061] [2025-03-17 12:01:35,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:01:35,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:35,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 952 statements into 95 equivalence classes. [2025-03-17 12:01:35,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 316 of 952 statements. [2025-03-17 12:01:35,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-17 12:01:35,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 99318 backedges. 0 proven. 18978 refuted. 0 times theorem prover too weak. 80340 trivial. 0 not checked. [2025-03-17 12:01:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834694061] [2025-03-17 12:01:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834694061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486743327] [2025-03-17 12:01:36,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:01:36,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:36,290 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:36,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-17 12:01:36,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 952 statements into 95 equivalence classes. [2025-03-17 12:01:37,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 316 of 952 statements. [2025-03-17 12:01:37,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-17 12:01:37,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:37,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 12:01:37,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 99318 backedges. 18010 proven. 968 refuted. 0 times theorem prover too weak. 80340 trivial. 0 not checked. [2025-03-17 12:01:37,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 99318 backedges. 18010 proven. 968 refuted. 0 times theorem prover too weak. 80340 trivial. 0 not checked. [2025-03-17 12:01:38,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486743327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:38,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:38,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 72 [2025-03-17 12:01:38,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606350539] [2025-03-17 12:01:38,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:38,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-17 12:01:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:38,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-17 12:01:38,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=4351, Unknown=0, NotChecked=0, Total=5256 [2025-03-17 12:01:38,436 INFO L87 Difference]: Start difference. First operand 1225 states and 1302 transitions. Second operand has 73 states, 72 states have (on average 4.041666666666667) internal successors, (291), 73 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:01:40,452 INFO L93 Difference]: Finished difference Result 1306 states and 1403 transitions. [2025-03-17 12:01:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 12:01:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 4.041666666666667) internal successors, (291), 73 states have internal predecessors, (291), 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 952 [2025-03-17 12:01:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:01:40,455 INFO L225 Difference]: With dead ends: 1306 [2025-03-17 12:01:40,455 INFO L226 Difference]: Without dead ends: 1306 [2025-03-17 12:01:40,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1959 GetRequests, 1856 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2819 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2048, Invalid=8872, Unknown=0, NotChecked=0, Total=10920 [2025-03-17 12:01:40,456 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:01:40,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 94 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:01:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-03-17 12:01:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1265. [2025-03-17 12:01:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.0696202531645569) internal successors, (1352), 1264 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1352 transitions. [2025-03-17 12:01:40,464 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1352 transitions. Word has length 952 [2025-03-17 12:01:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:01:40,464 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1352 transitions. [2025-03-17 12:01:40,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 4.041666666666667) internal successors, (291), 73 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:01:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1352 transitions. [2025-03-17 12:01:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2025-03-17 12:01:40,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:01:40,470 INFO L218 NwaCegarLoop]: trace histogram [228, 227, 227, 227, 21, 20, 20, 20, 1, 1] [2025-03-17 12:01:40,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-17 12:01:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-17 12:01:40,672 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-17 12:01:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:01:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1607340438, now seen corresponding path program 16 times [2025-03-17 12:01:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:01:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970945404] [2025-03-17 12:01:40,672 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:01:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:01:40,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 992 statements into 2 equivalence classes. [2025-03-17 12:01:41,252 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 992 of 992 statements. [2025-03-17 12:01:41,252 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:01:41,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 108398 backedges. 73807 proven. 4381 refuted. 0 times theorem prover too weak. 30210 trivial. 0 not checked. [2025-03-17 12:01:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:01:44,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970945404] [2025-03-17 12:01:44,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970945404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:01:44,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939664006] [2025-03-17 12:01:44,156 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:01:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:01:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:01:44,158 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:01:44,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-17 12:01:44,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 992 statements into 2 equivalence classes. [2025-03-17 12:01:47,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 992 of 992 statements. [2025-03-17 12:01:47,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:01:47,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:01:47,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 3638 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 12:01:47,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:01:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 108398 backedges. 82877 proven. 6596 refuted. 0 times theorem prover too weak. 18925 trivial. 0 not checked. [2025-03-17 12:01:48,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:01:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 108398 backedges. 82877 proven. 6596 refuted. 0 times theorem prover too weak. 18925 trivial. 0 not checked. [2025-03-17 12:01:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939664006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:01:48,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:01:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 63 [2025-03-17 12:01:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063879196] [2025-03-17 12:01:48,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:01:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-17 12:01:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:01:48,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-17 12:01:48,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=3187, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 12:01:48,985 INFO L87 Difference]: Start difference. First operand 1265 states and 1352 transitions. Second operand has 63 states, 63 states have (on average 5.26984126984127) internal successors, (332), 63 states have internal predecessors, (332), 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)