./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/nr2.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 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:24:13,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:24:13,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:24:13,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:24:13,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:24:13,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:24:13,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:24:13,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:24:13,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:24:13,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:24:13,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:24:13,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:24:13,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:24:13,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:24:13,746 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:24:13,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:24:13,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:24:13,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:24:13,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:24:13,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:24:13,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:24:13,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:24:13,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:13,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:24:13,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:24:13,748 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 -> 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 [2025-03-08 00:24:13,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:24:13,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:24:13,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:24:13,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:24:13,963 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:24:13,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr2.c [2025-03-08 00:24:15,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b13e340/58ba6011e15b43a59f6f9734f72c17ee/FLAGde22e01b9 [2025-03-08 00:24:15,317 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:24:15,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c [2025-03-08 00:24:15,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b13e340/58ba6011e15b43a59f6f9734f72c17ee/FLAGde22e01b9 [2025-03-08 00:24:15,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b13e340/58ba6011e15b43a59f6f9734f72c17ee [2025-03-08 00:24:15,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:24:15,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:24:15,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:15,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:24:15,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:24:15,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a37f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15, skipping insertion in model container [2025-03-08 00:24:15,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:24:15,787 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/nr2.c[394,407] [2025-03-08 00:24:15,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:15,813 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:24:15,821 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/nr2.c[394,407] [2025-03-08 00:24:15,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:15,841 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:24:15,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15 WrapperNode [2025-03-08 00:24:15,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:15,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:15,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:24:15,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:24:15,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,871 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-08 00:24:15,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:15,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:24:15,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:24:15,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:24:15,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,892 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-03-08 00:24:15,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:24:15,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:24:15,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:24:15,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:24:15,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (1/1) ... [2025-03-08 00:24:15,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:15,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:15,932 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-08 00:24:15,935 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-08 00:24:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:24:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:24:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:24:15,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:24:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:24:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:24:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:24:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:24:15,999 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:24:16,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:24:16,148 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 00:24:16,148 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:24:16,154 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:24:16,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:24:16,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:16 BoogieIcfgContainer [2025-03-08 00:24:16,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:24:16,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:24:16,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:24:16,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:24:16,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:24:15" (1/3) ... [2025-03-08 00:24:16,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e5916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:16, skipping insertion in model container [2025-03-08 00:24:16,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:15" (2/3) ... [2025-03-08 00:24:16,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e5916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:16, skipping insertion in model container [2025-03-08 00:24:16,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:16" (3/3) ... [2025-03-08 00:24:16,162 INFO L128 eAbstractionObserver]: Analyzing ICFG nr2.c [2025-03-08 00:24:16,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:24:16,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr2.c that has 1 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:24:16,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:24:16,213 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;@1c27406f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:24:16,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:24:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:24:16,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:16,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:16,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:16,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1768238075, now seen corresponding path program 1 times [2025-03-08 00:24:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:16,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882727538] [2025-03-08 00:24:16,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:16,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:24:16,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:24:16,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:16,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,336 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-08 00:24:16,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:16,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882727538] [2025-03-08 00:24:16,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882727538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:16,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:16,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:24:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867193715] [2025-03-08 00:24:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:24:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:16,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:24:16,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:24:16,357 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-08 00:24:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:16,367 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2025-03-08 00:24:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:24:16,368 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-08 00:24:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:16,373 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:24:16,373 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 00:24:16,375 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-08 00:24:16,377 INFO L435 NwaCegarLoop]: 27 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, 27 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-08 00:24:16,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 00:24:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-08 00:24:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-08 00:24:16,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2025-03-08 00:24:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:16,398 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-08 00:24:16,398 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-08 00:24:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-08 00:24:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:24:16,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:16,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:16,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:24:16,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:16,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -783918886, now seen corresponding path program 1 times [2025-03-08 00:24:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752068546] [2025-03-08 00:24:16,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:16,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:24:16,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:24:16,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:16,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,661 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-08 00:24:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752068546] [2025-03-08 00:24:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752068546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:24:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228403105] [2025-03-08 00:24:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:24:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:16,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:24:16,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:16,667 INFO L87 Difference]: Start difference. First operand 17 states and 21 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-08 00:24:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:16,702 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-08 00:24:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:24:16,702 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-08 00:24:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:16,703 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:24:16,703 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:24:16,703 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-08 00:24:16,703 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:16,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:24:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-03-08 00:24:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 00:24:16,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2025-03-08 00:24:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:16,710 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 00:24:16,710 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-08 00:24:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 00:24:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:24:16,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:16,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:16,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:24:16,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:16,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2003912629, now seen corresponding path program 1 times [2025-03-08 00:24:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:16,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550990665] [2025-03-08 00:24:16,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:16,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:24:16,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:24:16,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:16,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,757 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-08 00:24:16,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550990665] [2025-03-08 00:24:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550990665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:24:16,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752034780] [2025-03-08 00:24:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:24:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:16,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:24:16,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:16,758 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:16,780 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-08 00:24:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:24:16,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 00:24:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:16,782 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:24:16,782 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:24:16,782 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-08 00:24:16,783 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:16,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:24:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-08 00:24:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 00:24:16,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2025-03-08 00:24:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:16,789 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 00:24:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 00:24:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:24:16,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:16,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:16,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:24:16,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:16,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1205006704, now seen corresponding path program 1 times [2025-03-08 00:24:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:16,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647443629] [2025-03-08 00:24:16,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:16,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:16,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:24:16,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:24:16,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:16,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647443629] [2025-03-08 00:24:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647443629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438892712] [2025-03-08 00:24:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:16,862 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-08 00:24:16,863 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-08 00:24:16,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:24:16,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:24:16,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:16,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:24:16,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:16,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438892712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:16,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 00:24:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156358942] [2025-03-08 00:24:16,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:24:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:16,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:24:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:16,968 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:17,001 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-08 00:24:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:24:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:24:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:17,002 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:24:17,002 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:24:17,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:17,003 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 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-08 00:24:17,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:24:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:24:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-08 00:24:17,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 17 [2025-03-08 00:24:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:17,011 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-08 00:24:17,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-08 00:24:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:24:17,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:17,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:17,018 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-08 00:24:17,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:17,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:17,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash -587617835, now seen corresponding path program 2 times [2025-03-08 00:24:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165301610] [2025-03-08 00:24:17,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:17,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:24:17,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:24:17,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:17,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165301610] [2025-03-08 00:24:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165301610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666192757] [2025-03-08 00:24:17,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:17,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:17,338 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-08 00:24:17,340 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-08 00:24:17,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:24:17,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:24:17,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:17,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:17,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:24:17,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:17,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:24:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666192757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:24:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 00:24:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204397406] [2025-03-08 00:24:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:24:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:17,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:24:17,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:24:17,444 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:17,472 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2025-03-08 00:24:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:24:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:24:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:17,473 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:24:17,473 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:24:17,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:24:17,474 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 27 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-08 00:24:17,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:24:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:24:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-08 00:24:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-08 00:24:17,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2025-03-08 00:24:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:17,482 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-08 00:24:17,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-08 00:24:17,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:24:17,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:17,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:17,489 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-08 00:24:17,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:17,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:17,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1899894998, now seen corresponding path program 1 times [2025-03-08 00:24:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416463308] [2025-03-08 00:24:17,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:17,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:17,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:24:17,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:24:17,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:17,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416463308] [2025-03-08 00:24:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416463308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634742881] [2025-03-08 00:24:18,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:18,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:18,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:18,059 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-08 00:24:18,060 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-08 00:24:18,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:24:18,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:24:18,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:24:18,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:18,255 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-08 00:24:18,313 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-08 00:24:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-08 00:24:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:18,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:18,677 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 37 treesize of output 33 [2025-03-08 00:24:18,681 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 47 treesize of output 43 [2025-03-08 00:24:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:18,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634742881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:18,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:18,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 31 [2025-03-08 00:24:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131594846] [2025-03-08 00:24:18,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:24:18,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:18,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:24:18,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:24:18,822 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:23,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:24:27,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:24:39,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:24:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:39,855 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2025-03-08 00:24:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:24:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:24:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:39,857 INFO L225 Difference]: With dead ends: 109 [2025-03-08 00:24:39,857 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 00:24:39,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=793, Invalid=3237, Unknown=2, NotChecked=0, Total=4032 [2025-03-08 00:24:39,859 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 246 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:39,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 104 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 363 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-08 00:24:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 00:24:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 36. [2025-03-08 00:24:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 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-08 00:24:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-08 00:24:39,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 20 [2025-03-08 00:24:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:39,871 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-08 00:24:39,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-08 00:24:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:24:39,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:39,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:39,878 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-08 00:24:40,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:40,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:40,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -848511400, now seen corresponding path program 1 times [2025-03-08 00:24:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-03-08 00:24:40,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:40,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:24:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:24:40,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:40,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:40,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-03-08 00:24:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168213108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247318228] [2025-03-08 00:24:40,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:40,403 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-08 00:24:40,405 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-08 00:24:40,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:24:40,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:24:40,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:40,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 00:24:40,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:40,504 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-08 00:24:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:40,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:40,685 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-08 00:24:40,688 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-08 00:24:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247318228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:40,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-08 00:24:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823454677] [2025-03-08 00:24:40,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:40,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:24:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:40,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:24:40,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:24:40,773 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:41,069 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-08 00:24:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:24:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 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 25 [2025-03-08 00:24:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:41,070 INFO L225 Difference]: With dead ends: 72 [2025-03-08 00:24:41,070 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 00:24:41,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:24:41,071 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:41,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 137 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 00:24:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2025-03-08 00:24:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-03-08 00:24:41,077 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2025-03-08 00:24:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-03-08 00:24:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-03-08 00:24:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:24:41,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:41,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:41,084 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-08 00:24:41,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:41,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:41,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1221670123, now seen corresponding path program 2 times [2025-03-08 00:24:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659110852] [2025-03-08 00:24:41,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:41,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:24:41,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:24:41,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:41,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:24:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659110852] [2025-03-08 00:24:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659110852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842533449] [2025-03-08 00:24:41,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:41,454 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-08 00:24:41,456 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-08 00:24:41,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:24:41,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:24:41,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:41,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:41,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:24:41,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:24:41,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:24:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842533449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:41,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2025-03-08 00:24:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055859178] [2025-03-08 00:24:41,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:41,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:24:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:41,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:24:41,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:24:41,884 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 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-08 00:24:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:42,013 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2025-03-08 00:24:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:24:42,014 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 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 30 [2025-03-08 00:24:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:42,014 INFO L225 Difference]: With dead ends: 93 [2025-03-08 00:24:42,014 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 00:24:42,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:24:42,015 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 130 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:42,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 72 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 00:24:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2025-03-08 00:24:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-03-08 00:24:42,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 30 [2025-03-08 00:24:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-03-08 00:24:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 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-08 00:24:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-03-08 00:24:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:24:42,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:42,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:42,035 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-08 00:24:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:42,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:42,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1381066971, now seen corresponding path program 1 times [2025-03-08 00:24:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034659928] [2025-03-08 00:24:42,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:42,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:24:42,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:24:42,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:42,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034659928] [2025-03-08 00:24:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034659928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102390387] [2025-03-08 00:24:42,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:42,678 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-08 00:24:42,680 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-08 00:24:42,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:24:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:24:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:42,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 00:24:42,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:42,754 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-08 00:24:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:24:42,811 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 31 treesize of output 11 [2025-03-08 00:24:42,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:24:42,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2025-03-08 00:24:42,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:24:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2025-03-08 00:24:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:43,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:52,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_32| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_31| Int) (v_ArrVal_94 Int) (v_ArrVal_96 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_32| (+ |v_ULTIMATE.start_main_~j~0#1_31| 1)) (not (= (select (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_42| 8))) (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_32| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_94) (+ (* |v_ULTIMATE.start_main_~j~0#1_31| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_96)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0)))) (< 2 |v_ULTIMATE.start_main_~j~0#1_32|))) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2025-03-08 00:24:59,074 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 48 treesize of output 46 [2025-03-08 00:24:59,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 1146 treesize of output 1138 [2025-03-08 00:24:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-03-08 00:24:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102390387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:59,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 39 [2025-03-08 00:24:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344709321] [2025-03-08 00:24:59,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:59,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 00:24:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 00:24:59,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1225, Unknown=4, NotChecked=72, Total=1482 [2025-03-08 00:24:59,200 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:00,047 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2025-03-08 00:25:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:25:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:25:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:00,048 INFO L225 Difference]: With dead ends: 120 [2025-03-08 00:25:00,048 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 00:25:00,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=543, Invalid=3239, Unknown=4, NotChecked=120, Total=3906 [2025-03-08 00:25:00,049 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:00,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 207 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 773 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2025-03-08 00:25:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 00:25:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 39. [2025-03-08 00:25:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-08 00:25:00,055 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 33 [2025-03-08 00:25:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:00,055 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-08 00:25:00,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-08 00:25:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:25:00,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:00,056 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:00,064 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-08 00:25:00,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:00,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2047673361, now seen corresponding path program 3 times [2025-03-08 00:25:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:00,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625902517] [2025-03-08 00:25:00,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:25:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:00,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-08 00:25:00,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:25:00,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:25:00,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625902517] [2025-03-08 00:25:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625902517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707940978] [2025-03-08 00:25:00,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:25:00,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:00,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:00,884 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-08 00:25:00,885 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-08 00:25:00,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-08 00:25:00,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:25:00,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:25:00,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:00,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:25:00,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:01,038 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-08 00:25:01,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:25:01,096 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 31 treesize of output 11 [2025-03-08 00:25:01,254 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-08 00:25:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:01,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:03,109 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 31 treesize of output 29 [2025-03-08 00:25:03,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2025-03-08 00:25:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707940978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:03,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2025-03-08 00:25:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100554741] [2025-03-08 00:25:03,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:03,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 00:25:03,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:03,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 00:25:03,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1033, Unknown=1, NotChecked=0, Total=1190 [2025-03-08 00:25:03,222 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:04,617 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2025-03-08 00:25:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 00:25:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 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-08 00:25:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:04,618 INFO L225 Difference]: With dead ends: 132 [2025-03-08 00:25:04,618 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 00:25:04,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=903, Invalid=4646, Unknown=1, NotChecked=0, Total=5550 [2025-03-08 00:25:04,619 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 247 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:04,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 225 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:25:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 00:25:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 61. [2025-03-08 00:25:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-03-08 00:25:04,631 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 38 [2025-03-08 00:25:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:04,631 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-03-08 00:25:04,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-03-08 00:25:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:25:04,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:04,632 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:04,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:25:04,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:04,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:04,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2095489021, now seen corresponding path program 4 times [2025-03-08 00:25:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396493627] [2025-03-08 00:25:04,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:04,838 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-08 00:25:04,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 43 statements. [2025-03-08 00:25:04,845 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:25:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396493627] [2025-03-08 00:25:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396493627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392192894] [2025-03-08 00:25:05,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:05,070 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-08 00:25:05,080 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-08 00:25:05,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-08 00:25:05,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 43 statements. [2025-03-08 00:25:05,122 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:25:05,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:05,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:25:05,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:05,162 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-08 00:25:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:05,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:05,342 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-08 00:25:05,344 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-08 00:25:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392192894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:05,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2025-03-08 00:25:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383796861] [2025-03-08 00:25:05,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:05,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:25:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:05,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:25:05,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:25:05,367 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:05,721 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2025-03-08 00:25:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:25:05,722 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 00:25:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:05,723 INFO L225 Difference]: With dead ends: 100 [2025-03-08 00:25:05,723 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 00:25:05,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:25:05,723 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:05,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 256 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:25:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 00:25:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 59. [2025-03-08 00:25:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-08 00:25:05,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 43 [2025-03-08 00:25:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:05,732 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-08 00:25:05,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-08 00:25:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:25:05,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:05,733 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:05,739 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-08 00:25:05,933 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,SelfDestructingSolverStorable10 [2025-03-08 00:25:05,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1787855117, now seen corresponding path program 5 times [2025-03-08 00:25:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-03-08 00:25:05,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:05,940 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 9 equivalence classes. [2025-03-08 00:25:05,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:25:05,958 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:25:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-03-08 00:25:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61549504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136617702] [2025-03-08 00:25:06,511 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:06,513 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-08 00:25:06,514 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-08 00:25:06,552 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 9 equivalence classes. [2025-03-08 00:25:06,589 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:25:06,589 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:25:06,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:06,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:25:06,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:06,664 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-08 00:25:06,729 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2025-03-08 00:25:06,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 13 [2025-03-08 00:25:06,817 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2025-03-08 00:25:06,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2025-03-08 00:25:06,858 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2025-03-08 00:25:06,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2025-03-08 00:25:06,960 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-08 00:25:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:06,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:31,259 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_55| Int)) (or (< 2 |v_ULTIMATE.start_main_~j~0#1_55|) (forall ((v_ArrVal_175 Int)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 8) (* |v_ULTIMATE.start_main_~j~0#1_55| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_175) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_73| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2025-03-08 00:25:35,280 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_173 Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_55| Int)) (or (forall ((v_ArrVal_175 Int)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_173) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 8) (* |v_ULTIMATE.start_main_~j~0#1_55| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_175) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)))) (< 2 |v_ULTIMATE.start_main_~j~0#1_55|))) (< |v_ULTIMATE.start_main_~i~0#1_73| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2025-03-08 00:25:39,304 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int)) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_57| 1)) (forall ((v_ArrVal_173 Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_55| Int)) (or (< 2 |v_ULTIMATE.start_main_~j~0#1_55|) (forall ((v_ArrVal_175 Int)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_173) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 8) (* |v_ULTIMATE.start_main_~j~0#1_55| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_175) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_73| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2025-03-08 00:25:39,318 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 57 treesize of output 55 [2025-03-08 00:25:39,321 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 187 treesize of output 183 [2025-03-08 00:25:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 29 not checked. [2025-03-08 00:25:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136617702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:39,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 18] total 40 [2025-03-08 00:25:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340769266] [2025-03-08 00:25:39,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:39,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:25:39,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:39,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:25:39,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1105, Unknown=6, NotChecked=216, Total=1560 [2025-03-08 00:25:39,427 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:39,828 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2025-03-08 00:25:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:25:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 00:25:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:39,828 INFO L225 Difference]: With dead ends: 95 [2025-03-08 00:25:39,829 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 00:25:39,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=359, Invalid=1717, Unknown=6, NotChecked=270, Total=2352 [2025-03-08 00:25:39,829 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:39,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 622 Invalid, 0 Unknown, 166 Unchecked, 0.3s Time] [2025-03-08 00:25:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 00:25:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-03-08 00:25:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 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-08 00:25:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2025-03-08 00:25:39,839 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 46 [2025-03-08 00:25:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:39,839 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2025-03-08 00:25:39,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2025-03-08 00:25:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:25:39,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:39,840 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:39,846 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-08 00:25:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:40,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -683071344, now seen corresponding path program 6 times [2025-03-08 00:25:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385510860] [2025-03-08 00:25:40,044 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:25:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:40,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 6 equivalence classes. [2025-03-08 00:25:40,060 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:25:40,061 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:25:40,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:25:40,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:40,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385510860] [2025-03-08 00:25:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385510860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133502037] [2025-03-08 00:25:40,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:25:40,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:40,250 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-08 00:25:40,251 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-08 00:25:40,292 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 6 equivalence classes. [2025-03-08 00:25:40,320 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:25:40,320 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:25:40,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:40,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:25:40,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:25:40,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:25:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133502037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:40,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2025-03-08 00:25:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882406809] [2025-03-08 00:25:40,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:25:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:40,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:25:40,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:25:40,813 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 30 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:41,000 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2025-03-08 00:25:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:25:41,001 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 00:25:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:41,001 INFO L225 Difference]: With dead ends: 122 [2025-03-08 00:25:41,001 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 00:25:41,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=975, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:25:41,002 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 180 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:41,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 127 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:25:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 00:25:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2025-03-08 00:25:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 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-08 00:25:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-03-08 00:25:41,017 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 48 [2025-03-08 00:25:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:41,017 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-03-08 00:25:41,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-03-08 00:25:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:25:41,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:41,020 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:41,026 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-08 00:25:41,220 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,SelfDestructingSolverStorable12 [2025-03-08 00:25:41,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:41,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1388978047, now seen corresponding path program 7 times [2025-03-08 00:25:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460303842] [2025-03-08 00:25:41,221 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:25:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:41,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 00:25:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:25:41,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:25:41,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:25:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460303842] [2025-03-08 00:25:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460303842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878535814] [2025-03-08 00:25:41,690 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:25:41,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:41,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:41,696 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-08 00:25:41,699 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-08 00:25:41,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 00:25:41,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:25:41,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:25:41,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:41,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 00:25:41,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:41,843 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-08 00:25:41,901 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2025-03-08 00:25:41,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2025-03-08 00:25:41,940 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2025-03-08 00:25:41,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2025-03-08 00:25:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:25:42,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:43,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_72| Int)) (or (forall ((v_ArrVal_231 Int)) (= (select (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_72| (- 4))) v_ArrVal_231) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0)) (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_72| 1)))) is different from false [2025-03-08 00:25:55,992 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-08 00:25:55,993 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-08 00:25:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2025-03-08 00:25:56,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878535814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:56,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:56,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 43 [2025-03-08 00:25:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954111123] [2025-03-08 00:25:56,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:56,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 00:25:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:56,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 00:25:56,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1526, Unknown=4, NotChecked=80, Total=1806 [2025-03-08 00:25:56,047 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 43 states, 43 states have (on average 2.953488372093023) internal successors, (127), 43 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:56,662 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2025-03-08 00:25:56,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 00:25:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.953488372093023) internal successors, (127), 43 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 00:25:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:56,663 INFO L225 Difference]: With dead ends: 161 [2025-03-08 00:25:56,663 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 00:25:56,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=440, Invalid=2982, Unknown=4, NotChecked=114, Total=3540 [2025-03-08 00:25:56,665 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 59 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:56,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 264 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 883 Invalid, 0 Unknown, 70 Unchecked, 0.3s Time] [2025-03-08 00:25:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 00:25:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 57. [2025-03-08 00:25:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-03-08 00:25:56,673 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 51 [2025-03-08 00:25:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-08 00:25:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.953488372093023) internal successors, (127), 43 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-03-08 00:25:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:25:56,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:56,673 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:56,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:25:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:25:56,874 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1748919668, now seen corresponding path program 8 times [2025-03-08 00:25:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:56,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539157301] [2025-03-08 00:25:56,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:25:56,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:56,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:25:56,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:25:56,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:25:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:25:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539157301] [2025-03-08 00:25:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539157301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109446041] [2025-03-08 00:25:57,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:25:57,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:57,269 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-08 00:25:57,271 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-08 00:25:57,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:25:57,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:25:57,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:25:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:57,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 00:25:57,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:57,444 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-08 00:25:57,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:25:57,491 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 31 treesize of output 11 [2025-03-08 00:25:57,707 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-08 00:25:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:25:57,711 INFO L312 TraceCheckSpWp]: Computing backward predicates...