./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pr4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14a75e050103eb09182e049a798a738dec478e3acaa4fb01ae8649b715b8362f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:16:15,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:16:15,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:16:15,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:16:15,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:16:15,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:16:15,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:16:15,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:16:15,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:16:15,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:16:15,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:16:15,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:16:15,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:16:15,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:16:15,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:16:15,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:16:15,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:16:15,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:16:15,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:16:15,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:16:15,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:16:15,149 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 ! call(reach_error())) ) 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 -> 14a75e050103eb09182e049a798a738dec478e3acaa4fb01ae8649b715b8362f [2025-03-03 09:16:15,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:16:15,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:16:15,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:16:15,391 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:16:15,391 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:16:15,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr4.c [2025-03-03 09:16:16,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0090f6a86/ba40946c590746e7aa0af74d02c97195/FLAG39d14a2bf [2025-03-03 09:16:16,761 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:16:16,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr4.c [2025-03-03 09:16:16,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0090f6a86/ba40946c590746e7aa0af74d02c97195/FLAG39d14a2bf [2025-03-03 09:16:16,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0090f6a86/ba40946c590746e7aa0af74d02c97195 [2025-03-03 09:16:16,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:16:16,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:16:16,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:16:16,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:16:16,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:16:16,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:16,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c07f97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16, skipping insertion in model container [2025-03-03 09:16:16,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:16,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:16:16,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr4.c[394,407] [2025-03-03 09:16:16,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:16:16,937 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:16:16,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr4.c[394,407] [2025-03-03 09:16:16,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:16:16,967 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:16:16,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16 WrapperNode [2025-03-03 09:16:16,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:16:16,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:16:16,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:16:16,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:16:16,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:16,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:16,997 INFO L138 Inliner]: procedures = 15, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-03-03 09:16:16,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:16:16,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:16:16,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:16:16,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:16:17,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,019 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 8 writes are split as follows [0, 0, 8]. [2025-03-03 09:16:17,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:16:17,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:16:17,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:16:17,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:16:17,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (1/1) ... [2025-03-03 09:16:17,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:16:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:17,063 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-03 09:16:17,067 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-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:16:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:16:17,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:16:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:16:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:16:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:16:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:16:17,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:16:17,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:16:17,286 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:16:17,286 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:16:17,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:16:17,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:16:17,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:16:17 BoogieIcfgContainer [2025-03-03 09:16:17,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:16:17,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:16:17,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:16:17,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:16:17,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:16:16" (1/3) ... [2025-03-03 09:16:17,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45764320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:16:17, skipping insertion in model container [2025-03-03 09:16:17,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:16" (2/3) ... [2025-03-03 09:16:17,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45764320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:16:17, skipping insertion in model container [2025-03-03 09:16:17,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:16:17" (3/3) ... [2025-03-03 09:16:17,305 INFO L128 eAbstractionObserver]: Analyzing ICFG pr4.c [2025-03-03 09:16:17,317 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:16:17,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr4.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:16:17,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:16:17,365 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=LoopHeads, 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;@10c1cd60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:16:17,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:16:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 09:16:17,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:17,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:17,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:17,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1897115003, now seen corresponding path program 1 times [2025-03-03 09:16:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:17,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454589500] [2025-03-03 09:16:17,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:17,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:16:17,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:16:17,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:17,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:17,513 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-03 09:16:17,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454589500] [2025-03-03 09:16:17,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454589500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:17,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:17,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:16:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208850055] [2025-03-03 09:16:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:16:17,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:17,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:16:17,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:16:17,532 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:17,541 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2025-03-03 09:16:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:16:17,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 09:16:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:17,548 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:16:17,548 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 09:16:17,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:16:17,552 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:17,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 09:16:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 09:16:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-03 09:16:17,575 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2025-03-03 09:16:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:17,575 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-03 09:16:17,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-03 09:16:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 09:16:17,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:17,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:17,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:16:17,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:17,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash -655041958, now seen corresponding path program 1 times [2025-03-03 09:16:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672973826] [2025-03-03 09:16:17,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:17,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:17,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:16:17,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:16:17,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:17,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:17,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:17,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672973826] [2025-03-03 09:16:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672973826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:17,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:16:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327701364] [2025-03-03 09:16:17,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:17,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:16:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:17,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:16:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:16:17,871 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:17,933 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-03 09:16:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:16:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 09:16:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:17,934 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:16:17,934 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:16:17,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:16:17,934 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:16:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:16:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2025-03-03 09:16:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-03 09:16:17,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 12 [2025-03-03 09:16:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:17,938 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-03 09:16:17,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-03 09:16:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:16:17,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:17,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:17,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:16:17,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:17,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash 537302484, now seen corresponding path program 1 times [2025-03-03 09:16:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:17,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504733018] [2025-03-03 09:16:17,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:17,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:16:17,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:16:17,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:17,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:18,492 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-03 09:16:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504733018] [2025-03-03 09:16:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504733018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989894379] [2025-03-03 09:16:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:18,495 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-03 09:16:18,497 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-03 09:16:18,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:16:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:16:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:18,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:16:18,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:18,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:16:18,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:18,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:18,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:18,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:18,769 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-03 09:16:18,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:18,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:18,844 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 16 treesize of output 14 [2025-03-03 09:16:18,859 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-03 09:16:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989894379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:18,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:18,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 18 [2025-03-03 09:16:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498993269] [2025-03-03 09:16:18,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:18,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:16:18,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:18,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:16:18,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:16:18,862 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:19,390 INFO L93 Difference]: Finished difference Result 111 states and 152 transitions. [2025-03-03 09:16:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:16:19,390 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:16:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:19,391 INFO L225 Difference]: With dead ends: 111 [2025-03-03 09:16:19,391 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 09:16:19,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:16:19,392 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 253 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:19,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 130 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:16:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 09:16:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 37. [2025-03-03 09:16:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2025-03-03 09:16:19,398 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 18 [2025-03-03 09:16:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:19,398 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-03 09:16:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2025-03-03 09:16:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:16:19,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:19,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:19,405 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-03 09:16:19,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:19,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:19,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 537332275, now seen corresponding path program 1 times [2025-03-03 09:16:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135189868] [2025-03-03 09:16:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:19,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:16:19,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:16:19,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:19,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:16:19,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135189868] [2025-03-03 09:16:19,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135189868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:19,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:19,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:16:19,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013703933] [2025-03-03 09:16:19,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:19,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:16:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:19,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:16:19,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:16:19,677 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:19,691 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2025-03-03 09:16:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:16:19,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:16:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:19,693 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:16:19,695 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 09:16:19,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 09:16:19,695 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:19,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 09:16:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-03 09:16:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-03-03 09:16:19,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 18 [2025-03-03 09:16:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:19,701 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-03-03 09:16:19,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-03-03 09:16:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:16:19,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:19,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:19,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:16:19,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1259648875, now seen corresponding path program 1 times [2025-03-03 09:16:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608830496] [2025-03-03 09:16:19,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:19,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:19,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:16:19,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:16:19,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:19,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608830496] [2025-03-03 09:16:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608830496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:16:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339220809] [2025-03-03 09:16:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:16:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:19,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:16:19,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:16:19,757 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:19,787 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2025-03-03 09:16:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:16:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:16:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:19,789 INFO L225 Difference]: With dead ends: 63 [2025-03-03 09:16:19,789 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 09:16:19,789 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-03 09:16:19,792 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:19,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 09:16:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2025-03-03 09:16:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2025-03-03 09:16:19,800 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 18 [2025-03-03 09:16:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:19,801 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2025-03-03 09:16:19,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2025-03-03 09:16:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:16:19,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:19,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:16:19,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1227863958, now seen corresponding path program 1 times [2025-03-03 09:16:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683367044] [2025-03-03 09:16:19,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:19,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:16:19,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:16:19,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:19,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:20,101 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-03 09:16:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683367044] [2025-03-03 09:16:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683367044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041757994] [2025-03-03 09:16:20,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:20,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:20,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:20,104 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-03 09:16:20,106 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-03 09:16:20,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:16:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:16:20,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:20,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 09:16:20,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:20,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:20,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:16:20,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:16:20,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:16:20,295 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-03 09:16:20,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:20,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-03 09:16:20,358 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 14 treesize of output 12 [2025-03-03 09:16:20,368 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-03 09:16:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041757994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:20,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 16 [2025-03-03 09:16:20,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708385663] [2025-03-03 09:16:20,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:20,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:16:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:20,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:16:20,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:16:20,370 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:20,767 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2025-03-03 09:16:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 09:16:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:16:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:20,768 INFO L225 Difference]: With dead ends: 101 [2025-03-03 09:16:20,768 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:16:20,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:16:20,769 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:20,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 101 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:16:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:16:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2025-03-03 09:16:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-03-03 09:16:20,781 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 18 [2025-03-03 09:16:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:20,781 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-03-03 09:16:20,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-03-03 09:16:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:16:20,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:20,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:20,789 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-03 09:16:20,982 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,SelfDestructingSolverStorable5 [2025-03-03 09:16:20,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:20,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1711321114, now seen corresponding path program 1 times [2025-03-03 09:16:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:20,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085768705] [2025-03-03 09:16:20,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:20,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:16:21,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:16:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085768705] [2025-03-03 09:16:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085768705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933189505] [2025-03-03 09:16:21,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:21,287 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-03 09:16:21,289 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-03 09:16:21,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:16:21,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:16:21,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:21,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:21,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 09:16:21,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:21,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:16:21,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:21,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:21,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:21,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:21,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:21,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:16:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:21,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933189505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:21,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:21,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-03-03 09:16:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547127762] [2025-03-03 09:16:21,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:21,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:16:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:21,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:16:21,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:16:21,649 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:22,408 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2025-03-03 09:16:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 09:16:22,409 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 09:16:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:22,409 INFO L225 Difference]: With dead ends: 190 [2025-03-03 09:16:22,409 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 09:16:22,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:16:22,411 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 426 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:22,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 173 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:16:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 09:16:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 81. [2025-03-03 09:16:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.3125) internal successors, (105), 80 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-03 09:16:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2025-03-03 09:16:22,421 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 23 [2025-03-03 09:16:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:22,421 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2025-03-03 09:16:22,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2025-03-03 09:16:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:16:22,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:22,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:22,428 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-03 09:16:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:22,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -284732712, now seen corresponding path program 1 times [2025-03-03 09:16:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799188896] [2025-03-03 09:16:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:22,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:16:22,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:16:22,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:22,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799188896] [2025-03-03 09:16:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799188896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638518554] [2025-03-03 09:16:22,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:22,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:22,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:22,834 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-03 09:16:22,835 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-03 09:16:22,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:16:22,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:16:22,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:22,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:22,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 09:16:22,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:22,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:22,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:16:22,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:16:22,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:16:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:22,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:23,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:23,045 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 16 treesize of output 12 [2025-03-03 09:16:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638518554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:23,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:23,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2025-03-03 09:16:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319858172] [2025-03-03 09:16:23,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:16:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:23,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:16:23,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:16:23,058 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:23,371 INFO L93 Difference]: Finished difference Result 150 states and 194 transitions. [2025-03-03 09:16:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:16:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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 23 [2025-03-03 09:16:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:23,372 INFO L225 Difference]: With dead ends: 150 [2025-03-03 09:16:23,372 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 09:16:23,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:16:23,373 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:23,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 124 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:16:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 09:16:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2025-03-03 09:16:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2025-03-03 09:16:23,380 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 23 [2025-03-03 09:16:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:23,380 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-03-03 09:16:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2025-03-03 09:16:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:16:23,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:23,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:23,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:16:23,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:23,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:23,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -61023791, now seen corresponding path program 1 times [2025-03-03 09:16:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597747459] [2025-03-03 09:16:23,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:23,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:16:23,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:16:23,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:23,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597747459] [2025-03-03 09:16:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597747459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:23,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:23,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:23,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490714597] [2025-03-03 09:16:23,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:23,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:23,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:23,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:23,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:23,610 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:23,628 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2025-03-03 09:16:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:16:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:23,629 INFO L225 Difference]: With dead ends: 118 [2025-03-03 09:16:23,630 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 09:16:23,630 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-03 09:16:23,630 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:23,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 09:16:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2025-03-03 09:16:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 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-03 09:16:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-03-03 09:16:23,640 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 24 [2025-03-03 09:16:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:23,640 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-03-03 09:16:23,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-03-03 09:16:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:16:23,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:23,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:16:23,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1581641324, now seen corresponding path program 2 times [2025-03-03 09:16:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172656266] [2025-03-03 09:16:23,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:23,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:16:23,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:16:23,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:23,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172656266] [2025-03-03 09:16:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172656266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002381683] [2025-03-03 09:16:23,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:23,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:23,872 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-03 09:16:23,873 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-03 09:16:23,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:16:23,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:16:23,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:23,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:16:23,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:23,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:16:23,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:24,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:24,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:24,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:24,146 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 18 treesize of output 14 [2025-03-03 09:16:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002381683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:24,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:24,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2025-03-03 09:16:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116033304] [2025-03-03 09:16:24,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:24,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:16:24,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:24,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:16:24,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:16:24,162 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 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-03 09:16:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:24,748 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2025-03-03 09:16:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 09:16:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 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 28 [2025-03-03 09:16:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:24,750 INFO L225 Difference]: With dead ends: 188 [2025-03-03 09:16:24,750 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 09:16:24,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=404, Invalid=1576, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 09:16:24,751 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 168 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:24,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 147 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:16:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 09:16:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 90. [2025-03-03 09:16:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 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-03 09:16:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2025-03-03 09:16:24,758 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 28 [2025-03-03 09:16:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2025-03-03 09:16:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 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-03 09:16:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2025-03-03 09:16:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:16:24,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:24,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:24,765 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-03 09:16:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:16:24,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1868854101, now seen corresponding path program 1 times [2025-03-03 09:16:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132231792] [2025-03-03 09:16:24,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:24,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:16:24,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:16:24,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:25,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132231792] [2025-03-03 09:16:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132231792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:25,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015900346] [2025-03-03 09:16:25,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:25,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:25,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:25,126 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-03 09:16:25,127 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-03 09:16:25,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:16:25,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:16:25,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:25,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:25,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 09:16:25,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:25,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:25,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:25,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:25,352 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 16 treesize of output 12 [2025-03-03 09:16:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015900346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:25,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2025-03-03 09:16:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86975293] [2025-03-03 09:16:25,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:25,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:16:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:25,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:16:25,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:16:25,356 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:25,800 INFO L93 Difference]: Finished difference Result 245 states and 325 transitions. [2025-03-03 09:16:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:16:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-03 09:16:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:25,801 INFO L225 Difference]: With dead ends: 245 [2025-03-03 09:16:25,801 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 09:16:25,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:16:25,802 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 109 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:25,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 102 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:16:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 09:16:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 104. [2025-03-03 09:16:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2025-03-03 09:16:25,814 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 28 [2025-03-03 09:16:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:25,815 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2025-03-03 09:16:25,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2025-03-03 09:16:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:16:25,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:25,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:25,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:26,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:26,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 536025116, now seen corresponding path program 1 times [2025-03-03 09:16:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74985999] [2025-03-03 09:16:26,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:26,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:16:26,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:16:26,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:26,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:16:26,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:26,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74985999] [2025-03-03 09:16:26,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74985999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:26,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:26,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:26,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492238323] [2025-03-03 09:16:26,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:26,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:26,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:26,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:26,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:26,039 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:26,059 INFO L93 Difference]: Finished difference Result 147 states and 188 transitions. [2025-03-03 09:16:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 09:16:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:26,060 INFO L225 Difference]: With dead ends: 147 [2025-03-03 09:16:26,060 INFO L226 Difference]: Without dead ends: 118 [2025-03-03 09:16:26,061 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-03 09:16:26,061 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:26,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-03 09:16:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2025-03-03 09:16:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 103 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions. [2025-03-03 09:16:26,071 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 29 [2025-03-03 09:16:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:26,071 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 133 transitions. [2025-03-03 09:16:26,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2025-03-03 09:16:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:16:26,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:26,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:26,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:16:26,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:26,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash -760175780, now seen corresponding path program 2 times [2025-03-03 09:16:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816818297] [2025-03-03 09:16:26,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:26,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 09:16:26,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:16:26,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:16:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:26,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816818297] [2025-03-03 09:16:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816818297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069808178] [2025-03-03 09:16:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:26,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:26,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:26,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:26,104 INFO L87 Difference]: Start difference. First operand 104 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:26,125 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2025-03-03 09:16:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 09:16:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:26,126 INFO L225 Difference]: With dead ends: 132 [2025-03-03 09:16:26,126 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 09:16:26,127 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-03 09:16:26,127 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:26,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 09:16:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2025-03-03 09:16:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2025-03-03 09:16:26,137 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 29 [2025-03-03 09:16:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:26,137 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2025-03-03 09:16:26,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2025-03-03 09:16:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:16:26,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:26,138 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:26,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:16:26,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:26,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash 669289562, now seen corresponding path program 3 times [2025-03-03 09:16:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077222536] [2025-03-03 09:16:26,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:26,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-03-03 09:16:26,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:16:26,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:16:26,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077222536] [2025-03-03 09:16:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077222536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297755161] [2025-03-03 09:16:26,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:26,487 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-03 09:16:26,489 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-03 09:16:26,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-03-03 09:16:26,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:16:26,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:16:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:26,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:16:26,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:26,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 09:16:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:26,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:26,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:26,749 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 16 treesize of output 12 [2025-03-03 09:16:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297755161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:26,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 25 [2025-03-03 09:16:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777792586] [2025-03-03 09:16:26,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:26,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:16:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:26,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:16:26,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:16:26,755 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:28,205 INFO L93 Difference]: Finished difference Result 345 states and 423 transitions. [2025-03-03 09:16:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-03 09:16:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 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 33 [2025-03-03 09:16:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:28,206 INFO L225 Difference]: With dead ends: 345 [2025-03-03 09:16:28,206 INFO L226 Difference]: Without dead ends: 290 [2025-03-03 09:16:28,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=937, Invalid=5383, Unknown=0, NotChecked=0, Total=6320 [2025-03-03 09:16:28,209 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 209 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:28,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 184 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:16:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-03 09:16:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 206. [2025-03-03 09:16:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 205 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 263 transitions. [2025-03-03 09:16:28,223 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 263 transitions. Word has length 33 [2025-03-03 09:16:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:28,223 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 263 transitions. [2025-03-03 09:16:28,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 263 transitions. [2025-03-03 09:16:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:16:28,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:28,223 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:28,230 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-03 09:16:28,424 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-03 09:16:28,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash -575474919, now seen corresponding path program 1 times [2025-03-03 09:16:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662511349] [2025-03-03 09:16:28,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:28,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:16:28,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:16:28,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:28,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662511349] [2025-03-03 09:16:28,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662511349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570237427] [2025-03-03 09:16:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:28,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:28,636 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-03 09:16:28,638 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-03 09:16:28,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:16:28,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:16:28,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:28,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:28,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:16:28,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:28,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:16:28,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:28,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:28,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:28,931 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 18 treesize of output 14 [2025-03-03 09:16:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570237427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:28,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2025-03-03 09:16:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125065000] [2025-03-03 09:16:28,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:16:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:16:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:16:28,944 INFO L87 Difference]: Start difference. First operand 206 states and 263 transitions. Second operand has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 24 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:29,682 INFO L93 Difference]: Finished difference Result 482 states and 606 transitions. [2025-03-03 09:16:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 09:16:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 24 states have internal predecessors, (88), 0 states have call successors, (0), 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 33 [2025-03-03 09:16:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:29,683 INFO L225 Difference]: With dead ends: 482 [2025-03-03 09:16:29,683 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 09:16:29,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=583, Invalid=2497, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 09:16:29,685 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 211 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:29,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 166 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:16:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 09:16:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 276. [2025-03-03 09:16:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 275 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 346 transitions. [2025-03-03 09:16:29,704 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 346 transitions. Word has length 33 [2025-03-03 09:16:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 346 transitions. [2025-03-03 09:16:29,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 24 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 346 transitions. [2025-03-03 09:16:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:16:29,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:29,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:29,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:16:29,905 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-03 09:16:29,905 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:29,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2084886005, now seen corresponding path program 2 times [2025-03-03 09:16:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:29,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375618716] [2025-03-03 09:16:29,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:29,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:16:29,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:16:29,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:29,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375618716] [2025-03-03 09:16:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375618716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408218920] [2025-03-03 09:16:30,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:30,069 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-03 09:16:30,070 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-03 09:16:30,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:16:30,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:16:30,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:30,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:30,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:16:30,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:30,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408218920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:30,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:30,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2025-03-03 09:16:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510417876] [2025-03-03 09:16:30,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:30,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 09:16:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:30,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 09:16:30,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:16:30,491 INFO L87 Difference]: Start difference. First operand 276 states and 346 transitions. Second operand has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 27 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:30,651 INFO L93 Difference]: Finished difference Result 387 states and 467 transitions. [2025-03-03 09:16:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:16:30,652 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 27 states have internal predecessors, (101), 0 states have call successors, (0), 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 38 [2025-03-03 09:16:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:30,653 INFO L225 Difference]: With dead ends: 387 [2025-03-03 09:16:30,653 INFO L226 Difference]: Without dead ends: 336 [2025-03-03 09:16:30,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:16:30,654 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 131 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:30,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 124 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:16:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-03 09:16:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 282. [2025-03-03 09:16:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.2491103202846976) internal successors, (351), 281 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 351 transitions. [2025-03-03 09:16:30,673 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 351 transitions. Word has length 38 [2025-03-03 09:16:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 351 transitions. [2025-03-03 09:16:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 27 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 351 transitions. [2025-03-03 09:16:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:16:30,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:30,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:30,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:16:30,875 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-03 09:16:30,875 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 213443913, now seen corresponding path program 1 times [2025-03-03 09:16:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113217893] [2025-03-03 09:16:30,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:30,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:30,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:16:30,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:16:30,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:30,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:16:30,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113217893] [2025-03-03 09:16:30,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113217893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:30,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:30,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:30,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896122150] [2025-03-03 09:16:30,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:30,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:30,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:30,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:30,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:30,902 INFO L87 Difference]: Start difference. First operand 282 states and 351 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-03 09:16:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:30,941 INFO L93 Difference]: Finished difference Result 385 states and 472 transitions. [2025-03-03 09:16:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 09:16:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:30,942 INFO L225 Difference]: With dead ends: 385 [2025-03-03 09:16:30,942 INFO L226 Difference]: Without dead ends: 261 [2025-03-03 09:16:30,942 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-03 09:16:30,942 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:30,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-03 09:16:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 232. [2025-03-03 09:16:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.2207792207792207) internal successors, (282), 231 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 282 transitions. [2025-03-03 09:16:30,961 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 282 transitions. Word has length 40 [2025-03-03 09:16:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:30,962 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 282 transitions. [2025-03-03 09:16:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-03 09:16:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 282 transitions. [2025-03-03 09:16:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:16:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:30,963 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:16:30,963 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:30,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash 75588941, now seen corresponding path program 4 times [2025-03-03 09:16:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840852153] [2025-03-03 09:16:30,964 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:16:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:30,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-03 09:16:30,982 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:16:30,984 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:16:30,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840852153] [2025-03-03 09:16:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840852153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092370871] [2025-03-03 09:16:31,276 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:16:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:31,278 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-03 09:16:31,279 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-03 09:16:31,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-03 09:16:31,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:16:31,342 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:16:31,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:31,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:16:31,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:31,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:16:31,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:31,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:31,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:31,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:31,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:31,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:16:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092370871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:31,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 34 [2025-03-03 09:16:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061756809] [2025-03-03 09:16:31,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:31,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 09:16:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:31,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 09:16:31,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:16:31,814 INFO L87 Difference]: Start difference. First operand 232 states and 282 transitions. Second operand has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 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-03 09:16:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:33,852 INFO L93 Difference]: Finished difference Result 528 states and 614 transitions. [2025-03-03 09:16:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-03 09:16:33,853 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 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) Word has length 44 [2025-03-03 09:16:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:33,854 INFO L225 Difference]: With dead ends: 528 [2025-03-03 09:16:33,854 INFO L226 Difference]: Without dead ends: 519 [2025-03-03 09:16:33,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3237 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1451, Invalid=10321, Unknown=0, NotChecked=0, Total=11772 [2025-03-03 09:16:33,857 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 282 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:33,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 478 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:16:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-03 09:16:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 283. [2025-03-03 09:16:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.1950354609929077) internal successors, (337), 282 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 337 transitions. [2025-03-03 09:16:33,879 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 337 transitions. Word has length 44 [2025-03-03 09:16:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 337 transitions. [2025-03-03 09:16:33,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 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-03 09:16:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 337 transitions. [2025-03-03 09:16:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:16:33,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:33,879 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:33,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:16:34,084 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:34,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash -547664685, now seen corresponding path program 1 times [2025-03-03 09:16:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:34,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766221008] [2025-03-03 09:16:34,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:34,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:16:34,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:16:34,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:34,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:34,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766221008] [2025-03-03 09:16:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766221008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503075633] [2025-03-03 09:16:34,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:34,356 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-03 09:16:34,359 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-03 09:16:34,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:16:34,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:16:34,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:34,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:34,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:16:34,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:34,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:34,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:34,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:16:34,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:16:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:16:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:34,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:34,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:34,829 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 16 treesize of output 12 [2025-03-03 09:16:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503075633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:34,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14] total 29 [2025-03-03 09:16:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401080933] [2025-03-03 09:16:34,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:34,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 09:16:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:34,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 09:16:34,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:16:34,837 INFO L87 Difference]: Start difference. First operand 283 states and 337 transitions. Second operand has 29 states, 29 states have (on average 3.413793103448276) internal successors, (99), 29 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:36,090 INFO L93 Difference]: Finished difference Result 556 states and 653 transitions. [2025-03-03 09:16:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-03 09:16:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.413793103448276) internal successors, (99), 29 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 09:16:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:36,092 INFO L225 Difference]: With dead ends: 556 [2025-03-03 09:16:36,092 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 09:16:36,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=909, Invalid=6231, Unknown=0, NotChecked=0, Total=7140 [2025-03-03 09:16:36,094 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 186 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:36,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 288 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:16:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 09:16:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 339. [2025-03-03 09:16:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.1952662721893492) internal successors, (404), 338 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 404 transitions. [2025-03-03 09:16:36,123 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 404 transitions. Word has length 44 [2025-03-03 09:16:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:36,123 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 404 transitions. [2025-03-03 09:16:36,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.413793103448276) internal successors, (99), 29 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 404 transitions. [2025-03-03 09:16:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:16:36,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:36,124 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:36,129 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-03 09:16:36,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:36,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:36,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1198105665, now seen corresponding path program 5 times [2025-03-03 09:16:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759026316] [2025-03-03 09:16:36,325 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:16:36,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:36,331 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 6 equivalence classes. [2025-03-03 09:16:36,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:16:36,338 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:16:36,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:36,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759026316] [2025-03-03 09:16:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759026316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285555911] [2025-03-03 09:16:36,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:16:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:36,589 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-03 09:16:36,589 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-03 09:16:36,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 6 equivalence classes. [2025-03-03 09:16:36,664 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:16:36,664 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:16:36,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:36,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 09:16:36,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:36,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 09:16:36,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:16:36,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:16:36,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-03 09:16:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:36,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:37,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:37,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:16:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285555911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:37,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:37,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2025-03-03 09:16:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089104145] [2025-03-03 09:16:37,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:37,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 09:16:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:37,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 09:16:37,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 09:16:37,159 INFO L87 Difference]: Start difference. First operand 339 states and 404 transitions. Second operand has 37 states, 37 states have (on average 3.6486486486486487) internal successors, (135), 37 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:39,899 INFO L93 Difference]: Finished difference Result 727 states and 852 transitions. [2025-03-03 09:16:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-03 09:16:39,900 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.6486486486486487) internal successors, (135), 37 states have internal predecessors, (135), 0 states have call successors, (0), 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 49 [2025-03-03 09:16:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:39,901 INFO L225 Difference]: With dead ends: 727 [2025-03-03 09:16:39,901 INFO L226 Difference]: Without dead ends: 713 [2025-03-03 09:16:39,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5799 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2142, Invalid=15680, Unknown=0, NotChecked=0, Total=17822 [2025-03-03 09:16:39,905 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 407 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:39,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 414 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:16:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-03 09:16:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 386. [2025-03-03 09:16:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.1896103896103896) internal successors, (458), 385 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 458 transitions. [2025-03-03 09:16:39,940 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 458 transitions. Word has length 49 [2025-03-03 09:16:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:39,940 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 458 transitions. [2025-03-03 09:16:39,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.6486486486486487) internal successors, (135), 37 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 458 transitions. [2025-03-03 09:16:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:16:39,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:39,941 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:39,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:16:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:40,142 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1014731427, now seen corresponding path program 2 times [2025-03-03 09:16:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804530088] [2025-03-03 09:16:40,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:40,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:16:40,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:16:40,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:40,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:40,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804530088] [2025-03-03 09:16:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804530088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:40,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795847482] [2025-03-03 09:16:40,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:40,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:40,373 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-03 09:16:40,375 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-03 09:16:40,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:16:40,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:16:40,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:40,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:40,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:16:40,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:40,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:40,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:16:40,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:16:40,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:16:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:40,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:40,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:40,857 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 16 treesize of output 12 [2025-03-03 09:16:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795847482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:40,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 13] total 29 [2025-03-03 09:16:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688893735] [2025-03-03 09:16:40,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:40,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 09:16:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:40,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 09:16:40,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:16:40,865 INFO L87 Difference]: Start difference. First operand 386 states and 458 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 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-03 09:16:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:42,804 INFO L93 Difference]: Finished difference Result 728 states and 861 transitions. [2025-03-03 09:16:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-03-03 09:16:42,804 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-03 09:16:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:42,806 INFO L225 Difference]: With dead ends: 728 [2025-03-03 09:16:42,806 INFO L226 Difference]: Without dead ends: 726 [2025-03-03 09:16:42,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1914, Invalid=15116, Unknown=0, NotChecked=0, Total=17030 [2025-03-03 09:16:42,808 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 296 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:42,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 254 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:16:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-03 09:16:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 384. [2025-03-03 09:16:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.1879895561357703) internal successors, (455), 383 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 455 transitions. [2025-03-03 09:16:42,854 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 455 transitions. Word has length 49 [2025-03-03 09:16:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:42,854 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 455 transitions. [2025-03-03 09:16:42,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 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-03 09:16:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 455 transitions. [2025-03-03 09:16:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:16:42,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:42,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:42,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:16:43,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 09:16:43,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1695747051, now seen corresponding path program 1 times [2025-03-03 09:16:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672306038] [2025-03-03 09:16:43,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:16:43,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:16:43,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 09:16:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672306038] [2025-03-03 09:16:43,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672306038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:43,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:43,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:43,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337308413] [2025-03-03 09:16:43,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:43,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:43,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:43,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:43,087 INFO L87 Difference]: Start difference. First operand 384 states and 455 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-03 09:16:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:43,128 INFO L93 Difference]: Finished difference Result 583 states and 689 transitions. [2025-03-03 09:16:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-03 09:16:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:43,130 INFO L225 Difference]: With dead ends: 583 [2025-03-03 09:16:43,130 INFO L226 Difference]: Without dead ends: 335 [2025-03-03 09:16:43,131 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-03 09:16:43,132 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:43,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-03 09:16:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 251. [2025-03-03 09:16:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.144) internal successors, (286), 250 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 286 transitions. [2025-03-03 09:16:43,167 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 286 transitions. Word has length 51 [2025-03-03 09:16:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:43,167 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 286 transitions. [2025-03-03 09:16:43,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 286 transitions. [2025-03-03 09:16:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:16:43,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:43,167 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:43,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 09:16:43,172 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:43,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash 39230925, now seen corresponding path program 6 times [2025-03-03 09:16:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212913821] [2025-03-03 09:16:43,172 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:16:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:43,189 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 7 equivalence classes. [2025-03-03 09:16:43,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:16:43,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:16:43,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 12 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212913821] [2025-03-03 09:16:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212913821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513001276] [2025-03-03 09:16:43,486 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:16:43,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:43,488 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-03 09:16:43,495 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-03 09:16:43,552 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 7 equivalence classes. [2025-03-03 09:16:43,620 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:16:43,620 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:16:43,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:43,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:16:43,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:43,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 09:16:43,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:16:43,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-03 09:16:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 12 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:43,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:43,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:43,979 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 18 treesize of output 14 [2025-03-03 09:16:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 12 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:43,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513001276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:43,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:43,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2025-03-03 09:16:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818886211] [2025-03-03 09:16:43,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:43,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:16:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:43,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:16:43,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:16:43,987 INFO L87 Difference]: Start difference. First operand 251 states and 286 transitions. Second operand has 32 states, 32 states have (on average 4.25) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:46,534 INFO L93 Difference]: Finished difference Result 573 states and 633 transitions. [2025-03-03 09:16:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-03 09:16:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.25) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 09:16:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:46,535 INFO L225 Difference]: With dead ends: 573 [2025-03-03 09:16:46,535 INFO L226 Difference]: Without dead ends: 564 [2025-03-03 09:16:46,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5228 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1734, Invalid=14522, Unknown=0, NotChecked=0, Total=16256 [2025-03-03 09:16:46,537 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 297 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:46,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 448 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:16:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-03 09:16:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 249. [2025-03-03 09:16:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.1451612903225807) internal successors, (284), 248 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 284 transitions. [2025-03-03 09:16:46,563 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 284 transitions. Word has length 54 [2025-03-03 09:16:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:46,563 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 284 transitions. [2025-03-03 09:16:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.25) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 284 transitions. [2025-03-03 09:16:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:16:46,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:46,564 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:46,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:16:46,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:46,764 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1777780912, now seen corresponding path program 2 times [2025-03-03 09:16:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:46,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268250094] [2025-03-03 09:16:46,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:46,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-03 09:16:46,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:16:46,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:46,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268250094] [2025-03-03 09:16:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268250094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739405658] [2025-03-03 09:16:46,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:46,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:46,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:46,998 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-03 09:16:46,999 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-03 09:16:47,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-03 09:16:47,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:16:47,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:47,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:47,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:16:47,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:47,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:16:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:47,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:47,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:47,433 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 16 treesize of output 12 [2025-03-03 09:16:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739405658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:47,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:47,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 32 [2025-03-03 09:16:47,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129620144] [2025-03-03 09:16:47,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:47,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:16:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:47,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:16:47,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:16:47,441 INFO L87 Difference]: Start difference. First operand 249 states and 284 transitions. Second operand has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:50,387 INFO L93 Difference]: Finished difference Result 817 states and 922 transitions. [2025-03-03 09:16:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2025-03-03 09:16:50,387 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 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 54 [2025-03-03 09:16:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:50,389 INFO L225 Difference]: With dead ends: 817 [2025-03-03 09:16:50,389 INFO L226 Difference]: Without dead ends: 815 [2025-03-03 09:16:50,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13392 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2656, Invalid=31754, Unknown=0, NotChecked=0, Total=34410 [2025-03-03 09:16:50,391 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 212 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3381 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 3809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 3381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:50,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 507 Invalid, 3809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 3381 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:16:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-03 09:16:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 271. [2025-03-03 09:16:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.137037037037037) internal successors, (307), 270 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 307 transitions. [2025-03-03 09:16:50,422 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 307 transitions. Word has length 54 [2025-03-03 09:16:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:50,422 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 307 transitions. [2025-03-03 09:16:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 307 transitions. [2025-03-03 09:16:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 09:16:50,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:50,424 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:50,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:16:50,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:50,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash 277068737, now seen corresponding path program 7 times [2025-03-03 09:16:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315431449] [2025-03-03 09:16:50,626 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:16:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:50,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 09:16:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 09:16:50,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:50,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315431449] [2025-03-03 09:16:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315431449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297508658] [2025-03-03 09:16:50,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:16:50,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:50,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:50,859 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-03 09:16:50,862 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-03 09:16:50,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 09:16:50,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 09:16:50,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:50,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 09:16:50,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:51,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:16:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:51,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:51,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:16:51,407 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 16 treesize of output 12 [2025-03-03 09:16:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297508658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:51,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 34 [2025-03-03 09:16:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831667962] [2025-03-03 09:16:51,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 09:16:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:51,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 09:16:51,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:16:51,416 INFO L87 Difference]: Start difference. First operand 271 states and 307 transitions. Second operand has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:55,601 INFO L93 Difference]: Finished difference Result 908 states and 1020 transitions. [2025-03-03 09:16:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2025-03-03 09:16:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 0 states have call successors, (0), 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 59 [2025-03-03 09:16:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:55,603 INFO L225 Difference]: With dead ends: 908 [2025-03-03 09:16:55,603 INFO L226 Difference]: Without dead ends: 906 [2025-03-03 09:16:55,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19419 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3638, Invalid=44982, Unknown=0, NotChecked=0, Total=48620 [2025-03-03 09:16:55,607 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 264 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 5502 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 5502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:55,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 733 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 5502 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 09:16:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-03 09:16:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 279. [2025-03-03 09:16:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.1366906474820144) internal successors, (316), 278 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 316 transitions. [2025-03-03 09:16:55,652 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 316 transitions. Word has length 59 [2025-03-03 09:16:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:55,653 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 316 transitions. [2025-03-03 09:16:55,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 316 transitions. [2025-03-03 09:16:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 09:16:55,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:55,653 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:55,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 09:16:55,854 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,SelfDestructingSolverStorable24 [2025-03-03 09:16:55,854 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 666517982, now seen corresponding path program 3 times [2025-03-03 09:16:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817875543] [2025-03-03 09:16:55,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:55,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 8 equivalence classes. [2025-03-03 09:16:55,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 09:16:55,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:16:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 89 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817875543] [2025-03-03 09:16:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817875543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330791923] [2025-03-03 09:16:56,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:56,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:56,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:56,291 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-03 09:16:56,292 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-03 09:16:56,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 8 equivalence classes. [2025-03-03 09:16:56,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 09:16:56,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:16:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:56,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:16:56,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:56,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 09:16:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 14 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:56,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:56,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:16:56,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:16:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 14 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330791923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:56,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 41 [2025-03-03 09:16:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191844366] [2025-03-03 09:16:56,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:56,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:16:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:56,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:16:56,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:16:56,945 INFO L87 Difference]: Start difference. First operand 279 states and 316 transitions. Second operand has 41 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:03,003 INFO L93 Difference]: Finished difference Result 896 states and 986 transitions. [2025-03-03 09:17:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2025-03-03 09:17:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 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 59 [2025-03-03 09:17:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:03,005 INFO L225 Difference]: With dead ends: 896 [2025-03-03 09:17:03,005 INFO L226 Difference]: Without dead ends: 742 [2025-03-03 09:17:03,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19646 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4370, Invalid=48760, Unknown=0, NotChecked=0, Total=53130 [2025-03-03 09:17:03,008 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 606 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:03,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 449 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:17:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-03 09:17:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 350. [2025-03-03 09:17:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.1203438395415473) internal successors, (391), 349 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 391 transitions. [2025-03-03 09:17:03,063 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 391 transitions. Word has length 59 [2025-03-03 09:17:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:03,063 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 391 transitions. [2025-03-03 09:17:03,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 391 transitions. [2025-03-03 09:17:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 09:17:03,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:03,064 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:03,071 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-03 09:17:03,265 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-03 09:17:03,266 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:03,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1595590476, now seen corresponding path program 8 times [2025-03-03 09:17:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346854040] [2025-03-03 09:17:03,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:17:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:03,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-03 09:17:03,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 09:17:03,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:17:03,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 136 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346854040] [2025-03-03 09:17:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346854040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414661644] [2025-03-03 09:17:03,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:17:03,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:03,527 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-03 09:17:03,528 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-03 09:17:03,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-03 09:17:03,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 09:17:03,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:17:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:03,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:17:03,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 172 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:03,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 172 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414661644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:04,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 43 [2025-03-03 09:17:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706157783] [2025-03-03 09:17:04,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:04,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 09:17:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:04,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 09:17:04,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1336, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:17:04,186 INFO L87 Difference]: Start difference. First operand 350 states and 391 transitions. Second operand has 43 states, 43 states have (on average 4.186046511627907) internal successors, (180), 43 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:04,463 INFO L93 Difference]: Finished difference Result 545 states and 606 transitions. [2025-03-03 09:17:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:17:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.186046511627907) internal successors, (180), 43 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 09:17:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:04,464 INFO L225 Difference]: With dead ends: 545 [2025-03-03 09:17:04,464 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 09:17:04,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=621, Invalid=1829, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 09:17:04,465 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 226 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:04,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 253 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:17:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 09:17:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 374. [2025-03-03 09:17:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.1126005361930296) internal successors, (415), 373 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 415 transitions. [2025-03-03 09:17:04,508 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 415 transitions. Word has length 64 [2025-03-03 09:17:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:04,508 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 415 transitions. [2025-03-03 09:17:04,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.186046511627907) internal successors, (180), 43 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 415 transitions. [2025-03-03 09:17:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 09:17:04,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:04,509 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:04,515 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-03 09:17:04,709 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-03 09:17:04,710 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:04,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash 491624902, now seen corresponding path program 9 times [2025-03-03 09:17:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:04,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545006751] [2025-03-03 09:17:04,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:04,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 9 equivalence classes. [2025-03-03 09:17:04,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:17:04,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:17:04,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 16 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545006751] [2025-03-03 09:17:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545006751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571069713] [2025-03-03 09:17:05,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:05,150 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-03 09:17:05,151 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-03 09:17:05,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 9 equivalence classes. [2025-03-03 09:17:05,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:17:05,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:17:05,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:05,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 09:17:05,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:05,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 09:17:05,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:17:05,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:17:05,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:17:05,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-03 09:17:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 16 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:05,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:06,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:17:06,009 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 18 treesize of output 14 [2025-03-03 09:17:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 16 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571069713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:06,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 41 [2025-03-03 09:17:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801988951] [2025-03-03 09:17:06,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:17:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:17:06,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1514, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:17:06,021 INFO L87 Difference]: Start difference. First operand 374 states and 415 transitions. Second operand has 41 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:15,116 INFO L93 Difference]: Finished difference Result 1106 states and 1202 transitions. [2025-03-03 09:17:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2025-03-03 09:17:15,116 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 09:17:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:15,118 INFO L225 Difference]: With dead ends: 1106 [2025-03-03 09:17:15,118 INFO L226 Difference]: Without dead ends: 1097 [2025-03-03 09:17:15,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40842 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5958, Invalid=96122, Unknown=0, NotChecked=0, Total=102080 [2025-03-03 09:17:15,122 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 569 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 5665 mSolverCounterSat, 740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 6405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 740 IncrementalHoareTripleChecker+Valid, 5665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:15,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1057 Invalid, 6405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [740 Valid, 5665 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 09:17:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-03-03 09:17:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 389. [2025-03-03 09:17:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.1108247422680413) internal successors, (431), 388 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 431 transitions. [2025-03-03 09:17:15,170 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 431 transitions. Word has length 70 [2025-03-03 09:17:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:15,170 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 431 transitions. [2025-03-03 09:17:15,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.390243902439025) internal successors, (180), 41 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 431 transitions. [2025-03-03 09:17:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 09:17:15,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:15,171 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:15,178 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-03 09:17:15,371 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-03 09:17:15,371 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:15,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2137280144, now seen corresponding path program 2 times [2025-03-03 09:17:15,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:15,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966382031] [2025-03-03 09:17:15,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:17:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:15,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-03 09:17:15,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:17:15,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:17:15,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:15,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966382031] [2025-03-03 09:17:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966382031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470789525] [2025-03-03 09:17:15,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:17:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:15,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:15,723 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-03 09:17:15,725 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-03 09:17:15,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-03 09:17:15,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:17:15,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:17:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:15,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 09:17:15,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:15,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:17:15,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:17:15,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:17:15,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:15,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:17:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:16,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:16,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:17:16,445 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 16 treesize of output 12 [2025-03-03 09:17:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470789525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:16,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 39 [2025-03-03 09:17:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8408371] [2025-03-03 09:17:16,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 09:17:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:16,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 09:17:16,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:17:16,455 INFO L87 Difference]: Start difference. First operand 389 states and 431 transitions. Second operand has 39 states, 39 states have (on average 3.871794871794872) internal successors, (151), 39 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-03 09:17:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:22,252 INFO L93 Difference]: Finished difference Result 1189 states and 1332 transitions. [2025-03-03 09:17:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 288 states. [2025-03-03 09:17:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.871794871794872) internal successors, (151), 39 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) Word has length 70 [2025-03-03 09:17:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:22,254 INFO L225 Difference]: With dead ends: 1189 [2025-03-03 09:17:22,254 INFO L226 Difference]: Without dead ends: 1187 [2025-03-03 09:17:22,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40308 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5724, Invalid=89448, Unknown=0, NotChecked=0, Total=95172 [2025-03-03 09:17:22,258 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 412 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 5303 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 5858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 5303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:22,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 771 Invalid, 5858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 5303 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 09:17:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-03-03 09:17:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 426. [2025-03-03 09:17:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.1152941176470588) internal successors, (474), 425 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 474 transitions. [2025-03-03 09:17:22,312 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 474 transitions. Word has length 70 [2025-03-03 09:17:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:22,312 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 474 transitions. [2025-03-03 09:17:22,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.871794871794872) internal successors, (151), 39 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-03 09:17:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 474 transitions. [2025-03-03 09:17:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 09:17:22,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:22,313 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 7, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:22,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 09:17:22,516 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-03 09:17:22,516 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1486377832, now seen corresponding path program 10 times [2025-03-03 09:17:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064143192] [2025-03-03 09:17:22,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:22,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-03 09:17:22,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 09:17:22,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 18 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064143192] [2025-03-03 09:17:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064143192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513887127] [2025-03-03 09:17:23,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:23,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:23,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:23,040 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-03 09:17:23,040 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-03 09:17:23,120 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-03 09:17:23,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 09:17:23,145 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:23,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:17:23,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:23,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:17:23,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:17:23,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:17:23,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:17:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 18 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:23,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:24,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:17:24,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:17:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 18 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513887127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:24,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 53 [2025-03-03 09:17:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051022922] [2025-03-03 09:17:24,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:24,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-03 09:17:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:24,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-03 09:17:24,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2588, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 09:17:24,151 INFO L87 Difference]: Start difference. First operand 426 states and 474 transitions. Second operand has 53 states, 53 states have (on average 4.018867924528302) internal successors, (213), 53 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:40,156 INFO L93 Difference]: Finished difference Result 1370 states and 1490 transitions. [2025-03-03 09:17:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 357 states. [2025-03-03 09:17:40,157 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.018867924528302) internal successors, (213), 53 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 09:17:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:40,159 INFO L225 Difference]: With dead ends: 1370 [2025-03-03 09:17:40,159 INFO L226 Difference]: Without dead ends: 1356 [2025-03-03 09:17:40,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64310 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=11230, Invalid=154826, Unknown=0, NotChecked=0, Total=166056 [2025-03-03 09:17:40,164 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 977 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 7620 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 8569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 7620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:40,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1408 Invalid, 8569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 7620 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 09:17:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-03 09:17:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 461. [2025-03-03 09:17:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.1152173913043477) internal successors, (513), 460 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 513 transitions. [2025-03-03 09:17:40,224 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 513 transitions. Word has length 75 [2025-03-03 09:17:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:40,224 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 513 transitions. [2025-03-03 09:17:40,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.018867924528302) internal successors, (213), 53 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 513 transitions. [2025-03-03 09:17:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 09:17:40,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:40,225 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:40,231 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-03 09:17:40,425 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-03 09:17:40,425 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:40,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1046603998, now seen corresponding path program 3 times [2025-03-03 09:17:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:40,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767105408] [2025-03-03 09:17:40,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:40,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 10 equivalence classes. [2025-03-03 09:17:40,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 09:17:40,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 09:17:40,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767105408] [2025-03-03 09:17:40,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767105408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456688375] [2025-03-03 09:17:40,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:40,783 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-03 09:17:40,785 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-03 09:17:40,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 10 equivalence classes. [2025-03-03 09:17:41,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 09:17:41,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 09:17:41,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:41,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 09:17:41,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:41,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 09:17:41,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-03 09:17:41,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:41,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-03 09:17:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:41,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:41,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:17:41,560 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 16 treesize of output 12 [2025-03-03 09:17:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456688375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:41,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:41,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 35 [2025-03-03 09:17:41,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391789308] [2025-03-03 09:17:41,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:41,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:17:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:41,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:17:41,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:17:41,570 INFO L87 Difference]: Start difference. First operand 461 states and 513 transitions. Second operand has 35 states, 35 states have (on average 4.0) internal successors, (140), 35 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:46,600 INFO L93 Difference]: Finished difference Result 977 states and 1094 transitions. [2025-03-03 09:17:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2025-03-03 09:17:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.0) internal successors, (140), 35 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 09:17:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:46,602 INFO L225 Difference]: With dead ends: 977 [2025-03-03 09:17:46,603 INFO L226 Difference]: Without dead ends: 975 [2025-03-03 09:17:46,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29171 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4644, Invalid=65846, Unknown=0, NotChecked=0, Total=70490 [2025-03-03 09:17:46,605 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 401 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:46,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 679 Invalid, 4360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 09:17:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-03 09:17:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 464. [2025-03-03 09:17:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.1144708423326133) internal successors, (516), 463 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 516 transitions. [2025-03-03 09:17:46,668 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 516 transitions. Word has length 75 [2025-03-03 09:17:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 516 transitions. [2025-03-03 09:17:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.0) internal successors, (140), 35 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 516 transitions. [2025-03-03 09:17:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 09:17:46,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:46,669 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 8, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:46,676 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-03 09:17:46,869 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-03 09:17:46,869 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:46,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1619676934, now seen corresponding path program 11 times [2025-03-03 09:17:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825259554] [2025-03-03 09:17:46,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:17:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:46,877 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 11 equivalence classes. [2025-03-03 09:17:46,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 09:17:46,894 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:17:46,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:47,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825259554] [2025-03-03 09:17:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825259554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979981790] [2025-03-03 09:17:47,261 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:17:47,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:47,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:47,263 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-03 09:17:47,264 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-03 09:17:47,351 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 11 equivalence classes. [2025-03-03 09:17:47,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 09:17:47,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:17:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:47,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:17:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:47,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:17:47,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:17:47,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:17:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:47,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:48,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:17:48,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:17:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979981790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:48,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 37 [2025-03-03 09:17:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036413751] [2025-03-03 09:17:48,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:48,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 09:17:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:48,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 09:17:48,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 09:17:48,139 INFO L87 Difference]: Start difference. First operand 464 states and 516 transitions. Second operand has 37 states, 37 states have (on average 4.243243243243243) internal successors, (157), 37 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)