./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/rew.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/rew.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 a4dbd52ad78119a422ea606f98f820bbe5495fb5a7cf8886c665da2d1f9b569e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:26:19,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:26:19,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:26:19,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:26:19,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:26:19,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:26:19,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:26:19,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:26:19,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:26:19,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:26:19,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:26:19,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:26:19,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:26:19,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:26:19,732 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:26:19,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:26:19,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:26:19,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:26:19,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:26:19,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:26:19,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:26:19,735 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 -> a4dbd52ad78119a422ea606f98f820bbe5495fb5a7cf8886c665da2d1f9b569e [2025-03-08 00:26:19,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:26:19,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:26:19,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:26:19,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:26:19,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:26:19,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/rew.c [2025-03-08 00:26:21,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbfe50a25/56298984212a48289d7eb8cbebda9682/FLAGc95035ce7 [2025-03-08 00:26:21,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:26:21,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rew.c [2025-03-08 00:26:21,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbfe50a25/56298984212a48289d7eb8cbebda9682/FLAGc95035ce7 [2025-03-08 00:26:21,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbfe50a25/56298984212a48289d7eb8cbebda9682 [2025-03-08 00:26:21,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:26:21,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:26:21,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:26:21,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:26:21,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:26:21,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74be2e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21, skipping insertion in model container [2025-03-08 00:26:21,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:26:21,686 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/rew.c[394,407] [2025-03-08 00:26:21,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:26:21,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:26:21,718 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/rew.c[394,407] [2025-03-08 00:26:21,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:26:21,737 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:26:21,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21 WrapperNode [2025-03-08 00:26:21,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:26:21,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:26:21,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:26:21,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:26:21,744 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:26:21" (1/1) ... [2025-03-08 00:26:21,748 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:26:21" (1/1) ... [2025-03-08 00:26:21,763 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-03-08 00:26:21,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:26:21,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:26:21,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:26:21,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:26:21,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,783 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 6, 3]. 55 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:26:21,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:26:21,798 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:26:21,798 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:26:21,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:26:21,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (1/1) ... [2025-03-08 00:26:21,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:26:21,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:21,829 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:26:21,836 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:26:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:26:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:26:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:26:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:26:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:26:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:26:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:26:21,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:26:21,943 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:26:22,086 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 00:26:22,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:26:22,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:26:22,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:26:22,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:26:22 BoogieIcfgContainer [2025-03-08 00:26:22,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:26:22,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:26:22,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:26:22,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:26:22,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:26:21" (1/3) ... [2025-03-08 00:26:22,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e87a8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:26:22, skipping insertion in model container [2025-03-08 00:26:22,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:21" (2/3) ... [2025-03-08 00:26:22,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e87a8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:26:22, skipping insertion in model container [2025-03-08 00:26:22,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:26:22" (3/3) ... [2025-03-08 00:26:22,106 INFO L128 eAbstractionObserver]: Analyzing ICFG rew.c [2025-03-08 00:26:22,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:26:22,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rew.c that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:26:22,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:26:22,175 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;@2e796afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:26:22,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:26:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 00:26:22,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:22,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:22,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1038862573, now seen corresponding path program 1 times [2025-03-08 00:26:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028273262] [2025-03-08 00:26:22,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:22,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 00:26:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 00:26:22,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:22,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:22,408 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:26:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028273262] [2025-03-08 00:26:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028273262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:26:22,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:26:22,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:26:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924255104] [2025-03-08 00:26:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:26:22,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:26:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:22,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:26:22,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:26:22,433 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:26:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:22,493 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-08 00:26:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:26:22,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-08 00:26:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:22,508 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:26:22,508 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:26:22,514 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:26:22,516 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:22,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:26:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-08 00:26:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-08 00:26:22,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2025-03-08 00:26:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:22,551 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-08 00:26:22,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:26:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-08 00:26:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:26:22,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:22,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:22,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:26:22,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:22,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1434665732, now seen corresponding path program 1 times [2025-03-08 00:26:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533272986] [2025-03-08 00:26:22,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:22,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:26:22,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:26:22,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:22,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533272986] [2025-03-08 00:26:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533272986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:22,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496174308] [2025-03-08 00:26:22,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:22,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:22,730 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:26:22,732 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:26:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:26:22,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:26:22,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:22,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:22,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:26:22,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:22,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496174308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:22,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:26:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64634628] [2025-03-08 00:26:22,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:22,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:26:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:22,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:26:22,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:26:22,917 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:22,982 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-08 00:26:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:26:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 00:26:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:22,983 INFO L225 Difference]: With dead ends: 25 [2025-03-08 00:26:22,983 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:26:22,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:26:22,984 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:22,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:26:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2025-03-08 00:26:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-08 00:26:22,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2025-03-08 00:26:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:22,988 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-08 00:26:22,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-03-08 00:26:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:26:22,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:22,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:22,997 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:26:23,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:23,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:23,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1533873364, now seen corresponding path program 1 times [2025-03-08 00:26:23,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:23,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481250968] [2025-03-08 00:26:23,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:23,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:26:23,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:26:23,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:23,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481250968] [2025-03-08 00:26:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481250968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862830757] [2025-03-08 00:26:23,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:23,646 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:26:23,647 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:26:23,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:26:23,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:26:23,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:23,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:23,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:26:23,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:23,768 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:26:23,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:23,823 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 25 treesize of output 20 [2025-03-08 00:26:23,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:23,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:23,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-03-08 00:26:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:23,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:24,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 00:26:24,082 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 52 treesize of output 50 [2025-03-08 00:26:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862830757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:24,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-08 00:26:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796887452] [2025-03-08 00:26:24,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:24,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:26:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:26:24,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:26:24,137 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:24,319 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-08 00:26:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:26:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:26:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:24,320 INFO L225 Difference]: With dead ends: 24 [2025-03-08 00:26:24,320 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:26:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:26:24,321 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:24,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 31 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:26:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:26:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2025-03-08 00:26:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-08 00:26:24,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2025-03-08 00:26:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:24,328 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-08 00:26:24,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-08 00:26:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:26:24,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:24,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:24,335 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:26:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:26:24,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1463451969, now seen corresponding path program 1 times [2025-03-08 00:26:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-03-08 00:26:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:24,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:26:24,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:26:24,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:24,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-03-08 00:26:24,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637036280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660996273] [2025-03-08 00:26:24,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:24,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:24,835 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:26:24,837 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:26:24,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:26:24,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:26:24,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:24,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:24,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:26:24,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:24,961 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:26:25,050 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:26:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:25,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:25,137 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 18 treesize of output 16 [2025-03-08 00:26:25,138 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:26:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:25,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660996273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:25,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-08 00:26:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182942986] [2025-03-08 00:26:25,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:25,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:26:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:25,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:26:25,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:26:25,190 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:25,301 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-08 00:26:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:26:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:26:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:25,303 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:26:25,303 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:26:25,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:26:25,304 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:25,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 81 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:26:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:26:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2025-03-08 00:26:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-08 00:26:25,309 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2025-03-08 00:26:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:25,309 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-08 00:26:25,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-08 00:26:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:26:25,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:25,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:25,318 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:26:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:25,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:25,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1370182768, now seen corresponding path program 2 times [2025-03-08 00:26:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590048098] [2025-03-08 00:26:25,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:26:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:25,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 00:26:25,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:26:25,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:26:25,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590048098] [2025-03-08 00:26:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590048098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77281705] [2025-03-08 00:26:25,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:26:25,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:25,830 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:26:25,832 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:26:25,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 00:26:25,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:26:25,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:26:25,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:25,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:26:25,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:25,962 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:26:26,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:26,007 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 25 treesize of output 20 [2025-03-08 00:26:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:26,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:26,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-03-08 00:26:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:26,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:26,309 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 25 treesize of output 23 [2025-03-08 00:26:26,317 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 54 treesize of output 50 [2025-03-08 00:26:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77281705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:26,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 00:26:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670701395] [2025-03-08 00:26:26,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:26:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:26,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:26:26,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:26:26,407 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:26:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:26,793 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-03-08 00:26:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:26:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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 19 [2025-03-08 00:26:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:26,794 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:26:26,795 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:26:26,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:26:26,796 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:26,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 70 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:26:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:26:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 20. [2025-03-08 00:26:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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:26:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-08 00:26:26,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 19 [2025-03-08 00:26:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:26,800 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-08 00:26:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:26:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-08 00:26:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:26:26,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:26,801 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:26,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:26:27,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:27,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 516286028, now seen corresponding path program 3 times [2025-03-08 00:26:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103050139] [2025-03-08 00:26:27,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:26:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:27,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-08 00:26:27,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:26:27,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:26:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103050139] [2025-03-08 00:26:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103050139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769531017] [2025-03-08 00:26:27,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:26:27,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:27,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:27,120 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:26:27,121 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:26:27,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-08 00:26:27,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:26:27,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:26:27,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:27,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:26:27,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:27,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769531017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:27,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 00:26:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568952979] [2025-03-08 00:26:27,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:26:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:27,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:26:27,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:26:27,264 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:26:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:27,329 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-08 00:26:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:26:27,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 19 [2025-03-08 00:26:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:27,330 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:26:27,330 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:26:27,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:26:27,331 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:27,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:26:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-08 00:26:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-08 00:26:27,339 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2025-03-08 00:26:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-08 00:26:27,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:26:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-08 00:26:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:26:27,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:27,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:27,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:26:27,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:27,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 255212507, now seen corresponding path program 4 times [2025-03-08 00:26:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659222481] [2025-03-08 00:26:27,541 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:26:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:27,558 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-08 00:26:27,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:26:27,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:26:27,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659222481] [2025-03-08 00:26:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659222481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703742350] [2025-03-08 00:26:27,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:26:27,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:27,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:27,818 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:26:27,823 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:26:27,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-08 00:26:27,896 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:26:27,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:26:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:27,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:26:27,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:28,020 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 23 treesize of output 1 [2025-03-08 00:26:28,284 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:26:28,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-08 00:26:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:28,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:28,563 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 20 treesize of output 18 [2025-03-08 00:26:28,566 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 26 treesize of output 20 [2025-03-08 00:26:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703742350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:28,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2025-03-08 00:26:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557369592] [2025-03-08 00:26:28,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:28,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:26:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:26:28,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:26:28,759 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:26:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:29,279 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2025-03-08 00:26:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:26:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 00:26:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:29,280 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:26:29,280 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:26:29,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:26:29,281 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:29,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:26:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:26:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-08 00:26:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:26:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-08 00:26:29,287 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2025-03-08 00:26:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:29,287 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-08 00:26:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:26:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-08 00:26:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:26:29,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:29,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:29,297 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:26:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:29,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:29,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash 799721452, now seen corresponding path program 5 times [2025-03-08 00:26:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249788740] [2025-03-08 00:26:29,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:26:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:29,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 5 equivalence classes. [2025-03-08 00:26:29,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:26:29,522 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:26:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249788740] [2025-03-08 00:26:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249788740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095107180] [2025-03-08 00:26:29,775 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:26:29,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:29,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:29,777 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:26:29,778 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:26:29,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 5 equivalence classes. [2025-03-08 00:26:29,842 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:26:29,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:26:29,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:29,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:26:29,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:29,889 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:26:29,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 00:26:29,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 00:26:29,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:29,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2025-03-08 00:26:30,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:30,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2025-03-08 00:26:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:30,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:30,379 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 34 treesize of output 32 [2025-03-08 00:26:30,387 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 114 treesize of output 110 [2025-03-08 00:26:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095107180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:30,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:30,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-03-08 00:26:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357566246] [2025-03-08 00:26:30,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:30,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:26:30,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:30,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:26:30,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:26:30,501 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 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:26:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:31,187 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2025-03-08 00:26:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 00:26:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:26:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:31,188 INFO L225 Difference]: With dead ends: 93 [2025-03-08 00:26:31,188 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:26:31,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=375, Invalid=2175, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:26:31,189 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 120 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:31,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 98 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:26:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:26:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 45. [2025-03-08 00:26:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:26:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-08 00:26:31,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2025-03-08 00:26:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:31,200 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-08 00:26:31,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 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:26:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-08 00:26:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:26:31,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:31,202 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:31,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:26:31,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:31,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:31,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2016013648, now seen corresponding path program 6 times [2025-03-08 00:26:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-03-08 00:26:31,403 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:26:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:31,412 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 6 equivalence classes. [2025-03-08 00:26:31,433 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:26:31,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:26:31,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-03-08 00:26:31,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863024214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676633762] [2025-03-08 00:26:31,742 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:26:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:31,744 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:26:31,745 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:26:31,784 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 6 equivalence classes. [2025-03-08 00:26:31,808 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:26:31,808 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:26:31,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:31,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 00:26:31,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:31,966 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:26:32,003 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 00:26:32,003 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 25 treesize of output 20 [2025-03-08 00:26:32,196 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:26:32,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-03-08 00:26:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:32,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:32,355 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 25 treesize of output 23 [2025-03-08 00:26:32,357 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 54 treesize of output 50 [2025-03-08 00:26:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:32,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676633762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:32,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:32,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-03-08 00:26:32,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184082700] [2025-03-08 00:26:32,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:32,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 00:26:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:32,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 00:26:32,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:26:32,459 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:26:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:32,738 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2025-03-08 00:26:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:26:32,741 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 00:26:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:32,742 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:26:32,742 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 00:26:32,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:26:32,743 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:32,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 90 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:26:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 00:26:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 45. [2025-03-08 00:26:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:26:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-08 00:26:32,755 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 31 [2025-03-08 00:26:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:32,755 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-08 00:26:32,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:26:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-08 00:26:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:26:32,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:32,756 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:32,761 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:26:32,957 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,SelfDestructingSolverStorable8 [2025-03-08 00:26:32,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 307964684, now seen corresponding path program 7 times [2025-03-08 00:26:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823411109] [2025-03-08 00:26:32,959 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:26:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:26:32,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:26:32,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:32,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823411109] [2025-03-08 00:26:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823411109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039359398] [2025-03-08 00:26:33,089 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:26:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:33,091 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:26:33,093 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:26:33,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:26:33,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:26:33,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:33,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:33,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:26:33,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:33,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039359398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:33,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:33,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-08 00:26:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835099571] [2025-03-08 00:26:33,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:26:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:33,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:26:33,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:26:33,294 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 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:26:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:33,400 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-08 00:26:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:26:33,400 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 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 31 [2025-03-08 00:26:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:33,401 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:26:33,401 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:26:33,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:26:33,401 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:33,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 53 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:26:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:26:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2025-03-08 00:26:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-03-08 00:26:33,413 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 31 [2025-03-08 00:26:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-08 00:26:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 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:26:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-03-08 00:26:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:26:33,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:33,414 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:33,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:26:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:26:33,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash -195991397, now seen corresponding path program 8 times [2025-03-08 00:26:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015456924] [2025-03-08 00:26:33,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:26:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:33,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:26:33,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:26:33,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:26:33,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015456924] [2025-03-08 00:26:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015456924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958849674] [2025-03-08 00:26:34,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:26:34,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:34,172 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:26:34,174 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:26:34,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:26:34,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:26:34,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:26:34,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:34,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:26:34,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:34,317 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:26:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,352 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:26:34,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,365 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 21 treesize of output 20 [2025-03-08 00:26:34,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:34,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2025-03-08 00:26:34,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:34,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 00:26:34,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:34,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 35 [2025-03-08 00:26:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:34,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 00:26:34,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:34,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:34,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 56 [2025-03-08 00:26:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:26:43,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:26:43,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 19 [2025-03-08 00:26:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:26:43,453 INFO L312 TraceCheckSpWp]: Computing backward predicates...