./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/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-?-798a7b3-m [2025-03-04 07:41:21,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:21,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:41:21,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:21,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:21,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:21,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:21,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:21,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:21,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:21,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:21,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:21,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:21,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:21,151 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:21,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:21,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:21,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:21,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:21,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:21,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:21,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:21,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:21,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:21,154 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-04 07:41:21,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:21,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:21,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:21,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:21,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:21,544 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-04 07:41:22,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aafeab57/beacf54b8e414b369b0b11222d7a56e1/FLAG1265a0d8a [2025-03-04 07:41:22,976 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:22,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2025-03-04 07:41:22,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aafeab57/beacf54b8e414b369b0b11222d7a56e1/FLAG1265a0d8a [2025-03-04 07:41:23,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aafeab57/beacf54b8e414b369b0b11222d7a56e1 [2025-03-04 07:41:23,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:23,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:23,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:23,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:23,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:23,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15dd4896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23, skipping insertion in model container [2025-03-04 07:41:23,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:23,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:23,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:23,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:23,407 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:23,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23 WrapperNode [2025-03-04 07:41:23,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:23,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:23,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:23,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:23,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,431 INFO L138 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-03-04 07:41:23,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:23,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:23,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:23,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:23,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,448 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-04 07:41:23,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:23,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:23,454 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:23,454 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:23,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (1/1) ... [2025-03-04 07:41:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:23,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:41:23,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:41:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:41:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:41:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:23,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:41:23,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:41:23,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:41:23,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:23,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:23,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:23,713 INFO L1325 $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-04 07:41:23,721 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:23,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:23,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:23,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:23,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:23 BoogieIcfgContainer [2025-03-04 07:41:23,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:23,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:23,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:23,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:23,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:23" (1/3) ... [2025-03-04 07:41:23,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796565a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:23, skipping insertion in model container [2025-03-04 07:41:23,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:23" (2/3) ... [2025-03-04 07:41:23,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796565a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:23, skipping insertion in model container [2025-03-04 07:41:23,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:23" (3/3) ... [2025-03-04 07:41:23,738 INFO L128 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-write.c [2025-03-04 07:41:23,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:23,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ArraysWithLenghtAtDeclaration_-write.c that has 1 procedures, 25 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 07:41:23,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:23,794 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;@1b8e6da2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:23,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 07:41:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.75) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:41:23,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:23,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:41:23,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 59135101, now seen corresponding path program 1 times [2025-03-04 07:41:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006597415] [2025-03-04 07:41:23,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:23,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:41:23,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:41:23,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:23,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006597415] [2025-03-04 07:41:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006597415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969128983] [2025-03-04 07:41:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:24,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:24,009 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.75) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,052 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-04 07:41:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:41:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,058 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:41:24,058 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 07:41:24,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:24,064 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:24,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 07:41:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-04 07:41:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-04 07:41:24,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 5 [2025-03-04 07:41:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,092 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-04 07:41:24,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-04 07:41:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:41:24,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:41:24,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:41:24,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash 59119884, now seen corresponding path program 1 times [2025-03-04 07:41:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368172138] [2025-03-04 07:41:24,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:41:24,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:41:24,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368172138] [2025-03-04 07:41:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368172138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:24,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951690588] [2025-03-04 07:41:24,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:24,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:24,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:24,186 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,222 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-03-04 07:41:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:41:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,223 INFO L225 Difference]: With dead ends: 43 [2025-03-04 07:41:24,223 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 07:41:24,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:24,224 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:24,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 07:41:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2025-03-04 07:41:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 07:41:24,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2025-03-04 07:41:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,229 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 07:41:24,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 07:41:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:24,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:24,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:41:24,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1833181174, now seen corresponding path program 1 times [2025-03-04 07:41:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181382464] [2025-03-04 07:41:24,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:24,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181382464] [2025-03-04 07:41:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181382464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:24,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:24,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:41:24,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631758634] [2025-03-04 07:41:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:24,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:24,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:24,315 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,379 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-03-04 07:41:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,380 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:41:24,380 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:41:24,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:24,381 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:24,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:41:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2025-03-04 07:41:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 07:41:24,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2025-03-04 07:41:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 07:41:24,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-04 07:41:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:24,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:41:24,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:24,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1833188125, now seen corresponding path program 1 times [2025-03-04 07:41:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151995963] [2025-03-04 07:41:24,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:24,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:24,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:24,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151995963] [2025-03-04 07:41:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151995963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856711840] [2025-03-04 07:41:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:24,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:24,465 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,498 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-04 07:41:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,499 INFO L225 Difference]: With dead ends: 27 [2025-03-04 07:41:24,499 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 07:41:24,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:24,499 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:24,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 07:41:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-04 07:41:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.55) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 07:41:24,504 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 6 [2025-03-04 07:41:24,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,505 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 07:41:24,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 07:41:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:24,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:24,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:41:24,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:24,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1833188126, now seen corresponding path program 1 times [2025-03-04 07:41:24,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142547591] [2025-03-04 07:41:24,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:24,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:24,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142547591] [2025-03-04 07:41:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142547591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497655730] [2025-03-04 07:41:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:24,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:24,625 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,678 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-04 07:41:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,678 INFO L225 Difference]: With dead ends: 29 [2025-03-04 07:41:24,678 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:41:24,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:24,679 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 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-04 07:41:24,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:41:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-04 07:41:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 07:41:24,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2025-03-04 07:41:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,681 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 07:41:24,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-04 07:41:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:24,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,682 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:41:24,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1998256474, now seen corresponding path program 1 times [2025-03-04 07:41:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461918974] [2025-03-04 07:41:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:24,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:24,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:24,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461918974] [2025-03-04 07:41:24,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461918974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:24,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034367357] [2025-03-04 07:41:24,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:24,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:24,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:24,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:41:24,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:24,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:24,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:24,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034367357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:24,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 07:41:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226367951] [2025-03-04 07:41:24,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:41:24,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:41:24,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:24,887 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,946 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-04 07:41:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:41:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,949 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:41:24,949 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:41:24,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:24,950 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:24,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:41:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 07:41:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.5) internal successors, (48), 38 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-04 07:41:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-04 07:41:24,953 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 9 [2025-03-04 07:41:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,953 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-04 07:41:24,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-04 07:41:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:24,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:24,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:41:25,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:41:25,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1816401593, now seen corresponding path program 1 times [2025-03-04 07:41:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137058194] [2025-03-04 07:41:25,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:25,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:25,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:25,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137058194] [2025-03-04 07:41:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137058194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789465531] [2025-03-04 07:41:25,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:25,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:25,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:25,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:41:25,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:25,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:25,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:41:25,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:25,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789465531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:25,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 07:41:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473136460] [2025-03-04 07:41:25,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:41:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:25,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:41:25,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:41:25,342 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:25,442 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2025-03-04 07:41:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:41:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:41:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:25,443 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:41:25,443 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:41:25,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:25,444 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 85 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:25,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 21 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:41:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2025-03-04 07:41:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-04 07:41:25,447 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 10 [2025-03-04 07:41:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:25,447 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-04 07:41:25,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-04 07:41:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:25,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:25,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:25,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:25,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:41:25,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:25,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1816408545, now seen corresponding path program 1 times [2025-03-04 07:41:25,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:25,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004935857] [2025-03-04 07:41:25,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:25,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:25,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004935857] [2025-03-04 07:41:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004935857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:25,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219259594] [2025-03-04 07:41:25,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:25,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:25,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:41:25,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:41:25,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:25,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:25,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219259594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:26,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 07:41:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325596654] [2025-03-04 07:41:26,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:26,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:26,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:26,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:26,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:41:26,020 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,119 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-04 07:41:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:26,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:41:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,120 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:41:26,120 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:41:26,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:26,120 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 32 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:41:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 07:41:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.375) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-04 07:41:26,123 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 10 [2025-03-04 07:41:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,123 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-04 07:41:26,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-04 07:41:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:26,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:26,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:26,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:26,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1762980860, now seen corresponding path program 2 times [2025-03-04 07:41:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:26,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327523458] [2025-03-04 07:41:26,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:26,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 07:41:26,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 14 statements. [2025-03-04 07:41:26,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:41:26,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,367 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-04 07:41:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327523458] [2025-03-04 07:41:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327523458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:26,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791314244] [2025-03-04 07:41:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:26,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:26,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:26,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:26,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:26,369 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,382 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-04 07:41:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 07:41:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,382 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:41:26,383 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 07:41:26,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:26,383 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 07:41:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 07:41:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-04 07:41:26,385 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 14 [2025-03-04 07:41:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,385 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-04 07:41:26,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-04 07:41:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:26,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:26,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:41:26,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1762980861, now seen corresponding path program 1 times [2025-03-04 07:41:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277261625] [2025-03-04 07:41:26,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:26,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:26,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:26,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,519 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-04 07:41:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277261625] [2025-03-04 07:41:26,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277261625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:26,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:26,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:26,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793929711] [2025-03-04 07:41:26,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:26,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:26,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:26,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:26,520 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,550 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-03-04 07:41:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 07:41:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,551 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:41:26,551 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:41:26,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:26,551 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:41:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2025-03-04 07:41:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-04 07:41:26,554 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 14 [2025-03-04 07:41:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,554 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-04 07:41:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-04 07:41:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:26,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:41:26,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:26,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash 758906489, now seen corresponding path program 1 times [2025-03-04 07:41:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488078494] [2025-03-04 07:41:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:26,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:26,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:26,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,643 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-04 07:41:26,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488078494] [2025-03-04 07:41:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488078494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532502739] [2025-03-04 07:41:26,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:26,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:26,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:41:26,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:26,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:26,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:41:26,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:26,752 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-04 07:41:26,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:26,782 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-04 07:41:26,816 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-04 07:41:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532502739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:26,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 07:41:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961564247] [2025-03-04 07:41:26,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:41:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:26,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:41:26,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:41:26,817 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,882 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2025-03-04 07:41:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 07:41:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,882 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:41:26,883 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 07:41:26,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:41:26,883 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 37 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 07:41:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-03-04 07:41:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-03-04 07:41:26,886 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 18 [2025-03-04 07:41:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,886 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-04 07:41:26,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-03-04 07:41:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:41:26,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:26,892 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-04 07:41:27,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:27,087 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:27,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash -124684021, now seen corresponding path program 1 times [2025-03-04 07:41:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128178110] [2025-03-04 07:41:27,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:27,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:41:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:41:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,185 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-04 07:41:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128178110] [2025-03-04 07:41:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128178110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054629748] [2025-03-04 07:41:27,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:27,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:27,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:27,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:27,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:41:27,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:41:27,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:41:27,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:27,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:27,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:27,269 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-04 07:41:27,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:27,361 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-04 07:41:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054629748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:27,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-04 07:41:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389825193] [2025-03-04 07:41:27,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:27,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:27,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:27,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:41:27,363 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:27,509 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2025-03-04 07:41:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:41:27,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:41:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:27,510 INFO L225 Difference]: With dead ends: 121 [2025-03-04 07:41:27,510 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 07:41:27,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=121, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:27,510 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:27,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 07:41:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-03-04 07:41:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.290909090909091) internal successors, (142), 114 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2025-03-04 07:41:27,516 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 21 [2025-03-04 07:41:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:27,516 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2025-03-04 07:41:27,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2025-03-04 07:41:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:41:27,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:27,517 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:27,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:27,720 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,SelfDestructingSolverStorable11 [2025-03-04 07:41:27,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:27,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 377987313, now seen corresponding path program 2 times [2025-03-04 07:41:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:27,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427710455] [2025-03-04 07:41:27,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:27,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 07:41:27,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:41:27,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:27,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,800 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-04 07:41:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427710455] [2025-03-04 07:41:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427710455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139923718] [2025-03-04 07:41:27,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:27,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:27,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:27,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:41:27,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 07:41:27,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:41:27,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:27,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:27,938 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-04 07:41:27,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139923718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-04 07:41:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288654471] [2025-03-04 07:41:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:27,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:27,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:41:27,943 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:28,008 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2025-03-04 07:41:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 21 [2025-03-04 07:41:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:28,009 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:41:28,009 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:41:28,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 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-04 07:41:28,010 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:28,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:41:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 07:41:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.27) internal successors, (127), 104 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2025-03-04 07:41:28,021 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 21 [2025-03-04 07:41:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:28,022 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2025-03-04 07:41:28,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2025-03-04 07:41:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:28,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:28,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 07:41:28,033 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-04 07:41:28,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:28,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash -871002062, now seen corresponding path program 1 times [2025-03-04 07:41:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563514495] [2025-03-04 07:41:28,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:28,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:28,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:28,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:28,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:41:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563514495] [2025-03-04 07:41:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563514495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632072134] [2025-03-04 07:41:28,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:28,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:28,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:41:28,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:28,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:28,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:28,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:28,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:41:28,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:41:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632072134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:28,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:28,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-04 07:41:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198457115] [2025-03-04 07:41:28,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:28,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:28,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:28,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:28,533 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-04 07:41:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:28,660 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2025-03-04 07:41:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:28,660 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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 27 [2025-03-04 07:41:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:28,660 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:41:28,660 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:41:28,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:41:28,661 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:28,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 24 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:41:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 07:41:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.24) internal successors, (124), 104 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-03-04 07:41:28,664 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 27 [2025-03-04 07:41:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:28,664 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-03-04 07:41:28,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-04 07:41:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-03-04 07:41:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:41:28,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:28,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 07:41:28,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:41:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:28,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash 672985461, now seen corresponding path program 2 times [2025-03-04 07:41:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835920161] [2025-03-04 07:41:28,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:28,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 07:41:28,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:41:28,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:28,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835920161] [2025-03-04 07:41:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835920161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843363203] [2025-03-04 07:41:29,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:29,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:29,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:29,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:29,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:41:29,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 07:41:29,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:41:29,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:29,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:41:29,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:29,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:29,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:41:29,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 07:41:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:29,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843363203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:29,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 11 [2025-03-04 07:41:29,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254568094] [2025-03-04 07:41:29,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:29,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:29,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:29,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:41:29,477 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:29,595 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2025-03-04 07:41:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:41:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:41:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:29,596 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:41:29,596 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 07:41:29,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:29,596 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:29,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 66 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 07:41:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2025-03-04 07:41:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.188118811881188) internal successors, (120), 104 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2025-03-04 07:41:29,603 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 31 [2025-03-04 07:41:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:29,603 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2025-03-04 07:41:29,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2025-03-04 07:41:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:41:29,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:29,604 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:29,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:29,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:41:29,805 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-04 07:41:29,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 209571612, now seen corresponding path program 1 times [2025-03-04 07:41:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:29,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184790758] [2025-03-04 07:41:29,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:29,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:41:29,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:41:29,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:29,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,906 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-04 07:41:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184790758] [2025-03-04 07:41:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184790758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102878036] [2025-03-04 07:41:29,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:29,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:29,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:29,909 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:29,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:41:29,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:41:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:41:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:41:29,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:30,059 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-04 07:41:30,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:30,133 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-04 07:41:30,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102878036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:30,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:30,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2025-03-04 07:41:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680338867] [2025-03-04 07:41:30,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:30,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:30,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:30,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:30,136 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 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-04 07:41:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:30,270 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2025-03-04 07:41:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:30,271 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 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 34 [2025-03-04 07:41:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:30,271 INFO L225 Difference]: With dead ends: 99 [2025-03-04 07:41:30,271 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:41:30,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:41:30,272 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:30,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 41 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:41:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 07:41:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-03-04 07:41:30,274 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 34 [2025-03-04 07:41:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:30,277 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-03-04 07:41:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 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-04 07:41:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-03-04 07:41:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:41:30,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:30,277 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 07:41:30,284 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-04 07:41:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:41:30,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash 341336212, now seen corresponding path program 2 times [2025-03-04 07:41:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670640069] [2025-03-04 07:41:30,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:30,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 07:41:30,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:30,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:30,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 24 proven. 144 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:30,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:30,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670640069] [2025-03-04 07:41:30,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670640069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:30,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101052365] [2025-03-04 07:41:30,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:30,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:30,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:30,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:30,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:41:30,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 07:41:30,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:30,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:30,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:41:30,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 37 proven. 131 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:30,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 37 proven. 131 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101052365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:30,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2025-03-04 07:41:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421111828] [2025-03-04 07:41:30,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:41:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:30,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:41:30,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:41:30,958 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:31,149 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-04 07:41:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:41:31,149 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 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 51 [2025-03-04 07:41:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:31,150 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:41:31,150 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:41:31,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 89 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-04 07:41:31,151 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:31,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 49 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:41:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 07:41:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-03-04 07:41:31,154 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2025-03-04 07:41:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:31,154 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-03-04 07:41:31,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-03-04 07:41:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 07:41:31,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:31,155 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 4, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 07:41:31,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:41:31,359 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,SelfDestructingSolverStorable16 [2025-03-04 07:41:31,359 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:31,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1093922332, now seen corresponding path program 3 times [2025-03-04 07:41:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802333128] [2025-03-04 07:41:31,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:31,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 11 equivalence classes. [2025-03-04 07:41:31,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 68 statements. [2025-03-04 07:41:31,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 07:41:31,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 159 proven. 32 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 07:41:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802333128] [2025-03-04 07:41:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802333128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802514961] [2025-03-04 07:41:31,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:31,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:31,443 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:31,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:41:31,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 11 equivalence classes. [2025-03-04 07:41:31,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 68 statements. [2025-03-04 07:41:31,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 07:41:31,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:31,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:41:31,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 159 proven. 32 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 07:41:31,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 159 proven. 32 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 07:41:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802514961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:31,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 07:41:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36201008] [2025-03-04 07:41:31,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:31,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:31,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:31,639 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) 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-04 07:41:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:31,802 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2025-03-04 07:41:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) 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 68 [2025-03-04 07:41:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:31,803 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:41:31,803 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:41:31,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:31,803 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:31,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:41:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 07:41:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.1982758620689655) internal successors, (139), 119 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2025-03-04 07:41:31,806 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 68 [2025-03-04 07:41:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:31,806 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2025-03-04 07:41:31,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) 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-04 07:41:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2025-03-04 07:41:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 07:41:31,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:31,806 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 4, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 07:41:31,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:41:32,007 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,SelfDestructingSolverStorable17 [2025-03-04 07:41:32,007 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:32,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -448146081, now seen corresponding path program 1 times [2025-03-04 07:41:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449245084] [2025-03-04 07:41:32,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:32,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:41:32,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:41:32,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:32,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 177 proven. 123 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 07:41:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449245084] [2025-03-04 07:41:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449245084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789438219] [2025-03-04 07:41:32,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:32,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:32,150 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:41:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:41:32,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:41:32,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:32,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:32,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:32,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 212 proven. 88 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 07:41:32,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 212 proven. 88 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 07:41:32,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789438219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:32,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:32,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 07:41:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246445615] [2025-03-04 07:41:32,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:32,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:32,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:32,389 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:32,560 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2025-03-04 07:41:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:41:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 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-04 07:41:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:32,561 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:41:32,561 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:41:32,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:32,562 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:32,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 36 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:41:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 07:41:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 119 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2025-03-04 07:41:32,565 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 69 [2025-03-04 07:41:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:32,565 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2025-03-04 07:41:32,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2025-03-04 07:41:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 07:41:32,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:32,566 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 4, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 07:41:32,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:32,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:32,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -598484612, now seen corresponding path program 2 times [2025-03-04 07:41:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377132127] [2025-03-04 07:41:32,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:32,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 07:41:32,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 07:41:32,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 15 proven. 347 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 07:41:33,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377132127] [2025-03-04 07:41:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377132127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045197577] [2025-03-04 07:41:33,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:33,213 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:33,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:41:33,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 07:41:33,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 07:41:33,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:33,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:41:33,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:33,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 07:41:33,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:33,905 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 07:41:33,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045197577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:33,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:33,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 24 [2025-03-04 07:41:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338765731] [2025-03-04 07:41:33,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:33,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:41:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:33,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:41:33,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:33,907 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:34,623 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2025-03-04 07:41:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:41:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-04 07:41:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:34,624 INFO L225 Difference]: With dead ends: 166 [2025-03-04 07:41:34,624 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 07:41:34,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=626, Invalid=2130, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 07:41:34,625 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:34,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 77 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 07:41:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2025-03-04 07:41:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.126865671641791) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2025-03-04 07:41:34,628 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 73 [2025-03-04 07:41:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:34,628 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2025-03-04 07:41:34,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2025-03-04 07:41:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:41:34,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:34,628 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:34,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:34,828 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,SelfDestructingSolverStorable19 [2025-03-04 07:41:34,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:34,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1717754803, now seen corresponding path program 2 times [2025-03-04 07:41:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050454144] [2025-03-04 07:41:34,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:34,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-04 07:41:34,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 80 statements. [2025-03-04 07:41:34,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:41:34,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2025-03-04 07:41:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050454144] [2025-03-04 07:41:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050454144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232098984] [2025-03-04 07:41:34,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:34,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:34,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:34,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:34,888 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:34,905 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2025-03-04 07:41:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 07:41:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:34,906 INFO L225 Difference]: With dead ends: 137 [2025-03-04 07:41:34,906 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:41:34,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:34,906 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:34,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:41:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 07:41:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 134 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2025-03-04 07:41:34,911 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 80 [2025-03-04 07:41:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2025-03-04 07:41:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2025-03-04 07:41:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 07:41:34,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:34,913 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:34,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:41:34,913 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:34,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -935562351, now seen corresponding path program 1 times [2025-03-04 07:41:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596983977] [2025-03-04 07:41:34,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:34,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 07:41:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 07:41:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 161 proven. 202 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 07:41:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596983977] [2025-03-04 07:41:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596983977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375780808] [2025-03-04 07:41:35,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:35,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:35,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:35,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:35,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:41:35,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 07:41:35,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 07:41:35,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:35,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:35,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 196 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 07:41:35,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 196 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 07:41:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375780808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:35,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 25 [2025-03-04 07:41:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018118242] [2025-03-04 07:41:35,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:41:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:35,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:41:35,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:35,592 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 25 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:36,036 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2025-03-04 07:41:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:41:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 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 89 [2025-03-04 07:41:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:36,039 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:41:36,039 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 07:41:36,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=1479, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:41:36,041 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:36,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 21 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 07:41:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-03-04 07:41:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 136 states have (on average 1.0808823529411764) internal successors, (147), 138 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2025-03-04 07:41:36,043 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 89 [2025-03-04 07:41:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2025-03-04 07:41:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2025-03-04 07:41:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 07:41:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:36,044 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:36,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:36,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:36,245 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:36,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash 146810196, now seen corresponding path program 2 times [2025-03-04 07:41:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728805736] [2025-03-04 07:41:36,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:36,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-04 07:41:36,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 07:41:36,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:36,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 07:41:36,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728805736] [2025-03-04 07:41:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728805736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922399311] [2025-03-04 07:41:36,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:36,421 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:36,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:41:36,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-04 07:41:36,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 07:41:36,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:36,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:36,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:41:36,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 07:41:36,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 13 proven. 392 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 07:41:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922399311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:36,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 24 [2025-03-04 07:41:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799860125] [2025-03-04 07:41:36,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:36,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:41:36,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:36,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:41:36,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:41:36,909 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:37,255 INFO L93 Difference]: Finished difference Result 408 states and 451 transitions. [2025-03-04 07:41:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:41:37,256 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 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 93 [2025-03-04 07:41:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:37,257 INFO L225 Difference]: With dead ends: 408 [2025-03-04 07:41:37,257 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 07:41:37,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=283, Invalid=473, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:41:37,258 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 208 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:37,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 174 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 07:41:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 378. [2025-03-04 07:41:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 375 states have (on average 1.136) internal successors, (426), 377 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 426 transitions. [2025-03-04 07:41:37,263 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 426 transitions. Word has length 93 [2025-03-04 07:41:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:37,263 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 426 transitions. [2025-03-04 07:41:37,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 426 transitions. [2025-03-04 07:41:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 07:41:37,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:37,264 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 5, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 07:41:37,271 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-04 07:41:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:37,465 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2053026661, now seen corresponding path program 4 times [2025-03-04 07:41:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:37,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906151315] [2025-03-04 07:41:37,465 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:41:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:37,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 121 statements into 2 equivalence classes. [2025-03-04 07:41:37,507 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 07:41:37,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:41:37,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 273 proven. 918 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-04 07:41:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:37,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906151315] [2025-03-04 07:41:37,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906151315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:37,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708009788] [2025-03-04 07:41:37,765 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:41:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:37,768 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:37,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:41:37,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 121 statements into 2 equivalence classes. [2025-03-04 07:41:37,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 07:41:37,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:41:37,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:37,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:37,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 214 proven. 978 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 07:41:38,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 214 proven. 978 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 07:41:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708009788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:38,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 36 [2025-03-04 07:41:38,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472903498] [2025-03-04 07:41:38,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:38,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:41:38,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:38,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:41:38,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=900, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:41:38,439 INFO L87 Difference]: Start difference. First operand 378 states and 426 transitions. Second operand has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:39,338 INFO L93 Difference]: Finished difference Result 344 states and 371 transitions. [2025-03-04 07:41:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-04 07:41:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 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 121 [2025-03-04 07:41:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:39,340 INFO L225 Difference]: With dead ends: 344 [2025-03-04 07:41:39,340 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 07:41:39,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 215 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2687, Invalid=7015, Unknown=0, NotChecked=0, Total=9702 [2025-03-04 07:41:39,343 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:39,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 07:41:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 328. [2025-03-04 07:41:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 325 states have (on average 1.0769230769230769) internal successors, (350), 327 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 350 transitions. [2025-03-04 07:41:39,351 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 350 transitions. Word has length 121 [2025-03-04 07:41:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:39,352 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 350 transitions. [2025-03-04 07:41:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 350 transitions. [2025-03-04 07:41:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-04 07:41:39,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,356 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 44, 10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:39,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:39,556 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,SelfDestructingSolverStorable23 [2025-03-04 07:41:39,556 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:39,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 266087508, now seen corresponding path program 3 times [2025-03-04 07:41:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339201425] [2025-03-04 07:41:39,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:39,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 243 statements into 33 equivalence classes. [2025-03-04 07:41:39,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 243 statements. [2025-03-04 07:41:39,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:41:39,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4485 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4474 trivial. 0 not checked. [2025-03-04 07:41:39,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:39,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339201425] [2025-03-04 07:41:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339201425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:41:39,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995341968] [2025-03-04 07:41:39,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:39,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:39,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:39,674 INFO L87 Difference]: Start difference. First operand 328 states and 350 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:39,702 INFO L93 Difference]: Finished difference Result 327 states and 349 transitions. [2025-03-04 07:41:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:39,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2025-03-04 07:41:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:39,703 INFO L225 Difference]: With dead ends: 327 [2025-03-04 07:41:39,703 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 07:41:39,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:39,704 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:39,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 07:41:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2025-03-04 07:41:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 307 states have (on average 1.0749185667752443) internal successors, (330), 308 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 330 transitions. [2025-03-04 07:41:39,709 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 330 transitions. Word has length 243 [2025-03-04 07:41:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:39,709 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 330 transitions. [2025-03-04 07:41:39,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 330 transitions. [2025-03-04 07:41:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-04 07:41:39,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,711 INFO L218 NwaCegarLoop]: trace histogram [50, 49, 49, 49, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:39,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:41:39,711 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-04 07:41:39,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -79482611, now seen corresponding path program 5 times [2025-03-04 07:41:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225593061] [2025-03-04 07:41:39,712 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:41:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:39,736 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 246 statements into 28 equivalence classes. [2025-03-04 07:41:39,819 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 128 of 246 statements. [2025-03-04 07:41:39,819 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 07:41:39,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5441 backedges. 3018 proven. 351 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2025-03-04 07:41:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225593061] [2025-03-04 07:41:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225593061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406557290] [2025-03-04 07:41:40,221 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:41:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:40,224 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:40,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:41:40,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 246 statements into 28 equivalence classes. [2025-03-04 07:41:40,386 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 128 of 246 statements. [2025-03-04 07:41:40,386 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 07:41:40,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:40,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5441 backedges. 2980 proven. 411 refuted. 0 times theorem prover too weak. 2050 trivial. 0 not checked. [2025-03-04 07:41:40,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5441 backedges. 3076 proven. 315 refuted. 0 times theorem prover too weak. 2050 trivial. 0 not checked. [2025-03-04 07:41:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406557290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:40,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 32 [2025-03-04 07:41:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637841204] [2025-03-04 07:41:40,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:41:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:40,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:41:40,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:41:40,801 INFO L87 Difference]: Start difference. First operand 309 states and 330 transitions. Second operand has 32 states, 32 states have (on average 4.0625) internal successors, (130), 32 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-04 07:41:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:41,348 INFO L93 Difference]: Finished difference Result 309 states and 324 transitions. [2025-03-04 07:41:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:41:41,349 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.0625) internal successors, (130), 32 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) Word has length 246 [2025-03-04 07:41:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:41,349 INFO L225 Difference]: With dead ends: 309 [2025-03-04 07:41:41,350 INFO L226 Difference]: Without dead ends: 309 [2025-03-04 07:41:41,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 470 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=745, Invalid=2677, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 07:41:41,351 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:41,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 23 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-04 07:41:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-03-04 07:41:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 307 states have (on average 1.0553745928338762) internal successors, (324), 308 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 324 transitions. [2025-03-04 07:41:41,355 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 324 transitions. Word has length 246 [2025-03-04 07:41:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:41,355 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 324 transitions. [2025-03-04 07:41:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.0625) internal successors, (130), 32 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-04 07:41:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 324 transitions. [2025-03-04 07:41:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-04 07:41:41,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:41,357 INFO L218 NwaCegarLoop]: trace histogram [55, 54, 54, 54, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:41,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:41:41,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:41:41,562 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-04 07:41:41,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 322327824, now seen corresponding path program 6 times [2025-03-04 07:41:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581876905] [2025-03-04 07:41:41,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:41:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:41,588 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 266 statements into 33 equivalence classes. [2025-03-04 07:41:41,685 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 142 of 266 statements. [2025-03-04 07:41:41,686 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-04 07:41:41,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 2892 proven. 360 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2025-03-04 07:41:42,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581876905] [2025-03-04 07:41:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581876905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405262564] [2025-03-04 07:41:42,050 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:41:42,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:42,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:42,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:41:42,147 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 266 statements into 33 equivalence classes. [2025-03-04 07:41:42,326 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 142 of 266 statements. [2025-03-04 07:41:42,327 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-04 07:41:42,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 07:41:42,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 1165 proven. 2066 refuted. 0 times theorem prover too weak. 3285 trivial. 0 not checked. [2025-03-04 07:41:42,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 126 proven. 3105 refuted. 0 times theorem prover too weak. 3285 trivial. 0 not checked. [2025-03-04 07:41:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405262564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:43,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 52 [2025-03-04 07:41:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947407340] [2025-03-04 07:41:43,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:43,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 07:41:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:43,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 07:41:43,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 07:41:43,459 INFO L87 Difference]: Start difference. First operand 309 states and 324 transitions. Second operand has 52 states, 52 states have (on average 3.673076923076923) internal successors, (191), 52 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:43,758 INFO L93 Difference]: Finished difference Result 450 states and 469 transitions. [2025-03-04 07:41:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:41:43,758 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.673076923076923) internal successors, (191), 52 states have internal predecessors, (191), 0 states have call successors, (0), 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 266 [2025-03-04 07:41:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:43,760 INFO L225 Difference]: With dead ends: 450 [2025-03-04 07:41:43,760 INFO L226 Difference]: Without dead ends: 450 [2025-03-04 07:41:43,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 494 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=726, Invalid=3306, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 07:41:43,761 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 139 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:43,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 35 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-04 07:41:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 396. [2025-03-04 07:41:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 394 states have (on average 1.0507614213197969) internal successors, (414), 395 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 414 transitions. [2025-03-04 07:41:43,770 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 414 transitions. Word has length 266 [2025-03-04 07:41:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 414 transitions. [2025-03-04 07:41:43,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.673076923076923) internal successors, (191), 52 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 414 transitions. [2025-03-04 07:41:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 07:41:43,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:43,773 INFO L218 NwaCegarLoop]: trace histogram [56, 55, 55, 55, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:43,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:41:43,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:41:43,977 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-04 07:41:43,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 784035155, now seen corresponding path program 7 times [2025-03-04 07:41:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:43,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949871988] [2025-03-04 07:41:43,977 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:41:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:44,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 07:41:44,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 07:41:44,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:44,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6743 backedges. 4205 proven. 484 refuted. 0 times theorem prover too weak. 2054 trivial. 0 not checked. [2025-03-04 07:41:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949871988] [2025-03-04 07:41:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949871988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506341058] [2025-03-04 07:41:44,599 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:41:44,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:44,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:44,603 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:44,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:41:44,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 07:41:44,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 07:41:44,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:44,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:44,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:41:44,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6743 backedges. 4183 proven. 601 refuted. 0 times theorem prover too weak. 1959 trivial. 0 not checked. [2025-03-04 07:41:45,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6743 backedges. 4183 proven. 601 refuted. 0 times theorem prover too weak. 1959 trivial. 0 not checked. [2025-03-04 07:41:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506341058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:45,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 35 [2025-03-04 07:41:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80658558] [2025-03-04 07:41:45,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:45,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:41:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:45,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:41:45,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:41:45,275 INFO L87 Difference]: Start difference. First operand 396 states and 414 transitions. Second operand has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 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-04 07:41:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,111 INFO L93 Difference]: Finished difference Result 309 states and 319 transitions. [2025-03-04 07:41:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 07:41:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 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) Word has length 270 [2025-03-04 07:41:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,112 INFO L225 Difference]: With dead ends: 309 [2025-03-04 07:41:46,112 INFO L226 Difference]: Without dead ends: 309 [2025-03-04 07:41:46,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 517 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=920, Invalid=3772, Unknown=0, NotChecked=0, Total=4692 [2025-03-04 07:41:46,113 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:46,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 30 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:41:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-04 07:41:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-03-04 07:41:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 307 states have (on average 1.0390879478827362) internal successors, (319), 308 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 319 transitions. [2025-03-04 07:41:46,117 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 319 transitions. Word has length 270 [2025-03-04 07:41:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,118 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 319 transitions. [2025-03-04 07:41:46,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 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-04 07:41:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 319 transitions. [2025-03-04 07:41:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-04 07:41:46,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,120 INFO L218 NwaCegarLoop]: trace histogram [59, 58, 58, 58, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:46,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 07:41:46,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,320 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-04 07:41:46,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1307798224, now seen corresponding path program 8 times [2025-03-04 07:41:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278920293] [2025-03-04 07:41:46,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:46,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 282 statements into 2 equivalence classes. [2025-03-04 07:41:46,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 282 of 282 statements. [2025-03-04 07:41:46,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:46,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7448 backedges. 4997 proven. 890 refuted. 0 times theorem prover too weak. 1561 trivial. 0 not checked. [2025-03-04 07:41:46,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278920293] [2025-03-04 07:41:46,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278920293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684065459] [2025-03-04 07:41:46,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:46,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:46,921 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-04 07:41:46,923 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-04 07:41:47,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 282 statements into 2 equivalence classes. [2025-03-04 07:41:47,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 282 of 282 statements. [2025-03-04 07:41:47,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:47,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7448 backedges. 5060 proven. 922 refuted. 0 times theorem prover too weak. 1466 trivial. 0 not checked. [2025-03-04 07:41:47,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7448 backedges. 5060 proven. 922 refuted. 0 times theorem prover too weak. 1466 trivial. 0 not checked. [2025-03-04 07:41:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684065459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:47,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 39 [2025-03-04 07:41:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195593473] [2025-03-04 07:41:47,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:41:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:41:47,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:41:47,677 INFO L87 Difference]: Start difference. First operand 309 states and 319 transitions. Second operand has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,731 INFO L93 Difference]: Finished difference Result 309 states and 315 transitions. [2025-03-04 07:41:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 07:41:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 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 282 [2025-03-04 07:41:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,732 INFO L225 Difference]: With dead ends: 309 [2025-03-04 07:41:48,732 INFO L226 Difference]: Without dead ends: 309 [2025-03-04 07:41:48,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 538 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1302, Invalid=5340, Unknown=0, NotChecked=0, Total=6642 [2025-03-04 07:41:48,734 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:48,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 33 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:41:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-04 07:41:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-03-04 07:41:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 307 states have (on average 1.0260586319218241) internal successors, (315), 308 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-04 07:41:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 315 transitions. [2025-03-04 07:41:48,744 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 315 transitions. Word has length 282 [2025-03-04 07:41:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,744 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 315 transitions. [2025-03-04 07:41:48,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 315 transitions. [2025-03-04 07:41:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-04 07:41:48,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,746 INFO L218 NwaCegarLoop]: trace histogram [62, 61, 61, 61, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:48,754 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-04 07:41:48,946 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,SelfDestructingSolverStorable28 [2025-03-04 07:41:48,946 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1240935731, now seen corresponding path program 9 times [2025-03-04 07:41:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047413553] [2025-03-04 07:41:48,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:48,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:48,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 294 statements into 33 equivalence classes. [2025-03-04 07:41:49,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 294 statements. [2025-03-04 07:41:49,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 07:41:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8189 backedges. 2241 proven. 200 refuted. 0 times theorem prover too weak. 5748 trivial. 0 not checked. [2025-03-04 07:41:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047413553] [2025-03-04 07:41:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047413553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353218419] [2025-03-04 07:41:49,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:49,187 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-04 07:41:49,188 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-04 07:41:49,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 294 statements into 33 equivalence classes. [2025-03-04 07:41:49,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 294 statements. [2025-03-04 07:41:49,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 07:41:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:49,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:49,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8189 backedges. 2241 proven. 200 refuted. 0 times theorem prover too weak. 5748 trivial. 0 not checked. [2025-03-04 07:41:49,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8189 backedges. 2241 proven. 200 refuted. 0 times theorem prover too weak. 5748 trivial. 0 not checked. [2025-03-04 07:41:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353218419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:49,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-04 07:41:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578307764] [2025-03-04 07:41:49,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:49,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:41:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:49,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:41:49,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:49,671 INFO L87 Difference]: Start difference. First operand 309 states and 315 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:51,914 INFO L93 Difference]: Finished difference Result 356 states and 385 transitions. [2025-03-04 07:41:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:41:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 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 294 [2025-03-04 07:41:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:51,915 INFO L225 Difference]: With dead ends: 356 [2025-03-04 07:41:51,915 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 07:41:51,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:41:51,916 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:51,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 51 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 07:41:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-04 07:41:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 354 states have (on average 1.0875706214689265) internal successors, (385), 355 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 385 transitions. [2025-03-04 07:41:51,919 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 385 transitions. Word has length 294 [2025-03-04 07:41:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:51,919 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 385 transitions. [2025-03-04 07:41:51,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 385 transitions. [2025-03-04 07:41:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 07:41:51,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:51,920 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 61, 61, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:51,927 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-04 07:41:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:52,125 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:52,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash -185698008, now seen corresponding path program 3 times [2025-03-04 07:41:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975291709] [2025-03-04 07:41:52,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:52,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 295 statements into 33 equivalence classes. [2025-03-04 07:41:52,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 295 statements. [2025-03-04 07:41:52,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:41:52,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8250 backedges. 0 proven. 2331 refuted. 0 times theorem prover too weak. 5919 trivial. 0 not checked. [2025-03-04 07:41:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975291709] [2025-03-04 07:41:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975291709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177480823] [2025-03-04 07:41:52,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:52,252 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-04 07:41:52,254 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-04 07:41:52,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 295 statements into 33 equivalence classes. [2025-03-04 07:41:52,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 295 statements. [2025-03-04 07:41:52,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:41:52,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:52,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:52,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:52,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:52,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:52,419 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-04 07:41:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8250 backedges. 39 proven. 2292 refuted. 0 times theorem prover too weak. 5919 trivial. 0 not checked. [2025-03-04 07:41:52,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8250 backedges. 0 proven. 2331 refuted. 0 times theorem prover too weak. 5919 trivial. 0 not checked. [2025-03-04 07:41:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177480823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:54,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:54,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 07:41:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179346182] [2025-03-04 07:41:54,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:54,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:54,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:54,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:54,018 INFO L87 Difference]: Start difference. First operand 356 states and 385 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:54,082 INFO L93 Difference]: Finished difference Result 355 states and 373 transitions. [2025-03-04 07:41:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2025-03-04 07:41:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:54,093 INFO L225 Difference]: With dead ends: 355 [2025-03-04 07:41:54,093 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 07:41:54,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 581 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-04 07:41:54,093 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:54,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 07:41:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 07:41:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.0536723163841808) internal successors, (373), 354 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-04 07:41:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 373 transitions. [2025-03-04 07:41:54,097 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 373 transitions. Word has length 295 [2025-03-04 07:41:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 373 transitions. [2025-03-04 07:41:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 373 transitions. [2025-03-04 07:41:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-04 07:41:54,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:54,099 INFO L218 NwaCegarLoop]: trace histogram [74, 73, 73, 73, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:54,105 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-04 07:41:54,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:54,303 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-04 07:41:54,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1328567951, now seen corresponding path program 10 times [2025-03-04 07:41:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:54,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028354496] [2025-03-04 07:41:54,304 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:41:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:54,326 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 342 statements into 2 equivalence classes. [2025-03-04 07:41:54,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 342 of 342 statements. [2025-03-04 07:41:54,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:41:54,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11513 backedges. 7386 proven. 422 refuted. 0 times theorem prover too weak. 3705 trivial. 0 not checked. [2025-03-04 07:41:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028354496] [2025-03-04 07:41:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028354496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373301171] [2025-03-04 07:41:54,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:41:54,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:54,902 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-04 07:41:54,903 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-04 07:41:55,042 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 342 statements into 2 equivalence classes. [2025-03-04 07:41:55,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 342 of 342 statements. [2025-03-04 07:41:55,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:41:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:55,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:41:55,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11513 backedges. 7969 proven. 1338 refuted. 0 times theorem prover too weak. 2206 trivial. 0 not checked. [2025-03-04 07:41:55,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11513 backedges. 7969 proven. 1338 refuted. 0 times theorem prover too weak. 2206 trivial. 0 not checked. [2025-03-04 07:41:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373301171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:55,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 36 [2025-03-04 07:41:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816984564] [2025-03-04 07:41:55,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:55,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:41:55,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:55,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:41:55,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:41:55,885 INFO L87 Difference]: Start difference. First operand 355 states and 373 transitions. Second operand has 36 states, 36 states have (on average 5.083333333333333) internal successors, (183), 36 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-04 07:41:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:57,015 INFO L93 Difference]: Finished difference Result 355 states and 370 transitions. [2025-03-04 07:41:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 07:41:57,015 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.083333333333333) internal successors, (183), 36 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 342 [2025-03-04 07:41:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:57,016 INFO L225 Difference]: With dead ends: 355 [2025-03-04 07:41:57,016 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 07:41:57,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 653 SyntacticMatches, 16 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1602, Invalid=6230, Unknown=0, NotChecked=0, Total=7832 [2025-03-04 07:41:57,018 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:57,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 42 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:41:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 07:41:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 07:41:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.0451977401129944) internal successors, (370), 354 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 370 transitions. [2025-03-04 07:41:57,024 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 370 transitions. Word has length 342 [2025-03-04 07:41:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:57,024 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 370 transitions. [2025-03-04 07:41:57,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.083333333333333) internal successors, (183), 36 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-04 07:41:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 370 transitions. [2025-03-04 07:41:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 07:41:57,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:57,025 INFO L218 NwaCegarLoop]: trace histogram [76, 75, 75, 75, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:41:57,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:57,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:57,226 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-04 07:41:57,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1571414127, now seen corresponding path program 11 times [2025-03-04 07:41:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:57,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087571566] [2025-03-04 07:41:57,226 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:41:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:57,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 350 statements into 33 equivalence classes. [2025-03-04 07:41:57,646 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 345 of 350 statements. [2025-03-04 07:41:57,647 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 07:41:57,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12123 backedges. 8255 proven. 1100 refuted. 0 times theorem prover too weak. 2768 trivial. 0 not checked. [2025-03-04 07:41:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087571566] [2025-03-04 07:41:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087571566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849287763] [2025-03-04 07:41:58,307 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:41:58,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:58,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:58,309 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-04 07:41:58,310 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-04 07:41:58,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 350 statements into 33 equivalence classes. [2025-03-04 07:41:59,434 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 345 of 350 statements. [2025-03-04 07:41:59,434 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 07:41:59,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:59,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:41:59,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12123 backedges. 8479 proven. 2144 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2025-03-04 07:41:59,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12123 backedges. 8967 proven. 1656 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2025-03-04 07:42:00,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849287763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:00,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:00,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-04 07:42:00,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916327723] [2025-03-04 07:42:00,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:00,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 07:42:00,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:00,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 07:42:00,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:42:00,168 INFO L87 Difference]: Start difference. First operand 355 states and 370 transitions. Second operand has 45 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:01,510 INFO L93 Difference]: Finished difference Result 355 states and 368 transitions. [2025-03-04 07:42:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 07:42:01,511 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 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 350 [2025-03-04 07:42:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:01,512 INFO L225 Difference]: With dead ends: 355 [2025-03-04 07:42:01,512 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 07:42:01,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 662 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2235, Invalid=8067, Unknown=0, NotChecked=0, Total=10302 [2025-03-04 07:42:01,513 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:01,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 41 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:42:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 07:42:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 07:42:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.03954802259887) internal successors, (368), 354 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 368 transitions. [2025-03-04 07:42:01,517 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 368 transitions. Word has length 350 [2025-03-04 07:42:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:01,517 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 368 transitions. [2025-03-04 07:42:01,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 368 transitions. [2025-03-04 07:42:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 07:42:01,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:01,518 INFO L218 NwaCegarLoop]: trace histogram [77, 76, 76, 76, 10, 9, 9, 9, 9, 1, 1, 1] [2025-03-04 07:42:01,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 07:42:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:01,719 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-04 07:42:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1611959602, now seen corresponding path program 12 times [2025-03-04 07:42:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:42:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97821082] [2025-03-04 07:42:01,720 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:42:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:42:01,740 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 354 statements into 33 equivalence classes. [2025-03-04 07:42:01,857 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 233 of 354 statements. [2025-03-04 07:42:01,857 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-04 07:42:01,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12434 backedges. 2422 proven. 5322 refuted. 0 times theorem prover too weak. 4690 trivial. 0 not checked. [2025-03-04 07:42:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:42:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97821082] [2025-03-04 07:42:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97821082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362826967] [2025-03-04 07:42:02,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:42:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:02,452 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-04 07:42:02,453 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-04 07:42:02,626 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 354 statements into 33 equivalence classes. [2025-03-04 07:42:03,051 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 233 of 354 statements. [2025-03-04 07:42:03,051 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-04 07:42:03,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:03,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:42:03,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12434 backedges. 1925 proven. 5322 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2025-03-04 07:42:03,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12434 backedges. 0 proven. 7247 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2025-03-04 07:42:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362826967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:04,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 19] total 62 [2025-03-04 07:42:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689131446] [2025-03-04 07:42:04,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:04,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 07:42:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:04,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 07:42:04,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=3123, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 07:42:04,876 INFO L87 Difference]: Start difference. First operand 355 states and 368 transitions. Second operand has 63 states, 62 states have (on average 3.564516129032258) internal successors, (221), 63 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:10,271 INFO L93 Difference]: Finished difference Result 640 states and 692 transitions. [2025-03-04 07:42:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-04 07:42:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.564516129032258) internal successors, (221), 63 states have internal predecessors, (221), 0 states have call successors, (0), 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 354 [2025-03-04 07:42:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:10,273 INFO L225 Difference]: With dead ends: 640 [2025-03-04 07:42:10,273 INFO L226 Difference]: Without dead ends: 640 [2025-03-04 07:42:10,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 671 SyntacticMatches, 1 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8314 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6570, Invalid=18236, Unknown=0, NotChecked=0, Total=24806 [2025-03-04 07:42:10,275 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 553 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:10,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 37 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:42:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-04 07:42:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 546. [2025-03-04 07:42:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.0568807339449542) internal successors, (576), 545 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 576 transitions. [2025-03-04 07:42:10,281 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 576 transitions. Word has length 354 [2025-03-04 07:42:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:10,281 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 576 transitions. [2025-03-04 07:42:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.564516129032258) internal successors, (221), 63 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 576 transitions. [2025-03-04 07:42:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-04 07:42:10,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:10,283 INFO L218 NwaCegarLoop]: trace histogram [121, 120, 120, 120, 13, 12, 12, 12, 12, 1, 1, 1] [2025-03-04 07:42:10,293 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-04 07:42:10,483 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,SelfDestructingSolverStorable33 [2025-03-04 07:42:10,484 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-04 07:42:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1720403595, now seen corresponding path program 13 times [2025-03-04 07:42:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:42:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896736285] [2025-03-04 07:42:10,484 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:42:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:42:10,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-04 07:42:10,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-04 07:42:10,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:10,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 30594 backedges. 20091 proven. 5651 refuted. 0 times theorem prover too weak. 4852 trivial. 0 not checked. [2025-03-04 07:42:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:42:12,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896736285] [2025-03-04 07:42:12,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896736285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:12,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693517078] [2025-03-04 07:42:12,032 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:42:12,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:12,034 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-04 07:42:12,034 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-04 07:42:12,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-04 07:42:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-04 07:42:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:12,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1991 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:42:12,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30594 backedges. 22452 proven. 3276 refuted. 0 times theorem prover too weak. 4866 trivial. 0 not checked. [2025-03-04 07:42:12,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30594 backedges. 22452 proven. 3276 refuted. 0 times theorem prover too weak. 4866 trivial. 0 not checked. [2025-03-04 07:42:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693517078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:13,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 44 [2025-03-04 07:42:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859140024] [2025-03-04 07:42:13,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 07:42:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:13,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 07:42:13,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:42:13,258 INFO L87 Difference]: Start difference. First operand 546 states and 576 transitions. Second operand has 44 states, 44 states have (on average 5.340909090909091) internal successors, (235), 44 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:15,078 INFO L93 Difference]: Finished difference Result 553 states and 577 transitions. [2025-03-04 07:42:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-04 07:42:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.340909090909091) internal successors, (235), 44 states have internal predecessors, (235), 0 states have call successors, (0), 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 545 [2025-03-04 07:42:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:15,080 INFO L225 Difference]: With dead ends: 553 [2025-03-04 07:42:15,080 INFO L226 Difference]: Without dead ends: 553 [2025-03-04 07:42:15,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1055 SyntacticMatches, 21 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5521 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4069, Invalid=13753, Unknown=0, NotChecked=0, Total=17822 [2025-03-04 07:42:15,083 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:15,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 41 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:42:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-04 07:42:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2025-03-04 07:42:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.0455373406193078) internal successors, (574), 549 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 574 transitions. [2025-03-04 07:42:15,087 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 574 transitions. Word has length 545 [2025-03-04 07:42:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:15,087 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 574 transitions. [2025-03-04 07:42:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.340909090909091) internal successors, (235), 44 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 574 transitions. [2025-03-04 07:42:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-03-04 07:42:15,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:15,090 INFO L218 NwaCegarLoop]: trace histogram [122, 121, 121, 121, 13, 12, 12, 12, 12, 1, 1, 1] [2025-03-04 07:42:15,101 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-04 07:42:15,290 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,SelfDestructingSolverStorable34 [2025-03-04 07:42:15,291 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-04 07:42:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1569494568, now seen corresponding path program 14 times [2025-03-04 07:42:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:42:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970838471] [2025-03-04 07:42:15,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:42:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:42:15,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 549 statements into 2 equivalence classes. [2025-03-04 07:42:15,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 549 of 549 statements. [2025-03-04 07:42:15,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:42:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 31088 backedges. 2091 proven. 27772 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-04 07:42:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:42:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970838471] [2025-03-04 07:42:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970838471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786371191] [2025-03-04 07:42:18,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:42:18,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:18,810 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-04 07:42:18,811 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-04 07:42:19,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 549 statements into 2 equivalence classes. [2025-03-04 07:42:19,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 549 of 549 statements. [2025-03-04 07:42:19,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:42:19,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:19,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:42:19,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 31088 backedges. 12094 proven. 15851 refuted. 0 times theorem prover too weak. 3143 trivial. 0 not checked. [2025-03-04 07:42:19,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31088 backedges. 12094 proven. 15851 refuted. 0 times theorem prover too weak. 3143 trivial. 0 not checked. [2025-03-04 07:42:20,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786371191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:20,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 28, 28] total 88 [2025-03-04 07:42:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573412594] [2025-03-04 07:42:20,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:20,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-03-04 07:42:20,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:20,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-03-04 07:42:20,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1182, Invalid=6474, Unknown=0, NotChecked=0, Total=7656 [2025-03-04 07:42:20,437 INFO L87 Difference]: Start difference. First operand 550 states and 574 transitions. Second operand has 88 states, 88 states have (on average 4.738636363636363) internal successors, (417), 88 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:22,725 INFO L93 Difference]: Finished difference Result 610 states and 633 transitions. [2025-03-04 07:42:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-03-04 07:42:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 4.738636363636363) internal successors, (417), 88 states have internal predecessors, (417), 0 states have call successors, (0), 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 549 [2025-03-04 07:42:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:22,727 INFO L225 Difference]: With dead ends: 610 [2025-03-04 07:42:22,727 INFO L226 Difference]: Without dead ends: 610 [2025-03-04 07:42:22,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1267 GetRequests, 1063 SyntacticMatches, 17 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13536 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=6675, Invalid=28857, Unknown=0, NotChecked=0, Total=35532 [2025-03-04 07:42:22,731 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:22,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:42:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-04 07:42:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2025-03-04 07:42:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.0396039603960396) internal successors, (630), 606 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 630 transitions. [2025-03-04 07:42:22,737 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 630 transitions. Word has length 549 [2025-03-04 07:42:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 630 transitions. [2025-03-04 07:42:22,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 4.738636363636363) internal successors, (417), 88 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 630 transitions. [2025-03-04 07:42:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-04 07:42:22,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:22,742 INFO L218 NwaCegarLoop]: trace histogram [134, 133, 133, 133, 14, 13, 13, 13, 13, 1, 1, 1] [2025-03-04 07:42:22,752 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-04 07:42:22,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 07:42:22,943 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-04 07:42:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 862439603, now seen corresponding path program 15 times [2025-03-04 07:42:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:42:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286455880] [2025-03-04 07:42:22,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:42:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:42:22,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 48 equivalence classes. [2025-03-04 07:42:23,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 359 of 602 statements. [2025-03-04 07:42:23,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-04 07:42:23,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 37523 backedges. 0 proven. 11257 refuted. 0 times theorem prover too weak. 26266 trivial. 0 not checked. [2025-03-04 07:42:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:42:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286455880] [2025-03-04 07:42:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286455880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303893585] [2025-03-04 07:42:23,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:42:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:23,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:23,907 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-04 07:42:23,908 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-04 07:42:24,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 48 equivalence classes. [2025-03-04 07:42:25,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 359 of 602 statements. [2025-03-04 07:42:25,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-04 07:42:25,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:25,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 07:42:25,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 37523 backedges. 10289 proven. 968 refuted. 0 times theorem prover too weak. 26266 trivial. 0 not checked. [2025-03-04 07:42:25,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 37523 backedges. 10289 proven. 968 refuted. 0 times theorem prover too weak. 26266 trivial. 0 not checked. [2025-03-04 07:42:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303893585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:26,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 73 [2025-03-04 07:42:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136872514] [2025-03-04 07:42:26,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-04 07:42:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:26,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-04 07:42:26,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=900, Invalid=4502, Unknown=0, NotChecked=0, Total=5402 [2025-03-04 07:42:26,561 INFO L87 Difference]: Start difference. First operand 607 states and 630 transitions. Second operand has 74 states, 73 states have (on average 4.027397260273973) internal successors, (294), 74 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:28,682 INFO L93 Difference]: Finished difference Result 688 states and 731 transitions. [2025-03-04 07:42:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:42:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 4.027397260273973) internal successors, (294), 74 states have internal predecessors, (294), 0 states have call successors, (0), 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 602 [2025-03-04 07:42:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:28,684 INFO L225 Difference]: With dead ends: 688 [2025-03-04 07:42:28,684 INFO L226 Difference]: Without dead ends: 688 [2025-03-04 07:42:28,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1157 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2023, Invalid=9107, Unknown=0, NotChecked=0, Total=11130 [2025-03-04 07:42:28,685 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:28,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 115 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:42:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-04 07:42:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 647. [2025-03-04 07:42:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.0526315789473684) internal successors, (680), 646 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 680 transitions. [2025-03-04 07:42:28,689 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 680 transitions. Word has length 602 [2025-03-04 07:42:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:28,690 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 680 transitions. [2025-03-04 07:42:28,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 4.027397260273973) internal successors, (294), 74 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 680 transitions. [2025-03-04 07:42:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-04 07:42:28,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:28,692 INFO L218 NwaCegarLoop]: trace histogram [144, 143, 143, 143, 14, 13, 13, 13, 13, 1, 1, 1] [2025-03-04 07:42:28,710 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-04 07:42:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:28,893 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:42:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -356108587, now seen corresponding path program 16 times [2025-03-04 07:42:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:42:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380590692] [2025-03-04 07:42:28,893 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:42:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:42:28,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 642 statements into 2 equivalence classes. [2025-03-04 07:42:29,066 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 642 of 642 statements. [2025-03-04 07:42:29,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:42:29,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 43173 backedges. 31475 proven. 4592 refuted. 0 times theorem prover too weak. 7106 trivial. 0 not checked. [2025-03-04 07:42:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:42:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380590692] [2025-03-04 07:42:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380590692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676031206] [2025-03-04 07:42:30,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:42:30,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:30,191 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-04 07:42:30,192 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-04 07:42:30,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 642 statements into 2 equivalence classes. [2025-03-04 07:42:32,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 642 of 642 statements. [2025-03-04 07:42:32,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:42:32,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:32,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 2322 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:42:32,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 43173 backedges. 31869 proven. 4192 refuted. 0 times theorem prover too weak. 7112 trivial. 0 not checked. [2025-03-04 07:42:32,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 43173 backedges. 31869 proven. 4192 refuted. 0 times theorem prover too weak. 7112 trivial. 0 not checked. [2025-03-04 07:42:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676031206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:33,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 42 [2025-03-04 07:42:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663709053] [2025-03-04 07:42:33,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:33,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 07:42:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:33,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 07:42:33,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1327, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:42:33,091 INFO L87 Difference]: Start difference. First operand 647 states and 680 transitions. Second operand has 42 states, 42 states have (on average 5.190476190476191) internal successors, (218), 42 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:34,876 INFO L93 Difference]: Finished difference Result 647 states and 677 transitions. [2025-03-04 07:42:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-04 07:42:34,876 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 5.190476190476191) internal successors, (218), 42 states have internal predecessors, (218), 0 states have call successors, (0), 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 642 [2025-03-04 07:42:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:34,878 INFO L225 Difference]: With dead ends: 647 [2025-03-04 07:42:34,878 INFO L226 Difference]: Without dead ends: 647 [2025-03-04 07:42:34,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1414 GetRequests, 1247 SyntacticMatches, 24 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6545 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5550, Invalid=15330, Unknown=0, NotChecked=0, Total=20880 [2025-03-04 07:42:34,881 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:34,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 46 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:42:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-04 07:42:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2025-03-04 07:42:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.0479876160990713) internal successors, (677), 646 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 677 transitions. [2025-03-04 07:42:34,885 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 677 transitions. Word has length 642 [2025-03-04 07:42:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:34,886 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 677 transitions. [2025-03-04 07:42:34,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.190476190476191) internal successors, (218), 42 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 677 transitions. [2025-03-04 07:42:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-03-04 07:42:34,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:34,888 INFO L218 NwaCegarLoop]: trace histogram [145, 144, 144, 144, 14, 13, 13, 13, 13, 1, 1, 1] [2025-03-04 07:42:34,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 07:42:35,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 07:42:35,089 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:42:35,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1733136754, now seen corresponding path program 17 times [2025-03-04 07:42:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:42:35,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280905547] [2025-03-04 07:42:35,089 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:42:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:42:35,125 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 646 statements into 48 equivalence classes. [2025-03-04 07:42:36,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) and asserted 568 of 646 statements. [2025-03-04 07:42:36,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2025-03-04 07:42:36,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 43760 backedges. 26642 proven. 1081 refuted. 0 times theorem prover too weak. 16037 trivial. 0 not checked. [2025-03-04 07:42:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:42:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280905547] [2025-03-04 07:42:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280905547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186050852] [2025-03-04 07:42:37,598 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:42:37,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:37,600 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-04 07:42:37,601 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-04 07:42:37,830 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 646 statements into 48 equivalence classes. [2025-03-04 07:42:41,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) and asserted 568 of 646 statements. [2025-03-04 07:42:41,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2025-03-04 07:42:41,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:41,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 2037 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:42:41,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 43760 backedges. 19961 proven. 19203 refuted. 0 times theorem prover too weak. 4596 trivial. 0 not checked. [2025-03-04 07:42:42,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 43760 backedges. 19961 proven. 19203 refuted. 0 times theorem prover too weak. 4596 trivial. 0 not checked. [2025-03-04 07:42:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186050852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:42,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:42:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 70 [2025-03-04 07:42:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120017836] [2025-03-04 07:42:42,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:42,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-03-04 07:42:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:42:42,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-03-04 07:42:42,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=4016, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 07:42:42,921 INFO L87 Difference]: Start difference. First operand 647 states and 677 transitions. Second operand has 70 states, 70 states have (on average 4.7) internal successors, (329), 70 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:46,696 INFO L93 Difference]: Finished difference Result 776 states and 809 transitions. [2025-03-04 07:42:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-03-04 07:42:46,697 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.7) internal successors, (329), 70 states have internal predecessors, (329), 0 states have call successors, (0), 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 646 [2025-03-04 07:42:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:46,701 INFO L225 Difference]: With dead ends: 776 [2025-03-04 07:42:46,701 INFO L226 Difference]: Without dead ends: 776 [2025-03-04 07:42:46,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1500 GetRequests, 1230 SyntacticMatches, 25 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23737 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9377, Invalid=51385, Unknown=0, NotChecked=0, Total=60762 [2025-03-04 07:42:46,717 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 226 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:46,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 46 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 07:42:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-04 07:42:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 773. [2025-03-04 07:42:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.044041450777202) internal successors, (806), 772 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 806 transitions. [2025-03-04 07:42:46,747 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 806 transitions. Word has length 646 [2025-03-04 07:42:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:46,748 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 806 transitions. [2025-03-04 07:42:46,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.7) internal successors, (329), 70 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:42:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 806 transitions. [2025-03-04 07:42:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2025-03-04 07:42:46,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:46,760 INFO L218 NwaCegarLoop]: trace histogram [173, 172, 172, 172, 16, 15, 15, 15, 15, 1, 1, 1] [2025-03-04 07:42:46,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0