/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:51:57,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:51:57,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:51:57,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:51:57,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:51:57,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:51:57,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:51:57,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:51:57,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:51:57,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:51:57,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:51:57,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:51:57,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:51:57,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:51:57,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:51:57,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:51:57,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:51:57,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:51:57,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:51:57,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:51:57,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:51:57,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:51:57,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:51:57,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:51:57,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:51:57,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:51:57,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:51:57,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:51:57,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:51:57,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:51:57,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:51:57,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:51:57,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:51:57,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:51:57,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:51:57,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:51:57,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:51:57,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:51:57,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:51:57,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:51:57,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:51:57,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:51:57,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:51:57,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:51:57,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:51:57,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:51:57,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:51:57,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:51:57,785 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:51:57,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:51:57,785 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:51:57,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:51:57,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:51:57,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:51:57,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:51:57,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:51:57,787 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:51:57,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:51:57,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:51:57,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:51:57,992 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:51:57,994 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:51:57,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl [2022-03-15 21:51:57,995 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl' [2022-03-15 21:51:58,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:51:58,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:51:58,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:51:58,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:51:58,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:51:58,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,032 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:51:58,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:51:58,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:51:58,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:51:58,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:51:58,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:51:58,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:51:58,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:51:58,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:51:58,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/1) ... [2022-03-15 21:51:58,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:51:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:58,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:51:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:51:58,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:51:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:51:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:51:58,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:51:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:51:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:51:58,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:51:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:51:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:51:58,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:51:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:51:58,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:51:58,111 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:51:58,149 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:51:58,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:51:58,211 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:51:58,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:51:58,216 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:51:58,217 INFO L202 PluginConnector]: Adding new model array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:51:58 BoogieIcfgContainer [2022-03-15 21:51:58,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:51:58,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:51:58,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:51:58,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:51:58,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:58" (1/2) ... [2022-03-15 21:51:58,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87fa9a0 and model type array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:51:58, skipping insertion in model container [2022-03-15 21:51:58,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:51:58" (2/2) ... [2022-03-15 21:51:58,248 INFO L111 eAbstractionObserver]: Analyzing ICFG array-sum.wvr.bpl [2022-03-15 21:51:58,252 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:51:58,252 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:51:58,252 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:51:58,252 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:51:58,278 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:51:58,306 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:51:58,311 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:51:58,311 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:51:58,318 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:51:58,325 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 21:51:58,326 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 21:51:58,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 88 flow [2022-03-15 21:51:58,353 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2022-03-15 21:51:58,353 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:51:58,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2022-03-15 21:51:58,356 INFO L116 LiptonReduction]: Number of co-enabled transitions 210 [2022-03-15 21:51:58,703 INFO L131 LiptonReduction]: Checked pairs total: 170 [2022-03-15 21:51:58,703 INFO L133 LiptonReduction]: Total number of compositions: 15 [2022-03-15 21:51:58,710 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 21:51:58,723 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:51:58,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:58,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:58,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash -79579101, now seen corresponding path program 1 times [2022-03-15 21:51:58,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:58,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570645573] [2022-03-15 21:51:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:58,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:58,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:58,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570645573] [2022-03-15 21:51:58,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570645573] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:58,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:58,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:51:58,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947827617] [2022-03-15 21:51:58,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:58,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:58,877 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:51:58,877 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:59,078 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:59,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:51:59,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:59,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:51:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:51:59,098 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:59,136 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 21:51:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:51:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 21:51:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:59,146 INFO L225 Difference]: With dead ends: 45 [2022-03-15 21:51:59,147 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 21:51:59,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:51:59,156 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:59,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:51:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 21:51:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 21:51:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 21:51:59,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 21:51:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:59,186 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 21:51:59,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 21:51:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:59,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:59,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:59,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:51:59,189 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 480186964, now seen corresponding path program 1 times [2022-03-15 21:51:59,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:59,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289261542] [2022-03-15 21:51:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:59,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:59,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289261542] [2022-03-15 21:51:59,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289261542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:59,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:59,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:59,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299819548] [2022-03-15 21:51:59,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:59,253 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:59,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:51:59,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:59,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:59,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:51:59,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:51:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:51:59,433 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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) [2022-03-15 21:51:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:59,477 INFO L93 Difference]: Finished difference Result 37 states and 98 transitions. [2022-03-15 21:51:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:51:59,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 12 [2022-03-15 21:51:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:59,479 INFO L225 Difference]: With dead ends: 37 [2022-03-15 21:51:59,479 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 21:51:59,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:51:59,481 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:59,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:51:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 21:51:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-15 21:51:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 21:51:59,492 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 21:51:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:59,493 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 21:51:59,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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) [2022-03-15 21:51:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 21:51:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:59,495 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:59,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:59,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:51:59,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -264765608, now seen corresponding path program 1 times [2022-03-15 21:51:59,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:59,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414522398] [2022-03-15 21:51:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:59,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:59,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414522398] [2022-03-15 21:51:59,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414522398] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:59,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:59,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:59,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1342787852] [2022-03-15 21:51:59,537 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:59,537 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:59,540 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:51:59,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:59,643 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:59,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:51:59,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:59,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:51:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:51:59,646 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:59,675 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 21:51:59,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:51:59,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:51:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:59,678 INFO L225 Difference]: With dead ends: 40 [2022-03-15 21:51:59,678 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 21:51:59,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:51:59,682 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:59,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:51:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 21:51:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 21:51:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 21:51:59,686 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 21:51:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:59,686 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 21:51:59,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 21:51:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:59,687 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:59,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:59,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:51:59,688 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash -91886777, now seen corresponding path program 1 times [2022-03-15 21:51:59,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:59,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427296451] [2022-03-15 21:51:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:59,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:59,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:59,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427296451] [2022-03-15 21:51:59,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427296451] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:59,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044457076] [2022-03-15 21:51:59,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:59,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:59,786 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) [2022-03-15 21:51:59,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:51:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:59,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:51:59,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:00,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:00,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-03-15 21:52:00,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:00,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 21:52:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:00,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:00,106 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:00,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-03-15 21:52:00,116 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:00,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 18 [2022-03-15 21:52:00,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-03-15 21:52:00,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 21:52:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:00,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044457076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:00,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:00,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 21:52:00,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607339723] [2022-03-15 21:52:00,201 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:00,202 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:00,205 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 21:52:00,205 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:00,714 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [529#(and (< res1 (+ res2 (select A k) (select B k) 1)) (<= (+ res2 (select A k) (select B k)) res1)), 522#(or (< j M) (and (= k i) (= (+ (* (- 1) res1) res2) 0))), 530#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 532#(and (or (< j M) (<= res2 (+ (select A i) res1 (select B i)))) (or (< j M) (<= (+ (select A i) res1 (select B i)) res2))), 531#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1))) (or (< j M) (<= (+ res2 (select A k) (select B k)) res1)))] [2022-03-15 21:52:00,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:52:00,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:00,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:52:00,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:52:00,715 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:00,936 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 21:52:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:52:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 [2022-03-15 21:52:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:00,938 INFO L225 Difference]: With dead ends: 76 [2022-03-15 21:52:00,938 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 21:52:00,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:52:00,939 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:00,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 21:52:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 21:52:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 21:52:00,944 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 21:52:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:00,944 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 21:52:00,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 21:52:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:52:00,945 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:00,945 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:00,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:01,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:01,146 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 972389688, now seen corresponding path program 2 times [2022-03-15 21:52:01,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:01,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582297227] [2022-03-15 21:52:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:01,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:01,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:01,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582297227] [2022-03-15 21:52:01,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582297227] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:01,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366369761] [2022-03-15 21:52:01,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:52:01,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:01,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:01,201 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) [2022-03-15 21:52:01,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:52:01,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:52:01,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:01,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:52:01,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:01,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:01,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366369761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:01,314 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:01,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-03-15 21:52:01,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837282677] [2022-03-15 21:52:01,315 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:01,316 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:01,320 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:52:01,320 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:01,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [843#(or (<= N i) (<= (+ 2 i) N)), 839#(<= N k), 841#(<= N (+ k 1)), 842#(or (<= N (+ k 1)) (< i N)), 840#(or (<= N k) (< i N))] [2022-03-15 21:52:01,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:52:01,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:52:01,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:52:01,606 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:01,775 INFO L93 Difference]: Finished difference Result 100 states and 279 transitions. [2022-03-15 21:52:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 21:52:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:52:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:01,776 INFO L225 Difference]: With dead ends: 100 [2022-03-15 21:52:01,776 INFO L226 Difference]: Without dead ends: 93 [2022-03-15 21:52:01,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:52:01,777 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:01,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:52:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-15 21:52:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2022-03-15 21:52:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 2.9146341463414633) internal successors, (239), 82 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 239 transitions. [2022-03-15 21:52:01,783 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 239 transitions. Word has length 14 [2022-03-15 21:52:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:01,783 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 239 transitions. [2022-03-15 21:52:01,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 239 transitions. [2022-03-15 21:52:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:52:01,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:01,784 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:01,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:01,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:02,000 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash -646303564, now seen corresponding path program 3 times [2022-03-15 21:52:02,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:02,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183090256] [2022-03-15 21:52:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:02,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:02,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183090256] [2022-03-15 21:52:02,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183090256] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:02,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318502464] [2022-03-15 21:52:02,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:52:02,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:02,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:02,064 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) [2022-03-15 21:52:02,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:52:02,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:52:02,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:02,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:52:02,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:02,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:02,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318502464] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:02,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:02,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-03-15 21:52:02,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286703978] [2022-03-15 21:52:02,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:02,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:02,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:52:02,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:02,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1223#(or (< j M) (<= (+ k 1) i) (<= N k)), 1224#(and (or (< j M) (= (+ res2 (* (- 1) i)) 0)) (or (< j M) (<= k 0)) (or (< j M) (= res2 0))), 1211#(or (<= (+ 2 k) N) (<= N k)), 1218#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1204#(or (<= k i) (< j M)), 1212#(< j M), 1213#(or (<= (+ k 1) N) (< j M)), 1216#(or (< j M) (< i N)), 1214#(or (<= (+ 2 k) N) (< j M) (<= N k)), 1222#(or (<= (+ k 1) i) (<= N k)), 1217#(or (<= N i) (< (+ i 1) N)), 1221#(or (< j M) (<= k (+ i 1))), 1220#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 1215#(< i N), 1219#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 21:52:02,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:52:02,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:52:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:52:02,689 INFO L87 Difference]: Start difference. First operand 83 states and 239 transitions. Second operand has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:04,549 INFO L93 Difference]: Finished difference Result 237 states and 666 transitions. [2022-03-15 21:52:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:52:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:52:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:04,551 INFO L225 Difference]: With dead ends: 237 [2022-03-15 21:52:04,551 INFO L226 Difference]: Without dead ends: 237 [2022-03-15 21:52:04,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1055, Invalid=5425, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:52:04,553 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:04,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:52:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-15 21:52:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 140. [2022-03-15 21:52:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.1223021582733814) internal successors, (434), 139 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 434 transitions. [2022-03-15 21:52:04,574 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 434 transitions. Word has length 14 [2022-03-15 21:52:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:04,574 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 434 transitions. [2022-03-15 21:52:04,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 434 transitions. [2022-03-15 21:52:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:52:04,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:04,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:04,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:04,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:04,776 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash -956020160, now seen corresponding path program 1 times [2022-03-15 21:52:04,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:04,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367367120] [2022-03-15 21:52:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:04,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:04,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367367120] [2022-03-15 21:52:04,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367367120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:04,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570872362] [2022-03-15 21:52:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:04,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:04,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:04,832 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) [2022-03-15 21:52:04,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:52:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:04,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:52:04,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:04,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:04,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570872362] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:04,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:04,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 21:52:04,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046779613] [2022-03-15 21:52:04,971 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:04,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:04,978 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 21:52:04,978 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:05,312 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1946#(or (< j M) (< i N)), 1945#(or (< (+ j 1) M) (<= M j)), 1947#(or (< (+ j 1) M) (< i N) (<= M j)), 1950#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 1949#(or (<= N i) (< (+ i 1) N) (< j M)), 1944#(< j M), 1948#(or (<= N i) (<= (+ 2 i) N))] [2022-03-15 21:52:05,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:52:05,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:52:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:52:05,315 INFO L87 Difference]: Start difference. First operand 140 states and 434 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:05,509 INFO L93 Difference]: Finished difference Result 190 states and 570 transitions. [2022-03-15 21:52:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:52:05,509 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:52:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:05,511 INFO L225 Difference]: With dead ends: 190 [2022-03-15 21:52:05,511 INFO L226 Difference]: Without dead ends: 190 [2022-03-15 21:52:05,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:52:05,512 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:05,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:52:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-03-15 21:52:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2022-03-15 21:52:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 3.114864864864865) internal successors, (461), 148 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 461 transitions. [2022-03-15 21:52:05,520 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 461 transitions. Word has length 14 [2022-03-15 21:52:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:05,520 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 461 transitions. [2022-03-15 21:52:05,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 461 transitions. [2022-03-15 21:52:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:05,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:05,521 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:05,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:05,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:05,735 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2013471517, now seen corresponding path program 4 times [2022-03-15 21:52:05,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:05,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767138598] [2022-03-15 21:52:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:05,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:05,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767138598] [2022-03-15 21:52:05,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767138598] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:05,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574195350] [2022-03-15 21:52:05,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:52:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:05,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:05,905 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) [2022-03-15 21:52:05,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:52:05,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:52:05,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:05,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:52:05,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:06,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 31 treesize of output 23 [2022-03-15 21:52:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:06,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:06,185 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:52:06,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 63 [2022-03-15 21:52:06,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:06,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:06,209 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:06,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 55 [2022-03-15 21:52:06,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:06,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:06,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:06,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-03-15 21:52:06,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:06,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:06,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:06,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2022-03-15 21:52:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:06,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574195350] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:06,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:06,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-03-15 21:52:06,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131077525] [2022-03-15 21:52:06,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:06,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:06,419 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 21:52:06,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:08,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [2568#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 2564#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 2574#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 2559#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 2566#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 2561#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 2569#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N))), 2580#(and (or (< j M) (= k i)) (or (= res2 res1) (< j M)) (or (< j M) (= i res2)) (or (< j M) (= res2 0))), 2572#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 2575#(and (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N)) (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N))), 2578#(and (or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (< j M) (<= (+ 2 i) N))), 2560#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 2565#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 2570#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 2562#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 2577#(and (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 2567#(and (or (<= N (+ k 1)) (< j M) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1)) (or (<= N (+ k 1)) (< j M) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)))), 2573#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 2579#(and (or (< j M) (<= res2 (+ (select A i) res1 (select B i)))) (or (< j M) (<= (+ (select A i) res1 (select B i)) res2)) (or (<= (+ i 1) k) (< j M))), 2563#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 2571#(and (or (<= N (+ k 1)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 2576#(and (or (<= N (+ k 1)) (< j M) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N)))] [2022-03-15 21:52:08,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:52:08,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:52:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:52:08,300 INFO L87 Difference]: Start difference. First operand 149 states and 461 transitions. Second operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:13,885 INFO L93 Difference]: Finished difference Result 384 states and 1074 transitions. [2022-03-15 21:52:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 21:52:13,885 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 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 15 [2022-03-15 21:52:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:13,887 INFO L225 Difference]: With dead ends: 384 [2022-03-15 21:52:13,887 INFO L226 Difference]: Without dead ends: 368 [2022-03-15 21:52:13,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1902, Invalid=9870, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 21:52:13,890 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:13,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:52:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-03-15 21:52:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 193. [2022-03-15 21:52:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.2864583333333335) internal successors, (631), 192 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 631 transitions. [2022-03-15 21:52:13,896 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 631 transitions. Word has length 15 [2022-03-15 21:52:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:13,896 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 631 transitions. [2022-03-15 21:52:13,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 631 transitions. [2022-03-15 21:52:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:13,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:13,897 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:13,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:14,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:14,113 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:14,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1898059343, now seen corresponding path program 5 times [2022-03-15 21:52:14,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:14,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599287676] [2022-03-15 21:52:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:14,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:14,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599287676] [2022-03-15 21:52:14,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599287676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:14,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192522691] [2022-03-15 21:52:14,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:52:14,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:14,172 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) [2022-03-15 21:52:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:52:14,195 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:52:14,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:14,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:14,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:14,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:14,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192522691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:14,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:14,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 21:52:14,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1551427066] [2022-03-15 21:52:14,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:14,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:14,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 21:52:14,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:14,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [3600#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 3586#(< k N), 3598#(or (<= N i) (< j M)), 3593#(or (< j M) (<= (+ N 1) i)), 3599#(or (<= N i) (< j M) (< k N)), 3589#(or (<= (+ N 1) i) (< k N)), 3590#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 3602#(and (or (< j M) (= (+ res2 (* (- 1) i)) 0)) (or (< j M) (<= k 0)) (or (< j M) (= res2 0))), 3587#(or (<= N k) (< (+ k 1) N)), 3597#(or (<= N i) (<= N k) (< (+ k 1) N)), 3588#(< j M), 3592#(or (< j M) (<= N k) (< (+ k 1) N)), 3594#(or (< j M) (<= (+ N 1) i) (< k N)), 3579#(or (< j M) (<= k (+ i 1))), 3591#(or (< j M) (< k N)), 3601#(or (<= N (+ i 1)) (< j M)), 3595#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 3596#(or (<= N i) (< k N))] [2022-03-15 21:52:14,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:52:14,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:52:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:52:14,908 INFO L87 Difference]: Start difference. First operand 193 states and 631 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:15,667 INFO L93 Difference]: Finished difference Result 284 states and 869 transitions. [2022-03-15 21:52:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:52:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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 15 [2022-03-15 21:52:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:15,668 INFO L225 Difference]: With dead ends: 284 [2022-03-15 21:52:15,669 INFO L226 Difference]: Without dead ends: 280 [2022-03-15 21:52:15,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=698, Invalid=2608, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:52:15,670 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:15,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:52:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-03-15 21:52:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 192. [2022-03-15 21:52:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 3.256544502617801) internal successors, (622), 191 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 622 transitions. [2022-03-15 21:52:15,683 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 622 transitions. Word has length 15 [2022-03-15 21:52:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:15,683 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 622 transitions. [2022-03-15 21:52:15,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 622 transitions. [2022-03-15 21:52:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:15,684 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:15,684 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:15,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:15,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:15,885 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1664634661, now seen corresponding path program 2 times [2022-03-15 21:52:15,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:15,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528782380] [2022-03-15 21:52:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:16,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:16,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528782380] [2022-03-15 21:52:16,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528782380] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:16,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844517641] [2022-03-15 21:52:16,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:52:16,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:16,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:16,032 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) [2022-03-15 21:52:16,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:52:16,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:52:16,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:16,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:52:16,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:16,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-03-15 21:52:16,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-03-15 21:52:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:16,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:16,439 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 21:52:16,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 68 [2022-03-15 21:52:16,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,472 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:16,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 58 [2022-03-15 21:52:16,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,832 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:16,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 61 [2022-03-15 21:52:16,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:16,850 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:16,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 51 [2022-03-15 21:52:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:17,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844517641] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:17,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:17,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 21:52:17,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544635548] [2022-03-15 21:52:17,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:17,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:17,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 21:52:17,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:18,566 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4439#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N))), 4436#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1) (< i N)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)) (< i N))), 4433#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 4442#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N))), 4431#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)))), 4434#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 4437#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 4430#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 4444#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)))), 4443#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 4435#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 4441#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i)))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j))) (<= (+ 2 i) N))), 4438#(and (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (< (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i))))), 4432#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 4440#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))))] [2022-03-15 21:52:18,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:52:18,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:18,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:52:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:52:18,567 INFO L87 Difference]: Start difference. First operand 192 states and 622 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:25,665 INFO L93 Difference]: Finished difference Result 740 states and 1946 transitions. [2022-03-15 21:52:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 21:52:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:52:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:25,668 INFO L225 Difference]: With dead ends: 740 [2022-03-15 21:52:25,668 INFO L226 Difference]: Without dead ends: 720 [2022-03-15 21:52:25,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3620 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1938, Invalid=10272, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 21:52:25,671 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 488 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:25,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 0 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:52:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-03-15 21:52:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 204. [2022-03-15 21:52:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 3.3251231527093594) internal successors, (675), 203 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 675 transitions. [2022-03-15 21:52:25,685 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 675 transitions. Word has length 15 [2022-03-15 21:52:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:25,685 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 675 transitions. [2022-03-15 21:52:25,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 675 transitions. [2022-03-15 21:52:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:25,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:25,687 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:25,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:25,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:25,899 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1776705049, now seen corresponding path program 3 times [2022-03-15 21:52:25,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:25,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998783229] [2022-03-15 21:52:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:25,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:25,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998783229] [2022-03-15 21:52:25,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998783229] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:25,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653620840] [2022-03-15 21:52:25,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:52:25,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:25,939 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) [2022-03-15 21:52:25,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:52:25,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:52:25,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:25,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:52:25,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:52:26,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:52:26,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653620840] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:26,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:26,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-03-15 21:52:26,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735629697] [2022-03-15 21:52:26,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:26,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:26,058 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 88 transitions. [2022-03-15 21:52:26,058 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:26,460 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5853#(or (<= N i) (<= (+ 2 M i) (+ N j))), 5776#(< i N), 5848#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 5850#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 5851#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 5842#(< j M), 5844#(or (< j M) (< i N)), 5847#(or (< (+ 2 j) M) (<= M (+ j 1))), 5843#(or (< (+ j 1) M) (<= M j)), 5845#(or (< (+ j 1) M) (< i N) (<= M j)), 5852#(or (<= (+ 3 i) N) (<= N i)), 5846#(or (<= N i) (< (+ i 1) N)), 5849#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 21:52:26,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:52:26,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:52:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:52:26,461 INFO L87 Difference]: Start difference. First operand 204 states and 675 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:26,995 INFO L93 Difference]: Finished difference Result 462 states and 1457 transitions. [2022-03-15 21:52:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:52:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:52:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:26,998 INFO L225 Difference]: With dead ends: 462 [2022-03-15 21:52:26,998 INFO L226 Difference]: Without dead ends: 462 [2022-03-15 21:52:26,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:52:26,999 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:26,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-03-15 21:52:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 292. [2022-03-15 21:52:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.450171821305842) internal successors, (1004), 291 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 1004 transitions. [2022-03-15 21:52:27,006 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 1004 transitions. Word has length 15 [2022-03-15 21:52:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:27,008 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 1004 transitions. [2022-03-15 21:52:27,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 1004 transitions. [2022-03-15 21:52:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:27,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:27,009 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:27,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:27,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 21:52:27,209 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:27,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2113483265, now seen corresponding path program 4 times [2022-03-15 21:52:27,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:27,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515750673] [2022-03-15 21:52:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:27,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:27,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515750673] [2022-03-15 21:52:27,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515750673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:27,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743584790] [2022-03-15 21:52:27,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:52:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:27,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:27,347 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) [2022-03-15 21:52:27,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:52:27,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:52:27,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:27,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:52:27,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:27,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:27,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:27,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2022-03-15 21:52:27,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:27,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:27,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 21:52:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:27,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:27,680 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 21:52:27,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 68 [2022-03-15 21:52:27,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:27,708 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:27,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 58 [2022-03-15 21:52:27,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:27,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:27,999 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:27,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 61 [2022-03-15 21:52:28,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:28,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:28,018 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:28,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 51 [2022-03-15 21:52:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:28,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743584790] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:28,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:28,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 21:52:28,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76888413] [2022-03-15 21:52:28,206 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:28,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:28,211 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 21:52:28,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:29,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [7056#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N))), 7058#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 7047#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 7060#(and (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 7048#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 7055#(and (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N)) (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N))), 7061#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N))), 7054#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 7051#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 7052#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 7059#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 7057#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 7062#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 7053#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 7050#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 7049#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 7063#(and (or (< (+ 2 i) N) (< j M) (= res1 0)) (or (< j M) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) (select B (+ (- 1) N)) (select B i) (select A (+ (- 1) N))) res2)) (or (< (+ 2 i) N) (< j M) (<= res2 (+ (select A i) (select B (+ (- 1) N)) (select B i) (select A (+ (- 1) N))))))] [2022-03-15 21:52:29,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:52:29,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:52:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:29,928 INFO L87 Difference]: Start difference. First operand 292 states and 1004 transitions. Second operand has 26 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:34,114 INFO L93 Difference]: Finished difference Result 874 states and 2478 transitions. [2022-03-15 21:52:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:52:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 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 15 [2022-03-15 21:52:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:34,117 INFO L225 Difference]: With dead ends: 874 [2022-03-15 21:52:34,117 INFO L226 Difference]: Without dead ends: 846 [2022-03-15 21:52:34,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1379, Invalid=7177, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 21:52:34,119 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:34,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:52:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-03-15 21:52:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 306. [2022-03-15 21:52:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.4655737704918033) internal successors, (1057), 305 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1057 transitions. [2022-03-15 21:52:34,128 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 1057 transitions. Word has length 15 [2022-03-15 21:52:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:34,129 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 1057 transitions. [2022-03-15 21:52:34,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 1057 transitions. [2022-03-15 21:52:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:34,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:34,129 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:34,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:34,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:34,346 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1446005100, now seen corresponding path program 6 times [2022-03-15 21:52:34,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:34,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984494620] [2022-03-15 21:52:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:34,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:34,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984494620] [2022-03-15 21:52:34,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984494620] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:34,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163394141] [2022-03-15 21:52:34,394 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:34,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:34,396 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) [2022-03-15 21:52:34,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:52:34,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:52:34,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:34,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:52:34,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:34,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:34,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163394141] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:34,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:34,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-03-15 21:52:34,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021703601] [2022-03-15 21:52:34,534 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:34,534 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:34,539 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:52:34,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:35,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [8779#(or (<= N i) (<= (+ 2 i) N)), 8771#(or (<= N k) (< i N)), 8780#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 8775#(or (<= N (+ 2 k)) (< i N)), 8773#(or (<= N (+ k 1)) (< i N)), 8772#(<= N (+ k 1)), 8770#(<= N k), 8777#(or (<= N (+ k 1)) (<= (+ 2 i) N)), 8776#(or (<= N k) (<= (+ 2 i) N)), 8774#(<= N (+ 2 k)), 8778#(or (<= N (+ 2 k)) (<= (+ 2 i) N))] [2022-03-15 21:52:35,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:52:35,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:52:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:52:35,031 INFO L87 Difference]: Start difference. First operand 306 states and 1057 transitions. Second operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:35,406 INFO L93 Difference]: Finished difference Result 640 states and 2271 transitions. [2022-03-15 21:52:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:52:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 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 [2022-03-15 21:52:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:35,410 INFO L225 Difference]: With dead ends: 640 [2022-03-15 21:52:35,410 INFO L226 Difference]: Without dead ends: 624 [2022-03-15 21:52:35,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=474, Invalid=1332, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:52:35,411 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:35,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-03-15 21:52:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 409. [2022-03-15 21:52:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 3.588235294117647) internal successors, (1464), 408 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1464 transitions. [2022-03-15 21:52:35,420 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1464 transitions. Word has length 16 [2022-03-15 21:52:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:35,420 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 1464 transitions. [2022-03-15 21:52:35,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1464 transitions. [2022-03-15 21:52:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:35,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:35,422 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:35,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:35,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:52:35,635 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -85888360, now seen corresponding path program 7 times [2022-03-15 21:52:35,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:35,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064870680] [2022-03-15 21:52:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:35,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:35,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064870680] [2022-03-15 21:52:35,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064870680] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:35,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630529725] [2022-03-15 21:52:35,693 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:35,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:35,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:35,695 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:52:35,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:52:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:35,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:52:35,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:35,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:35,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630529725] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:35,812 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:35,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-03-15 21:52:35,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732440201] [2022-03-15 21:52:35,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:35,813 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:35,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:52:35,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:36,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [10386#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 10393#(or (<= N (+ k 1)) (<= (+ 2 k) i) (< j M)), 10364#(or (<= k i) (< j M)), 10389#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 10382#(or (< j M) (<= k (+ i 1))), 10374#(< j M), 10371#(or (<= (+ 2 k) N) (<= N k)), 10391#(or (<= N (+ k 1)) (<= (+ 2 k) i)), 10376#(or (< j M) (< i N)), 10390#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 10378#(or (<= N i) (< (+ i 1) N)), 10377#(or (<= (+ k 1) N) (< j M)), 10384#(or (< j M) (<= (+ k 1) i) (<= N k)), 10380#(or (<= N (+ i 1)) (< (+ 2 i) N)), 10383#(or (<= (+ 2 k) N) (< j M) (<= N k)), 10379#(or (<= N i) (< (+ i 1) N) (< j M)), 10394#(or (<= N (+ k 1)) (< j M) (<= (+ k 1) i)), 10372#(or (<= (+ k 1) i) (<= N k)), 10388#(or (< j M) (<= k (+ 2 i))), 10381#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 10373#(or (<= k i) (<= N k)), 10385#(or (<= k i) (< j M) (<= N k)), 10395#(and (or (< j M) (= (+ res2 (* (- 1) i)) 0)) (or (< j M) (<= k 0)) (or (< j M) (= res2 0))), 10392#(or (<= N (+ k 1)) (<= (+ k 1) i)), 10387#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 10375#(< i N)] [2022-03-15 21:52:36,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:52:36,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:52:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:52:36,672 INFO L87 Difference]: Start difference. First operand 409 states and 1464 transitions. Second operand has 34 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:40,408 INFO L93 Difference]: Finished difference Result 936 states and 3066 transitions. [2022-03-15 21:52:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-15 21:52:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 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 [2022-03-15 21:52:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:40,412 INFO L225 Difference]: With dead ends: 936 [2022-03-15 21:52:40,413 INFO L226 Difference]: Without dead ends: 936 [2022-03-15 21:52:40,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2688, Invalid=13824, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 21:52:40,416 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 431 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:40,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 0 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:52:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-03-15 21:52:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 464. [2022-03-15 21:52:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.5788336933045355) internal successors, (1657), 463 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1657 transitions. [2022-03-15 21:52:40,428 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1657 transitions. Word has length 16 [2022-03-15 21:52:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:40,428 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1657 transitions. [2022-03-15 21:52:40,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1657 transitions. [2022-03-15 21:52:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:40,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:40,429 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:40,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:40,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:52:40,637 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1294852214, now seen corresponding path program 5 times [2022-03-15 21:52:40,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:40,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636579821] [2022-03-15 21:52:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:40,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:40,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:40,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636579821] [2022-03-15 21:52:40,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636579821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:40,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282580631] [2022-03-15 21:52:40,687 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:52:40,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:40,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:40,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:52:40,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:52:40,709 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:52:40,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:40,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:40,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:40,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:40,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282580631] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:40,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:40,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 21:52:40,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083128893] [2022-03-15 21:52:40,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:40,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:40,824 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 21:52:40,824 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:41,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [12559#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 12562#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 12565#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 12563#(or (< j M) (<= (+ 2 i) N)), 12557#(or (< j M) (< i N)), 12555#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 12553#(or (< (+ j 1) M) (<= M j)), 12556#(or (<= N i) (<= (+ 2 i) N)), 12560#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 12564#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 12567#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 12569#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 12552#(< j M), 12566#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 12558#(or (< (+ j 1) M) (< i N) (<= M j)), 12554#(or (< (+ j 1) M) (<= N k) (<= M j)), 12568#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 12561#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 21:52:41,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:52:41,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:41,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:52:41,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:52:41,445 INFO L87 Difference]: Start difference. First operand 464 states and 1657 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:42,420 INFO L93 Difference]: Finished difference Result 824 states and 2955 transitions. [2022-03-15 21:52:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 21:52:42,420 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 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 [2022-03-15 21:52:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:42,423 INFO L225 Difference]: With dead ends: 824 [2022-03-15 21:52:42,424 INFO L226 Difference]: Without dead ends: 824 [2022-03-15 21:52:42,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1234, Invalid=4168, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:52:42,425 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:42,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:52:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-03-15 21:52:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 470. [2022-03-15 21:52:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.611940298507463) internal successors, (1694), 469 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1694 transitions. [2022-03-15 21:52:42,435 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1694 transitions. Word has length 16 [2022-03-15 21:52:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:42,435 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 1694 transitions. [2022-03-15 21:52:42,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1694 transitions. [2022-03-15 21:52:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:42,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:42,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:42,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:42,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:52:42,652 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash 778002844, now seen corresponding path program 6 times [2022-03-15 21:52:42,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:42,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635668708] [2022-03-15 21:52:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:42,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:42,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635668708] [2022-03-15 21:52:42,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635668708] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:42,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123930568] [2022-03-15 21:52:42,724 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:42,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:42,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:42,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:52:42,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 21:52:42,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:52:42,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:42,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:42,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:42,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:42,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123930568] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:42,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:42,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 21:52:42,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443871070] [2022-03-15 21:52:42,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:42,865 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:42,869 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 21:52:42,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:43,473 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [14520#(<= N k), 14537#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 14535#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 14521#(< j M), 14524#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 14529#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 14525#(or (<= N k) (< i N)), 14526#(or (< j M) (< i N)), 14539#(or (<= (+ 3 i) N) (< j M)), 14523#(or (< (+ j 1) M) (<= N k) (<= M j)), 14533#(or (< j M) (<= (+ 2 i) N)), 14527#(or (< j M) (<= N k) (< i N)), 14531#(or (<= N i) (<= (+ 2 i) N)), 14528#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 14538#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 14522#(or (< j M) (<= N k)), 14530#(or (<= N k) (<= (+ 2 i) N)), 14536#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 14534#(or (< j M) (<= N k) (<= (+ 2 i) N)), 14532#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 21:52:43,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:52:43,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:52:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:52:43,474 INFO L87 Difference]: Start difference. First operand 470 states and 1694 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:44,488 INFO L93 Difference]: Finished difference Result 777 states and 2824 transitions. [2022-03-15 21:52:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:52:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 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 [2022-03-15 21:52:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:44,492 INFO L225 Difference]: With dead ends: 777 [2022-03-15 21:52:44,492 INFO L226 Difference]: Without dead ends: 774 [2022-03-15 21:52:44,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1265, Invalid=4137, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:52:44,493 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:44,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:52:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-03-15 21:52:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 472. [2022-03-15 21:52:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.626326963906582) internal successors, (1708), 471 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1708 transitions. [2022-03-15 21:52:44,503 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1708 transitions. Word has length 16 [2022-03-15 21:52:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:44,503 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1708 transitions. [2022-03-15 21:52:44,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1708 transitions. [2022-03-15 21:52:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:44,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:44,504 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:44,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:44,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 21:52:44,720 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2138119584, now seen corresponding path program 7 times [2022-03-15 21:52:44,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:44,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756024853] [2022-03-15 21:52:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:44,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:44,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756024853] [2022-03-15 21:52:44,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756024853] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:44,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232870832] [2022-03-15 21:52:44,773 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:44,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:44,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:44,774 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:52:44,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 21:52:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:44,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:52:44,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:44,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:44,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232870832] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:44,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:44,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-03-15 21:52:44,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382020260] [2022-03-15 21:52:44,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:44,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:44,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 21:52:44,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:45,640 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [16463#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 16453#(or (< (+ j 1) M) (< k N) (<= M j)), 16467#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 16451#(or (< (+ j 1) M) (<= M j)), 16470#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 16468#(or (< (+ j 1) M) (<= (+ k 1) i) (<= N k) (<= M j)), 16459#(or (<= N i) (< (+ i 1) N) (< j M)), 16454#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 16466#(or (< (+ j 1) M) (<= k i) (<= M j)), 16452#(or (<= (+ k 1) N) (< j M)), 16462#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 16460#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16458#(or (< j M) (< i N)), 16469#(or (< (+ j 1) M) (<= k i) (<= N k) (<= M j)), 16461#(or (< (+ j 1) M) (< i N) (<= M j)), 16465#(or (< j M) (<= k (+ i 1))), 16456#(or (<= N i) (< (+ i 1) N)), 16457#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16471#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16472#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 16450#(< j M), 16464#(or (<= k i) (< j M)), 16455#(< i N)] [2022-03-15 21:52:45,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:52:45,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:52:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:52:45,641 INFO L87 Difference]: Start difference. First operand 472 states and 1708 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 31 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) [2022-03-15 21:52:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:59,815 INFO L93 Difference]: Finished difference Result 2774 states and 9049 transitions. [2022-03-15 21:52:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 387 states. [2022-03-15 21:52:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 31 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 16 [2022-03-15 21:52:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:59,825 INFO L225 Difference]: With dead ends: 2774 [2022-03-15 21:52:59,825 INFO L226 Difference]: Without dead ends: 2774 [2022-03-15 21:52:59,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72009 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18376, Invalid=150134, Unknown=0, NotChecked=0, Total=168510 [2022-03-15 21:52:59,834 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1300 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:59,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1300 Valid, 0 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:52:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-03-15 21:52:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 819. [2022-03-15 21:52:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 4.08679706601467) internal successors, (3343), 818 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 3343 transitions. [2022-03-15 21:52:59,861 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 3343 transitions. Word has length 16 [2022-03-15 21:52:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:59,861 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 3343 transitions. [2022-03-15 21:52:59,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 31 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) [2022-03-15 21:52:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 3343 transitions. [2022-03-15 21:52:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:59,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:59,863 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:59,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:00,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:00,064 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1525503648, now seen corresponding path program 8 times [2022-03-15 21:53:00,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:00,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878206664] [2022-03-15 21:53:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:00,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:00,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878206664] [2022-03-15 21:53:00,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878206664] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:00,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56876869] [2022-03-15 21:53:00,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:00,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:00,100 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:00,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:53:00,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:00,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:00,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:53:00,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:53:00,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:53:00,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56876869] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:00,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:00,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-03-15 21:53:00,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676428338] [2022-03-15 21:53:00,206 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:00,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:00,211 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 106 transitions. [2022-03-15 21:53:00,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:00,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [21738#(or (<= N i) (< (+ i 1) N)), 21749#(or (<= N i) (< (+ i 1) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 21745#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 21732#(< j M), 21740#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 21743#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 21737#(or (<= (+ 2 M) j) (< i N)), 21741#(or (<= N i) (< (+ i 1) N) (<= (+ 2 M) j)), 21744#(or (<= (+ M 1) j) (< i N)), 21734#(< i N), 21746#(or (<= N i) (< (+ i 1) N) (<= (+ M 1) j)), 21748#(or (<= M (+ 2 j)) (< (+ 3 j) M) (< i N)), 21733#(or (< (+ j 1) M) (<= M j)), 21742#(or (< (+ 2 j) M) (<= M (+ j 1))), 21747#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 21736#(or (< (+ j 1) M) (< i N) (<= M j)), 21739#(or (<= N i) (< (+ i 1) N) (< j M)), 21735#(or (< j M) (< i N))] [2022-03-15 21:53:00,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:53:00,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:53:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:53:00,705 INFO L87 Difference]: Start difference. First operand 819 states and 3343 transitions. Second operand has 25 states, 25 states have (on average 3.32) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:01,371 INFO L93 Difference]: Finished difference Result 1716 states and 6768 transitions. [2022-03-15 21:53:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:53:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.32) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 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 [2022-03-15 21:53:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:01,378 INFO L225 Difference]: With dead ends: 1716 [2022-03-15 21:53:01,378 INFO L226 Difference]: Without dead ends: 1708 [2022-03-15 21:53:01,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=692, Invalid=2500, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:53:01,379 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 350 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:01,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:53:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-03-15 21:53:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1076. [2022-03-15 21:53:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 4.190697674418605) internal successors, (4505), 1075 states have internal predecessors, (4505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 4505 transitions. [2022-03-15 21:53:01,404 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 4505 transitions. Word has length 16 [2022-03-15 21:53:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:01,404 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 4505 transitions. [2022-03-15 21:53:01,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.32) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 4505 transitions. [2022-03-15 21:53:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:01,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:01,406 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:01,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:01,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:53:01,623 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1935541558, now seen corresponding path program 9 times [2022-03-15 21:53:01,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:01,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621147184] [2022-03-15 21:53:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:01,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:01,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621147184] [2022-03-15 21:53:01,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621147184] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:01,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870549641] [2022-03-15 21:53:01,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:01,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:01,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:01,691 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:53:01,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:53:01,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:01,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:53:01,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:01,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:01,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870549641] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:01,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:01,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-03-15 21:53:01,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010631600] [2022-03-15 21:53:01,792 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:01,793 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:01,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:53:01,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:02,579 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [25781#(<= N k), 25788#(or (<= N (+ k 1)) (< j M)), 25791#(or (<= N (+ k 1)) (< j M) (< i N)), 25794#(or (< j M) (<= N k) (<= (+ 2 i) N)), 25776#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 25789#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 25790#(or (< j M) (<= N k) (< i N)), 25797#(or (<= (+ 3 i) N) (< j M)), 25786#(or (<= N (+ k 1)) (<= (+ 2 i) N)), 25798#(or (< j M) (<= (+ 2 i) k)), 25792#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 25787#(or (< j M) (<= N k)), 25777#(< j M), 25775#(or (<= N i) (<= (+ 2 i) N)), 25785#(or (<= N k) (<= (+ 2 i) N)), 25780#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 25782#(or (<= N k) (< i N)), 25784#(or (<= N (+ k 1)) (< i N)), 25795#(or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N)), 25778#(or (< j M) (< i N)), 25779#(or (<= N i) (< (+ i 1) N) (< j M)), 25793#(or (< j M) (<= (+ 2 i) N)), 25783#(<= N (+ k 1)), 25796#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j))] [2022-03-15 21:53:02,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:53:02,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:02,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:53:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:53:02,580 INFO L87 Difference]: Start difference. First operand 1076 states and 4505 transitions. Second operand has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:03,718 INFO L93 Difference]: Finished difference Result 1613 states and 6567 transitions. [2022-03-15 21:53:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 21:53:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 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 [2022-03-15 21:53:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:03,726 INFO L225 Difference]: With dead ends: 1613 [2022-03-15 21:53:03,726 INFO L226 Difference]: Without dead ends: 1599 [2022-03-15 21:53:03,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1512, Invalid=4968, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:53:03,727 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:03,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:53:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2022-03-15 21:53:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1072. [2022-03-15 21:53:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 4.1988795518207285) internal successors, (4497), 1071 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 4497 transitions. [2022-03-15 21:53:03,748 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 4497 transitions. Word has length 16 [2022-03-15 21:53:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:03,749 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 4497 transitions. [2022-03-15 21:53:03,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 4497 transitions. [2022-03-15 21:53:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:03,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:03,751 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:03,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:03,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:03,967 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash -21823584, now seen corresponding path program 10 times [2022-03-15 21:53:03,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:03,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246141373] [2022-03-15 21:53:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:04,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:04,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246141373] [2022-03-15 21:53:04,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246141373] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:04,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934997492] [2022-03-15 21:53:04,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:53:04,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:04,041 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:04,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:53:04,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:53:04,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:04,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:53:04,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:04,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:04,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934997492] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:04,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:04,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2022-03-15 21:53:04,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [663347502] [2022-03-15 21:53:04,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:04,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:04,190 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:53:04,190 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:04,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [29754#(< i N), 29763#(or (<= N i) (<= k (+ i 1))), 29768#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 29766#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 29765#(or (<= N (+ i 1)) (<= k (+ 2 i))), 29756#(or (<= (+ 2 k) N) (< j M) (<= N k)), 29755#(or (< j M) (< i N)), 29758#(or (<= N i) (< (+ i 1) N)), 29769#(or (<= N (+ i 1)) (< j M) (<= k (+ 2 i))), 29762#(or (<= N (+ i 1)) (< (+ 2 i) N)), 29757#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= N k) (<= M j)), 29764#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 29751#(or (<= (+ 2 k) N) (<= N k)), 29761#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 29752#(< j M), 29733#(or (<= k i) (< j M)), 29770#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= j (+ i 1)) (<= N i))), 29759#(or (<= N i) (< (+ i 1) N) (< j M)), 29760#(or (< j M) (<= (+ k 1) i)), 29767#(or (<= N i) (< j M) (<= k (+ i 1))), 29753#(or (<= (+ k 1) N) (< j M))] [2022-03-15 21:53:04,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:53:04,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:53:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:53:04,963 INFO L87 Difference]: Start difference. First operand 1072 states and 4497 transitions. Second operand has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:10,041 INFO L93 Difference]: Finished difference Result 2715 states and 9927 transitions. [2022-03-15 21:53:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2022-03-15 21:53:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 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 [2022-03-15 21:53:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:10,052 INFO L225 Difference]: With dead ends: 2715 [2022-03-15 21:53:10,052 INFO L226 Difference]: Without dead ends: 2715 [2022-03-15 21:53:10,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13957 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4913, Invalid=32917, Unknown=0, NotChecked=0, Total=37830 [2022-03-15 21:53:10,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 581 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:10,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 0 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:53:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-03-15 21:53:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 1311. [2022-03-15 21:53:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 4.314503816793893) internal successors, (5652), 1310 states have internal predecessors, (5652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 5652 transitions. [2022-03-15 21:53:10,087 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 5652 transitions. Word has length 16 [2022-03-15 21:53:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:10,088 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 5652 transitions. [2022-03-15 21:53:10,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 5652 transitions. [2022-03-15 21:53:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:10,092 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:10,092 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:10,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 21:53:10,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:10,302 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 325701383, now seen corresponding path program 8 times [2022-03-15 21:53:10,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:10,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423361904] [2022-03-15 21:53:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:10,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:10,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423361904] [2022-03-15 21:53:10,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423361904] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:10,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663351493] [2022-03-15 21:53:10,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:10,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:10,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:10,477 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:10,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 21:53:10,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:10,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:10,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:53:10,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:10,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-03-15 21:53:10,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-03-15 21:53:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:10,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:10,906 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:53:10,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 57 treesize of output 122 [2022-03-15 21:53:10,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:10,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:10,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:10,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:10,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:10,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:10,944 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:10,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 114 [2022-03-15 21:53:11,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:11,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:11,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 32 [2022-03-15 21:53:11,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:11,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:11,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:11,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2022-03-15 21:53:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:11,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663351493] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:11,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:11,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 21:53:11,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781057485] [2022-03-15 21:53:11,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:11,401 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:11,408 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 21:53:11,408 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:14,924 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [35581#(and (or (< (+ 2 i) N) (< j M) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (<= N k)) (or (< j M) (<= N k) (<= (+ 2 i) N))), 35578#(and (or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (< j M) (<= (+ 2 i) N))), 35587#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (<= res2 (+ (select A i) (select A (+ (- 1) k)) (select B (+ (- 1) k)) res1 (select B i)))) (or (< (+ 2 i) k) (< j M) (<= (+ (select A i) (select A (+ (- 1) k)) (select B (+ (- 1) k)) res1 (select B i)) res2))), 35589#(and (or (< j M) (= k i)) (or (= res2 res1) (< j M)) (or (< j M) (= i res2)) (or (< j M) (= res2 0))), 35553#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 35572#(and (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N)) (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N))), 35569#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 35585#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 35563#(and (or (<= (+ 3 i) N) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= N (+ 2 k))) (or (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (<= N (+ 2 k)))), 35565#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 35557#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N))), 35560#(and (or (<= N (+ 2 k)) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1)) (or (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 2 k)))), 35570#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 35588#(and (or (< j M) (<= res2 (+ (select A i) res1 (select B i)))) (or (< j M) (<= (+ (select A i) res1 (select B i)) res2)) (or (<= (+ i 1) k) (< j M))), 35559#(and (or (<= N (+ k 1)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))))), 35554#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 35576#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 35577#(and (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 35579#(and (or (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)))) (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N))), 35556#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 35558#(and (or (<= N (+ k 1)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 35582#(and (or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))))), 35564#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 35586#(and (or (< j M) (< (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) res1 (select B i) (select A (+ (- 1) N))))) (or (< j M) (< (+ 3 i) N) (<= (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) res1 (select B i) (select A (+ (- 1) N))) res2)) (or (<= (+ 3 i) N) (< j M))), 35561#(and (or (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 2 k)) (< i N)) (or (<= N (+ 2 k)) (< i N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 35555#(and (or (<= N k) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (<= N k))), 35566#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 35580#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 35574#(and (or (< j M) (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 2 k))) (or (< j M) (<= N (+ 2 k)) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 35583#(and (or (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M) (<= N (+ 2 k))) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= N (+ 2 k)))), 35573#(and (or (<= N (+ k 1)) (< j M) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N))), 35571#(and (or (<= N (+ k 1)) (< j M) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1)) (or (<= N (+ k 1)) (< j M) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)))), 35584#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 35552#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 35562#(and (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))))), 35567#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 35568#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 35575#(and (or (< j M) (<= N (+ 2 k)) (< i N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1)) (or (< j M) (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 2 k)) (< i N)))] [2022-03-15 21:53:14,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 21:53:14,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 21:53:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=3275, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:53:14,925 INFO L87 Difference]: Start difference. First operand 1311 states and 5652 transitions. Second operand has 49 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:39,642 INFO L93 Difference]: Finished difference Result 2372 states and 8871 transitions. [2022-03-15 21:53:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-03-15 21:53:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:53:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:39,659 INFO L225 Difference]: With dead ends: 2372 [2022-03-15 21:53:39,659 INFO L226 Difference]: Without dead ends: 2344 [2022-03-15 21:53:39,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24585 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=10790, Invalid=55516, Unknown=0, NotChecked=0, Total=66306 [2022-03-15 21:53:39,662 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1008 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:39,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 0 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:53:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-03-15 21:53:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1368. [2022-03-15 21:53:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1367 states have (on average 4.284564740307242) internal successors, (5857), 1367 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 5857 transitions. [2022-03-15 21:53:39,692 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 5857 transitions. Word has length 17 [2022-03-15 21:53:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:39,694 INFO L470 AbstractCegarLoop]: Abstraction has 1368 states and 5857 transitions. [2022-03-15 21:53:39,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 5857 transitions. [2022-03-15 21:53:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:39,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:39,697 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:39,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:39,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:39,913 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2049428739, now seen corresponding path program 9 times [2022-03-15 21:53:39,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:39,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316108681] [2022-03-15 21:53:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:39,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:39,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316108681] [2022-03-15 21:53:39,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316108681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:39,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496149757] [2022-03-15 21:53:39,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:39,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:39,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:39,980 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:39,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 21:53:40,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:53:40,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:40,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:53:40,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:40,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:53:40,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496149757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:40,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:40,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-03-15 21:53:40,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [685203971] [2022-03-15 21:53:40,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:40,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:40,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:53:40,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:41,208 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [41226#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 41205#(or (<= (+ N 1) i) (< k N)), 41216#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 41214#(or (< j M) (< k N)), 41213#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 41209#(or (<= N i) (<= N k) (< (+ k 1) N)), 41220#(or (<= N i) (< j M) (< k N)), 41218#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 41225#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 41215#(or (< j M) (<= N k) (< (+ k 1) N)), 41201#(or (<= N (+ k 1)) (< (+ 2 k) N)), 41207#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 41204#(or (<= N i) (< j M)), 41199#(< k N), 41224#(or (<= N (+ i 1)) (< j M) (< k N)), 41202#(< j M), 41211#(or (<= N (+ i 1)) (< k N)), 41228#(or (< j M) (<= k (+ 2 i))), 41212#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 41221#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 41230#(and (or (< j M) (= (+ res2 (* (- 1) i)) 0)) (or (< j M) (<= k 0)) (or (< j M) (= res2 0))), 41203#(or (< j M) (<= (+ N 1) i)), 41208#(or (<= N i) (< k N)), 41219#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 41229#(or (< j M) (<= k (+ i 1))), 41206#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 41200#(or (<= N k) (< (+ k 1) N)), 41222#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 41223#(or (<= N (+ i 1)) (< j M)), 41210#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 41227#(or (<= N (+ 2 i)) (< j M)), 41217#(or (< j M) (<= (+ N 1) i) (< k N))] [2022-03-15 21:53:41,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 21:53:41,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:41,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 21:53:41,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:53:41,209 INFO L87 Difference]: Start difference. First operand 1368 states and 5857 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:43,163 INFO L93 Difference]: Finished difference Result 1904 states and 7555 transitions. [2022-03-15 21:53:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 21:53:43,163 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:53:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:43,168 INFO L225 Difference]: With dead ends: 1904 [2022-03-15 21:53:43,168 INFO L226 Difference]: Without dead ends: 1893 [2022-03-15 21:53:43,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3365 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2664, Invalid=10218, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 21:53:43,170 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 353 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:43,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 0 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:53:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2022-03-15 21:53:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1410. [2022-03-15 21:53:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 4.227111426543648) internal successors, (5956), 1409 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5956 transitions. [2022-03-15 21:53:43,198 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5956 transitions. Word has length 17 [2022-03-15 21:53:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:43,199 INFO L470 AbstractCegarLoop]: Abstraction has 1410 states and 5956 transitions. [2022-03-15 21:53:43,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5956 transitions. [2022-03-15 21:53:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:43,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:43,202 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:43,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-15 21:53:43,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:43,415 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash -607067803, now seen corresponding path program 11 times [2022-03-15 21:53:43,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:43,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574766625] [2022-03-15 21:53:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:43,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:43,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574766625] [2022-03-15 21:53:43,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574766625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:43,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527030566] [2022-03-15 21:53:43,634 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:53:43,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:43,635 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:43,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 21:53:43,659 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:53:43,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:43,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:53:43,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:43,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:43,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:43,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:43,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:43,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:43,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-03-15 21:53:43,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:43,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:43,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:43,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2022-03-15 21:53:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:43,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:44,218 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 21:53:44,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 138 [2022-03-15 21:53:44,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:44,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:44,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:44,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:44,268 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:44,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 126 [2022-03-15 21:53:46,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:46,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 97 [2022-03-15 21:53:46,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:46,541 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:53:46,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 79 [2022-03-15 21:53:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:46,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527030566] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:46,830 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:46,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 21:53:46,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1695834630] [2022-03-15 21:53:46,830 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:46,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:46,836 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 119 transitions. [2022-03-15 21:53:46,836 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:49,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [46218#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 46233#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1)) (< i N))), 46217#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 46215#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 46223#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 46227#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M)))), 46230#(and (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))))), 46234#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 46226#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i)))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j))) (<= (+ 2 i) N))), 46225#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 46222#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)))), 46214#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 46228#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N))), 46237#(and (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 46219#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)))), 46232#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1))), 46216#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 46224#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 46235#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)))), 46220#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1) (< i N)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)) (< i N))), 46213#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 46221#(and (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (< (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i))))), 46236#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 46231#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 46229#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N)))] [2022-03-15 21:53:49,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:53:49,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:53:49,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2090, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:53:49,558 INFO L87 Difference]: Start difference. First operand 1410 states and 5956 transitions. Second operand has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:21,493 INFO L93 Difference]: Finished difference Result 3822 states and 12693 transitions. [2022-03-15 21:54:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-03-15 21:54:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:54:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:21,513 INFO L225 Difference]: With dead ends: 3822 [2022-03-15 21:54:21,513 INFO L226 Difference]: Without dead ends: 3790 [2022-03-15 21:54:21,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19996 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=9132, Invalid=47274, Unknown=0, NotChecked=0, Total=56406 [2022-03-15 21:54:21,518 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 860 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:21,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 0 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 21:54:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2022-03-15 21:54:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 1474. [2022-03-15 21:54:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1473 states have (on average 4.23285811269518) internal successors, (6235), 1473 states have internal predecessors, (6235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 6235 transitions. [2022-03-15 21:54:21,558 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 6235 transitions. Word has length 17 [2022-03-15 21:54:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:21,558 INFO L470 AbstractCegarLoop]: Abstraction has 1474 states and 6235 transitions. [2022-03-15 21:54:21,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 6235 transitions. [2022-03-15 21:54:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:54:21,561 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:21,561 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:21,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 21:54:21,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 21:54:21,780 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash 550470911, now seen corresponding path program 12 times [2022-03-15 21:54:21,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:21,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973093193] [2022-03-15 21:54:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:21,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:21,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973093193] [2022-03-15 21:54:21,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973093193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:21,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001442538] [2022-03-15 21:54:21,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:54:21,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:21,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:21,983 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:54:21,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 21:54:22,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:54:22,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:22,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:54:22,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:22,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:22,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:22,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-03-15 21:54:22,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:22,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2022-03-15 21:54:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:22,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:22,520 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 21:54:22,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 138 [2022-03-15 21:54:22,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:22,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:22,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 126 [2022-03-15 21:54:24,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,234 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:24,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 97 [2022-03-15 21:54:24,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:24,266 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:24,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 79 [2022-03-15 21:54:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:24,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001442538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:24,565 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:24,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 21:54:24,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798133151] [2022-03-15 21:54:24,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:24,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:24,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 121 transitions. [2022-03-15 21:54:24,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:27,238 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [53511#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 53523#(and (or (<= N k) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (<= N k))), 53531#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 53510#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 53528#(and (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))))), 53508#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 53532#(and (or (< j M) (< (+ 3 i) N) (= res1 0)) (or (< j M) (<= res2 (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) (select B i) (select A (+ (- 1) N)))) (< (+ 3 i) N)) (or (< j M) (< (+ 3 i) N) (<= (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) (select B i) (select A (+ (- 1) N))) res2)) (or (<= (+ 3 i) N) (< j M))), 53509#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 53512#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 53516#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N))), 53521#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N))), 53507#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 53513#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 53506#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 53524#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 53526#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 53527#(and (or (< (+ 2 i) N) (< j M) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (<= N k)) (or (< j M) (<= N k) (<= (+ 2 i) N))), 53518#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1)) (< i N))), 53530#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 53522#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 53529#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)))), 53514#(and (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N)) (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N))), 53517#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1))), 53519#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 53515#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 53525#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 53520#(and (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i)))))] [2022-03-15 21:54:27,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:54:27,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:27,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:54:27,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2250, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:54:27,239 INFO L87 Difference]: Start difference. First operand 1474 states and 6235 transitions. Second operand has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:47,420 INFO L93 Difference]: Finished difference Result 3914 states and 13274 transitions. [2022-03-15 21:54:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-03-15 21:54:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:54:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:47,429 INFO L225 Difference]: With dead ends: 3914 [2022-03-15 21:54:47,429 INFO L226 Difference]: Without dead ends: 3856 [2022-03-15 21:54:47,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13748 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=6579, Invalid=34427, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 21:54:47,431 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:47,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 0 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:54:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2022-03-15 21:54:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 1552. [2022-03-15 21:54:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 4.248871695680206) internal successors, (6590), 1551 states have internal predecessors, (6590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 6590 transitions. [2022-03-15 21:54:47,479 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 6590 transitions. Word has length 17 [2022-03-15 21:54:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:47,480 INFO L470 AbstractCegarLoop]: Abstraction has 1552 states and 6590 transitions. [2022-03-15 21:54:47,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 6590 transitions. [2022-03-15 21:54:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:54:47,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:47,483 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:47,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 21:54:47,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 21:54:47,699 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2020769029, now seen corresponding path program 13 times [2022-03-15 21:54:47,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:47,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305504930] [2022-03-15 21:54:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:47,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:47,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305504930] [2022-03-15 21:54:47,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305504930] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:47,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505497698] [2022-03-15 21:54:47,755 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:54:47,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:47,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:47,756 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:54:47,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 21:54:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:47,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:54:47,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:47,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:54:47,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505497698] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:47,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:47,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-03-15 21:54:47,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980109177] [2022-03-15 21:54:47,897 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:47,898 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:47,903 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 127 transitions. [2022-03-15 21:54:47,903 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:48,786 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [60971#(or (< (+ j 1) M) (< k N) (<= M j)), 60985#(or (<= N (+ i 1)) (< k N)), 60968#(< j M), 60979#(or (< (+ j 1) M) (<= N i) (<= M j)), 60972#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 60983#(or (<= N (+ i 1)) (< j M)), 60988#(or (< (+ j 1) M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N) (<= M j)), 60969#(or (< j M) (< k N)), 60989#(or (<= N (+ 2 i)) (< j M)), 60992#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= M j)), 60984#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 60991#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 60976#(or (<= N i) (< k N)), 60973#(or (<= (+ N 1) i) (< k N)), 60977#(or (< (+ j 1) M) (<= (+ N 1) i) (<= M j)), 60982#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 60967#(< k N), 60980#(or (<= N i) (< j M) (< k N)), 60970#(or (< (+ j 1) M) (<= M j)), 60981#(or (< (+ j 1) M) (<= (+ N 1) i) (< k N) (<= M j)), 60986#(or (<= N (+ i 1)) (< j M) (< k N)), 60975#(or (< j M) (<= (+ N 1) i) (< k N)), 60978#(or (<= N i) (< j M)), 60990#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 60974#(or (< j M) (<= (+ N 1) i)), 60987#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j))] [2022-03-15 21:54:48,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:54:48,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:54:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:54:48,787 INFO L87 Difference]: Start difference. First operand 1552 states and 6590 transitions. Second operand has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:51,763 INFO L93 Difference]: Finished difference Result 3164 states and 11352 transitions. [2022-03-15 21:54:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-15 21:54:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:54:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:51,770 INFO L225 Difference]: With dead ends: 3164 [2022-03-15 21:54:51,770 INFO L226 Difference]: Without dead ends: 3150 [2022-03-15 21:54:51,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7947 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4844, Invalid=21238, Unknown=0, NotChecked=0, Total=26082 [2022-03-15 21:54:51,772 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 414 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:51,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 0 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:54:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2022-03-15 21:54:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1566. [2022-03-15 21:54:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 4.228753993610224) internal successors, (6618), 1565 states have internal predecessors, (6618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 6618 transitions. [2022-03-15 21:54:51,833 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 6618 transitions. Word has length 17 [2022-03-15 21:54:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:51,833 INFO L470 AbstractCegarLoop]: Abstraction has 1566 states and 6618 transitions. [2022-03-15 21:54:51,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 6618 transitions. [2022-03-15 21:54:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:54:51,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:51,837 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:51,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 21:54:52,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:52,045 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash -348902365, now seen corresponding path program 14 times [2022-03-15 21:54:52,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:52,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276622451] [2022-03-15 21:54:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:52,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:52,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276622451] [2022-03-15 21:54:52,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276622451] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:52,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318170369] [2022-03-15 21:54:52,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:54:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:52,245 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:54:52,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 21:54:52,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:54:52,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:52,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:54:52,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:52,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:52,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:54:52,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2022-03-15 21:54:52,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-03-15 21:54:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:52,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:52,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,785 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 21:54:52,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 54 treesize of output 139 [2022-03-15 21:54:52,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:52,833 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:52,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 36 treesize of output 127 [2022-03-15 21:54:54,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,763 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:54,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 96 [2022-03-15 21:54:54,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:54:54,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:54:54,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-03-15 21:54:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:55,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318170369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:55,102 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:55,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 21:54:55,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154400375] [2022-03-15 21:54:55,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:55,104 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:55,109 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 21:54:55,109 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:58,179 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [67668#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) (+ (select A i) res1 (select B i))) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1)))))), 67673#(and (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 67664#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M)))), 67674#(and (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 j) M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select B j) 1 (select B (+ j 1)))))), 67659#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) res1) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) 1 (select B (+ j 1)))))), 67653#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 67660#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1) (< i N)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)) (< i N))), 67661#(and (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (< (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i))))), 67654#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 67671#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 67672#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 67662#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i)))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j))) (<= (+ 2 i) N))), 67650#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 67675#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))))) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< (+ 2 j) M))), 67665#(and (or (not (< (+ j 1) M)) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) 1 (select B (+ j 1)))) (<= N k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) res1) (<= N k) (< (+ 2 j) M))), 67663#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)))), 67656#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 67652#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 67670#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) (+ (select A i) res1 (select B i))) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (not (< (+ j 1) M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1)))) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N))), 67666#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (< i N) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) 1 (select B (+ j 1))))) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) res1) (< (+ 2 j) M) (< i N))), 67658#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)))), 67651#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 67676#(and (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (<= N k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= N k) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1)))) (< (+ 2 j) M))), 67667#(and (or (not (< (+ j 1) M)) (< (+ i 1) N) (not (< i N)) (< (+ 2 j) M) (< (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ j 1)) res2 (select B j) 1 (select B (+ j 1))))) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) (+ (select A i) res1 (select B i))) (< (+ i 1) N) (not (< i N)) (< (+ 2 j) M))), 67657#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 67655#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 67669#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) res1) (<= N k) (< (+ 2 j) M) (< i N)) (or (not (< (+ j 1) M)) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) 1 (select B (+ j 1)))) (<= N k) (< (+ 2 j) M) (< i N))), 67677#(and (or (not (< (+ j 1) M)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select B j) 1 (select B (+ j 1)))) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select B (+ j 1))) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 2 j) M)))] [2022-03-15 21:54:58,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:54:58,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:58,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:54:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:54:58,180 INFO L87 Difference]: Start difference. First operand 1566 states and 6618 transitions. Second operand has 39 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:41,569 INFO L93 Difference]: Finished difference Result 4972 states and 16099 transitions. [2022-03-15 21:55:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2022-03-15 21:55:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:55:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:41,577 INFO L225 Difference]: With dead ends: 4972 [2022-03-15 21:55:41,578 INFO L226 Difference]: Without dead ends: 4926 [2022-03-15 21:55:41,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40605 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=14603, Invalid=87477, Unknown=0, NotChecked=0, Total=102080 [2022-03-15 21:55:41,581 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1041 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:41,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1041 Valid, 0 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 21:55:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2022-03-15 21:55:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 1677. [2022-03-15 21:55:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 4.2243436754176615) internal successors, (7080), 1676 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 7080 transitions. [2022-03-15 21:55:41,624 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 7080 transitions. Word has length 17 [2022-03-15 21:55:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:41,624 INFO L470 AbstractCegarLoop]: Abstraction has 1677 states and 7080 transitions. [2022-03-15 21:55:41,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 7080 transitions. [2022-03-15 21:55:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:55:41,627 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:41,627 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:41,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 21:55:41,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:41,828 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2074432677, now seen corresponding path program 15 times [2022-03-15 21:55:41,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:41,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718537077] [2022-03-15 21:55:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:42,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:42,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718537077] [2022-03-15 21:55:42,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718537077] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:42,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562861672] [2022-03-15 21:55:42,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:55:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:42,029 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:55:42,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 21:55:42,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:55:42,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:42,055 WARN L261 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 21:55:42,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:42,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:42,252 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:42,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 92 [2022-03-15 21:55:42,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:42,276 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:42,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 172 [2022-03-15 21:55:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:42,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,240 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:43,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 60 [2022-03-15 21:55:43,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,257 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:43,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 38 [2022-03-15 21:55:43,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2022-03-15 21:55:43,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:43,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 5 [2022-03-15 21:55:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:43,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562861672] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:43,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:43,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:55:43,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [457635813] [2022-03-15 21:55:43,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:43,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:43,367 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:55:43,367 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:46,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [76677#(and (or (<= N (+ k 1)) (< j M) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1)) (or (<= N (+ k 1)) (< j M) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)))), 76690#(and (or (< j M) (< (+ 3 i) N) (= res1 0)) (or (< j M) (<= res2 (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) (select B i) (select A (+ (- 1) N)))) (< (+ 3 i) N)) (or (< j M) (< (+ 3 i) N) (<= (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) (select B i) (select A (+ (- 1) N))) res2)) (or (<= (+ 3 i) N) (< j M))), 76691#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)))), 76661#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 76680#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1))), 76670#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 76665#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 76673#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 76687#(and (or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))))), 76662#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 76683#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 76671#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 76684#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 76667#(and (or (<= N k) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (<= N k))), 76669#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 76674#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 76672#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 76685#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 76666#(and (or (<= N (+ k 1)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 76686#(and (or (< (+ 2 i) N) (< j M) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (<= N k)) (or (< j M) (<= N k) (<= (+ 2 i) N))), 76681#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1)) (< i N))), 76692#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (= res1 0)) (or (<= (+ (select A i) (select A (+ (- 1) k)) (select B (+ (- 1) k)) (select B i)) res2) (< (+ 2 i) k) (< j M)) (or (< (+ 2 i) k) (< j M) (<= res2 (+ (select A i) (select A (+ (- 1) k)) (select B (+ (- 1) k)) (select B i))))), 76682#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 76676#(and (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 76675#(and (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N)) (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N))), 76663#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 76688#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 76689#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 76664#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N))), 76668#(and (or (<= N (+ k 1)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))))), 76678#(and (or (<= N (+ k 1)) (< j M) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N))), 76679#(and (or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (< j M) (<= (+ 2 i) N)))] [2022-03-15 21:55:46,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:55:46,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:55:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=3079, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:55:46,886 INFO L87 Difference]: Start difference. First operand 1677 states and 7080 transitions. Second operand has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 42 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:14,525 INFO L93 Difference]: Finished difference Result 4605 states and 15398 transitions. [2022-03-15 21:56:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-03-15 21:56:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 42 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:56:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:14,533 INFO L225 Difference]: With dead ends: 4605 [2022-03-15 21:56:14,533 INFO L226 Difference]: Without dead ends: 4518 [2022-03-15 21:56:14,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29165 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=12686, Invalid=67120, Unknown=0, NotChecked=0, Total=79806 [2022-03-15 21:56:14,536 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 663 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 3458 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 3458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:14,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 0 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 3458 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 21:56:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-03-15 21:56:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 1707. [2022-03-15 21:56:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 4.2168815943728015) internal successors, (7194), 1706 states have internal predecessors, (7194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 7194 transitions. [2022-03-15 21:56:14,593 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 7194 transitions. Word has length 17 [2022-03-15 21:56:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:14,593 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 7194 transitions. [2022-03-15 21:56:14,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 42 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 7194 transitions. [2022-03-15 21:56:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:56:14,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:14,596 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:14,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 21:56:14,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 21:56:14,814 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:56:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1193873817, now seen corresponding path program 16 times [2022-03-15 21:56:14,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:14,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554869208] [2022-03-15 21:56:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:15,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:15,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554869208] [2022-03-15 21:56:15,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554869208] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:15,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918756774] [2022-03-15 21:56:15,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:56:15,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:15,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:15,035 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:56:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 21:56:15,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:56:15,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:15,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:56:15,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:15,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:15,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:15,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-03-15 21:56:15,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-03-15 21:56:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:15,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:15,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,623 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 21:56:15,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 54 treesize of output 139 [2022-03-15 21:56:15,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:15,678 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:15,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 36 treesize of output 127 [2022-03-15 21:56:17,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:17,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 96 [2022-03-15 21:56:17,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:17,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:17,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-03-15 21:56:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:17,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918756774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:17,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:17,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 21:56:17,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1824254491] [2022-03-15 21:56:17,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:17,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:17,912 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 21:56:17,912 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:20,852 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [85294#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M)))), 85282#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 85296#(and (or (not (< (+ j 1) M)) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) 1 (select B (+ j 1)))) (<= N k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) res1) (<= N k) (< (+ 2 j) M))), 85295#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 85293#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)))), 85292#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i)))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j))) (<= (+ 2 i) N))), 85297#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N))), 85303#(and (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 85281#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 85286#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 85285#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 85305#(and (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (<= N k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= N k) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1)))) (< (+ 2 j) M))), 85291#(and (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (< (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i))))), 85301#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 85302#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 85288#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 85283#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 85300#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) (+ (select A i) res1 (select B i))) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (not (< (+ j 1) M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1)))) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N))), 85299#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N))), 85289#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)))), 85284#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 85290#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1) (< i N)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)) (< i N))), 85287#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 85304#(and (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))))), 85298#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) res1) (<= N k) (< (+ 2 j) M) (< i N)) (or (not (< (+ j 1) M)) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) 1 (select B (+ j 1)))) (<= N k) (< (+ 2 j) M) (< i N)))] [2022-03-15 21:56:20,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:56:20,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:56:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2163, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:56:20,853 INFO L87 Difference]: Start difference. First operand 1707 states and 7194 transitions. Second operand has 36 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:52,836 INFO L93 Difference]: Finished difference Result 4946 states and 16357 transitions. [2022-03-15 21:56:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-03-15 21:56:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:56:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:52,845 INFO L225 Difference]: With dead ends: 4946 [2022-03-15 21:56:52,845 INFO L226 Difference]: Without dead ends: 4900 [2022-03-15 21:56:52,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24148 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=10158, Invalid=56664, Unknown=0, NotChecked=0, Total=66822 [2022-03-15 21:56:52,847 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 830 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 3340 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 3340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:52,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [830 Valid, 0 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 3340 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:56:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2022-03-15 21:56:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 1721. [2022-03-15 21:56:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 4.214534883720931) internal successors, (7249), 1720 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 7249 transitions. [2022-03-15 21:56:52,894 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 7249 transitions. Word has length 17 [2022-03-15 21:56:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:52,894 INFO L470 AbstractCegarLoop]: Abstraction has 1721 states and 7249 transitions. [2022-03-15 21:56:52,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 7249 transitions. [2022-03-15 21:56:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:56:52,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:52,897 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:52,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 21:56:53,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:56:53,113 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:56:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -36335103, now seen corresponding path program 17 times [2022-03-15 21:56:53,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:53,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441258427] [2022-03-15 21:56:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:53,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:53,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441258427] [2022-03-15 21:56:53,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441258427] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:53,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249394536] [2022-03-15 21:56:53,313 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:56:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:53,314 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:56:53,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 21:56:53,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:56:53,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:53,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:56:53,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:53,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:53,544 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:53,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2022-03-15 21:56:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:53,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:53,559 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:53,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 66 [2022-03-15 21:56:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:53,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:53,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:53,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:54,026 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:54,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 99 treesize of output 188 [2022-03-15 21:56:54,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:54,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:54,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:54,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 67 treesize of output 156 [2022-03-15 21:57:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:01,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249394536] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:01,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:01,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-03-15 21:57:01,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632990800] [2022-03-15 21:57:01,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:01,252 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:01,259 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 21:57:01,259 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:04,724 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [94231#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 94254#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) (+ (select A i) res1 (select B i))) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (not (< (+ j 1) M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1)))) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N))), 94239#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 94248#(and (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (< j M) (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 94242#(and (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N)) (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N))), 94234#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 94250#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 94238#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 94247#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 94235#(and (or (not (< (+ j 1) M)) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) 1 (select B (+ j 1)))) (<= N k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) res1) (<= N k) (< (+ 2 j) M))), 94256#(and (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))))), 94251#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 94240#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 94249#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N))), 94243#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 94244#(and (or (<= N k) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (<= N k))), 94255#(and (or (< (+ 2 i) N) (< j M) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (<= N k)) (or (< j M) (<= N k) (<= (+ 2 i) N))), 94245#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 94253#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) res1) (<= N k) (< (+ 2 j) M) (< i N)) (or (not (< (+ j 1) M)) (< res1 (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) 1 (select B (+ j 1)))) (<= N k) (< (+ 2 j) M) (< i N))), 94237#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 94241#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 94233#(and (or (< j M) (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (< j M) (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 94257#(and (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1))) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (<= N k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= N k) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select B j) (select A k) (select B k) (select B (+ j 1)))) (< (+ 2 j) M))), 94232#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 94236#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 94252#(and (or (<= (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) res2)) (or (<= (+ i 4) N) (< j M) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (< j M) (= i 0)) (or (<= 3 N) (< j M)) (or (< j M) (= res1 0) (< 3 N))), 94246#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N)))] [2022-03-15 21:57:04,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:57:04,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:57:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=2077, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:57:04,725 INFO L87 Difference]: Start difference. First operand 1721 states and 7249 transitions. Second operand has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:23,143 INFO L93 Difference]: Finished difference Result 4420 states and 14944 transitions. [2022-03-15 21:57:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-03-15 21:57:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:57:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:23,151 INFO L225 Difference]: With dead ends: 4420 [2022-03-15 21:57:23,151 INFO L226 Difference]: Without dead ends: 4366 [2022-03-15 21:57:23,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11919 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=6069, Invalid=29841, Unknown=0, NotChecked=0, Total=35910 [2022-03-15 21:57:23,153 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 693 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:23,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 0 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:57:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2022-03-15 21:57:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 1758. [2022-03-15 21:57:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1757 states have (on average 4.212293682413204) internal successors, (7401), 1757 states have internal predecessors, (7401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 7401 transitions. [2022-03-15 21:57:23,229 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 7401 transitions. Word has length 17 [2022-03-15 21:57:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:23,229 INFO L470 AbstractCegarLoop]: Abstraction has 1758 states and 7401 transitions. [2022-03-15 21:57:23,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 7401 transitions. [2022-03-15 21:57:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:57:23,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:23,233 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:23,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:23,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 21:57:23,439 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -585972492, now seen corresponding path program 10 times [2022-03-15 21:57:23,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:23,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472137707] [2022-03-15 21:57:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:23,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:23,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472137707] [2022-03-15 21:57:23,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472137707] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:23,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118138348] [2022-03-15 21:57:23,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:57:23,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:23,499 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:23,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 21:57:23,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:57:23,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:23,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:57:23,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:23,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:23,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118138348] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:23,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:23,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-03-15 21:57:23,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569540637] [2022-03-15 21:57:23,626 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:23,627 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:23,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 21:57:23,635 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:25,235 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [102615#(or (< j M) (<= k (+ 2 i))), 102608#(or (<= N (+ i 1)) (< (+ 2 i) N)), 102603#(or (< j M) (<= N (+ 2 k)) (<= (+ k 4) N)), 102594#(or (< j M) (< i N)), 102609#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 102621#(or (<= (+ k 1) i) (<= N (+ 2 k))), 102624#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 102612#(or (<= N (+ k 1)) (< j M) (<= (+ k 1) i)), 102599#(or (<= N i) (< (+ i 1) N)), 102605#(or (<= k i) (<= N k)), 102622#(or (< j M) (<= (+ k 1) i) (<= N (+ 2 k))), 102623#(or (< (+ i 4) N) (<= N (+ 3 i))), 102614#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 102626#(and (or (< j M) (= (+ res2 (* (- 1) i)) 0)) (or (< j M) (<= k 0)) (or (< j M) (= res2 0))), 102598#(or (<= (+ 3 k) i) (<= N (+ 2 k))), 102590#(or (<= (+ k 1) N) (< j M)), 102625#(or (<= k (+ 3 i)) (< j M)), 102602#(or (<= N (+ k 1)) (<= (+ 2 k) i) (< j M)), 102587#(or (<= (+ 2 k) N) (<= N k)), 102618#(or (<= N (+ k 1)) (<= k i)), 102617#(or (< j M) (<= N k) (<= k (+ i 1))), 102591#(or (<= (+ 2 k) N) (< j M) (<= N k)), 102589#(< j M), 102600#(or (<= N i) (< (+ i 1) N) (< j M)), 102597#(or (<= N (+ 2 k)) (<= (+ k 4) N)), 102580#(or (<= k i) (< j M)), 102593#(< i N), 102604#(or (<= (+ 3 k) i) (< j M) (<= N (+ 2 k))), 102596#(or (<= N (+ k 1)) (<= (+ 2 k) i)), 102592#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 102610#(or (< j M) (<= k (+ i 1))), 102616#(or (<= N k) (<= k (+ i 1))), 102606#(or (<= N (+ k 1)) (<= (+ k 1) i)), 102601#(or (< j M) (<= (+ k 1) i) (<= N k)), 102611#(or (<= k i) (< j M) (<= N k)), 102620#(or (<= (+ 2 k) i) (< j M) (<= N (+ 2 k))), 102607#(or (<= (+ 2 k) i) (<= N (+ 2 k))), 102588#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 102619#(or (<= N (+ k 1)) (<= k i) (< j M)), 102595#(or (<= (+ k 1) i) (<= N k)), 102613#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 21:57:25,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 21:57:25,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 21:57:25,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2290, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:57:25,236 INFO L87 Difference]: Start difference. First operand 1758 states and 7401 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:31,809 INFO L93 Difference]: Finished difference Result 2946 states and 11158 transitions. [2022-03-15 21:57:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-03-15 21:57:31,809 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:57:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:31,815 INFO L225 Difference]: With dead ends: 2946 [2022-03-15 21:57:31,815 INFO L226 Difference]: Without dead ends: 2946 [2022-03-15 21:57:31,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9536 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5592, Invalid=27350, Unknown=0, NotChecked=0, Total=32942 [2022-03-15 21:57:31,818 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 978 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:31,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 0 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:57:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2022-03-15 21:57:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1898. [2022-03-15 21:57:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 4.204533473906167) internal successors, (7976), 1897 states have internal predecessors, (7976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7976 transitions. [2022-03-15 21:57:31,861 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7976 transitions. Word has length 18 [2022-03-15 21:57:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:31,861 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 7976 transitions. [2022-03-15 21:57:31,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7976 transitions. [2022-03-15 21:57:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:57:31,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:31,865 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:31,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:32,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:32,081 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1961320056, now seen corresponding path program 11 times [2022-03-15 21:57:32,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:32,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257117843] [2022-03-15 21:57:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:32,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:32,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257117843] [2022-03-15 21:57:32,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257117843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:32,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55352657] [2022-03-15 21:57:32,168 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:57:32,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:32,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:32,169 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:32,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 21:57:32,194 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:57:32,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:32,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:57:32,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:32,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:32,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55352657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:32,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:32,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 18 [2022-03-15 21:57:32,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473725362] [2022-03-15 21:57:32,331 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:32,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:32,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 21:57:32,341 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:33,109 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [109767#(or (<= (+ i 4) N) (<= N i)), 109753#(<= N (+ k 1)), 109769#(or (<= N i) (<= (+ 2 i) k)), 109763#(or (< i N) (<= N (+ 3 k))), 109764#(or (<= (+ 2 i) N) (<= N (+ 3 k))), 109760#(or (<= N i) (<= (+ 2 i) N)), 109766#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 109759#(or (<= N (+ k 1)) (<= (+ 2 i) N)), 109770#(or (<= (+ i 1) k) (<= N i)), 109765#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 109758#(or (<= N k) (<= (+ 2 i) N)), 109761#(or (<= N (+ 2 k)) (< i N)), 109768#(or (<= N i) (<= (+ 3 i) k)), 109757#(or (<= N (+ k 1)) (< i N)), 109756#(or (<= N k) (< i N)), 109755#(<= N (+ 3 k)), 109754#(<= N (+ 2 k)), 109752#(<= N k), 109762#(or (<= N (+ 2 k)) (<= (+ 2 i) N))] [2022-03-15 21:57:33,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:57:33,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:57:33,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:57:33,110 INFO L87 Difference]: Start difference. First operand 1898 states and 7976 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 29 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:33,916 INFO L93 Difference]: Finished difference Result 4115 states and 16683 transitions. [2022-03-15 21:57:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:57:33,916 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 29 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:57:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:33,925 INFO L225 Difference]: With dead ends: 4115 [2022-03-15 21:57:33,925 INFO L226 Difference]: Without dead ends: 4081 [2022-03-15 21:57:33,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1318, Invalid=3794, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:57:33,926 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:33,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:57:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2022-03-15 21:57:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 2517. [2022-03-15 21:57:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2516 states have (on average 4.3127980922098565) internal successors, (10851), 2516 states have internal predecessors, (10851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 10851 transitions. [2022-03-15 21:57:33,974 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 10851 transitions. Word has length 18 [2022-03-15 21:57:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:33,974 INFO L470 AbstractCegarLoop]: Abstraction has 2517 states and 10851 transitions. [2022-03-15 21:57:33,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 29 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 10851 transitions. [2022-03-15 21:57:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:57:33,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:33,979 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:33,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:34,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:34,187 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash 191469120, now seen corresponding path program 18 times [2022-03-15 21:57:34,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:34,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856697783] [2022-03-15 21:57:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:34,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:34,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856697783] [2022-03-15 21:57:34,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856697783] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:34,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798480327] [2022-03-15 21:57:34,268 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:57:34,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:34,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:34,269 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:34,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 21:57:34,293 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:57:34,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:34,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:57:34,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:34,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:34,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798480327] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:34,441 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:34,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-15 21:57:34,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615012035] [2022-03-15 21:57:34,441 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:34,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:34,448 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 21:57:34,448 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:35,571 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [119118#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 119120#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 119108#(< j M), 119117#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 119115#(or (<= N i) (< (+ i 1) N) (< j M)), 119109#(or (< (+ j 1) M) (<= M j)), 119129#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 119130#(or (< (+ j 1) M) (<= N (+ 2 k)) (< i N) (<= M j)), 119110#(or (< (+ j 1) M) (<= N k) (<= M j)), 119121#(or (< (+ j 1) M) (< i N) (<= M j)), 119124#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 119112#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 119111#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 119116#(or (< j M) (<= (+ 2 i) N)), 119128#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 119134#(or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 119135#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= M j)), 119131#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 119133#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (<= M j)), 119119#(or (<= (+ 3 i) N) (< j M)), 119113#(or (< j M) (< i N)), 119126#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 119125#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 119136#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 119132#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 119122#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 119114#(or (<= N i) (<= (+ 2 i) N)), 119123#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 119127#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j))] [2022-03-15 21:57:35,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:57:35,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:57:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1744, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:57:35,572 INFO L87 Difference]: Start difference. First operand 2517 states and 10851 transitions. Second operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:39,411 INFO L93 Difference]: Finished difference Result 7821 states and 32279 transitions. [2022-03-15 21:57:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 21:57:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:57:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:39,429 INFO L225 Difference]: With dead ends: 7821 [2022-03-15 21:57:39,430 INFO L226 Difference]: Without dead ends: 7821 [2022-03-15 21:57:39,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11156 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=8285, Invalid=27625, Unknown=0, NotChecked=0, Total=35910 [2022-03-15 21:57:39,432 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 327 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:39,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 0 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:57:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7821 states. [2022-03-15 21:57:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7821 to 3722. [2022-03-15 21:57:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3721 states have (on average 4.628056973931739) internal successors, (17221), 3721 states have internal predecessors, (17221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 17221 transitions. [2022-03-15 21:57:39,539 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 17221 transitions. Word has length 18 [2022-03-15 21:57:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:39,539 INFO L470 AbstractCegarLoop]: Abstraction has 3722 states and 17221 transitions. [2022-03-15 21:57:39,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 17221 transitions. [2022-03-15 21:57:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:57:39,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:39,547 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:39,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:39,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:39,767 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1349007834, now seen corresponding path program 19 times [2022-03-15 21:57:39,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:39,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395252448] [2022-03-15 21:57:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:39,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:39,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395252448] [2022-03-15 21:57:39,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395252448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:39,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859083690] [2022-03-15 21:57:39,822 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:57:39,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:39,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:39,823 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:39,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 21:57:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:39,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:57:39,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:39,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:39,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859083690] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:39,977 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:39,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 21:57:39,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963742105] [2022-03-15 21:57:39,978 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:39,979 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:40,006 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 132 transitions. [2022-03-15 21:57:40,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:41,013 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [134817#(or (< (+ j 1) M) (<= N k) (<= M j)), 134836#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 134821#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 134809#(or (< j M) (<= N k)), 134810#(or (< j M) (< i N)), 134812#(or (<= N k) (<= (+ 2 i) N)), 134828#(or (<= (+ 3 i) N) (<= N k)), 134824#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 134833#(or (<= (+ i 4) N) (< j M)), 134827#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= M j)), 134816#(or (< j M) (<= N k) (<= (+ 2 i) N)), 134807#(or (<= N k) (< i N)), 134823#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 134813#(or (<= N i) (<= (+ 2 i) N)), 134829#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 134808#(< j M), 134820#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 134815#(or (< j M) (<= (+ 2 i) N)), 134825#(or (< (+ j 1) M) (<= N (+ 2 k)) (< i N) (<= M j)), 134830#(or (<= (+ 3 i) N) (< j M)), 134831#(or (<= (+ 3 i) N) (< j M) (<= N k)), 134834#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (<= M j)), 134806#(<= N k), 134814#(or (<= N i) (< (+ i 1) N) (< j M)), 134818#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 134822#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 134835#(or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 134832#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 134811#(or (< j M) (<= N k) (< i N)), 134819#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 134826#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j))] [2022-03-15 21:57:41,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:57:41,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:57:41,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1744, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:57:41,014 INFO L87 Difference]: Start difference. First operand 3722 states and 17221 transitions. Second operand has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 40 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:43,997 INFO L93 Difference]: Finished difference Result 8626 states and 36928 transitions. [2022-03-15 21:57:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-15 21:57:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 40 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:57:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:44,025 INFO L225 Difference]: With dead ends: 8626 [2022-03-15 21:57:44,025 INFO L226 Difference]: Without dead ends: 8576 [2022-03-15 21:57:44,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7323 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5935, Invalid=19505, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 21:57:44,027 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:44,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:57:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2022-03-15 21:57:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 3671. [2022-03-15 21:57:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3670 states have (on average 4.585013623978202) internal successors, (16827), 3670 states have internal predecessors, (16827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 16827 transitions. [2022-03-15 21:57:44,133 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 16827 transitions. Word has length 18 [2022-03-15 21:57:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:44,133 INFO L470 AbstractCegarLoop]: Abstraction has 3671 states and 16827 transitions. [2022-03-15 21:57:44,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 40 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 16827 transitions. [2022-03-15 21:57:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:57:44,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:44,141 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:44,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:44,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 21:57:44,355 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash 562953814, now seen corresponding path program 20 times [2022-03-15 21:57:44,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:44,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316388558] [2022-03-15 21:57:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:44,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:44,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316388558] [2022-03-15 21:57:44,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316388558] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:44,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316644246] [2022-03-15 21:57:44,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:57:44,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:44,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:44,408 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:44,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 21:57:44,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:57:44,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:44,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:57:44,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:44,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:44,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316644246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:44,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:44,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-03-15 21:57:44,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373158021] [2022-03-15 21:57:44,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:44,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:44,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 140 transitions. [2022-03-15 21:57:44,580 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:45,762 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [151153#(or (< (+ j 1) M) (<= M j)), 151166#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 151160#(or (<= N i) (< (+ i 1) N)), 151156#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 151183#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 151169#(or (< j M) (<= k (+ i 1))), 151184#(or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= M j)), 151177#(or (< (+ j 1) M) (<= k i) (<= N k) (<= M j)), 151159#(or (< j M) (< i N)), 151180#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 151152#(< j M), 151178#(or (< (+ j 1) M) (<= N k) (<= k (+ i 1)) (<= M j)), 151179#(or (<= N (+ k 1)) (<= (+ 2 k) i) (< (+ j 1) M) (<= M j)), 151175#(or (< (+ j 1) M) (<= k (+ 2 i)) (<= M j)), 151158#(< i N), 151168#(or (< (+ j 1) M) (<= k i) (<= M j)), 151171#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 151167#(or (<= k i) (< j M)), 151170#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 151161#(or (<= N i) (< (+ i 1) N) (< j M)), 151162#(or (< (+ j 1) M) (< i N) (<= M j)), 151165#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 151181#(or (<= N (+ k 1)) (< (+ j 1) M) (<= k i) (<= M j)), 151155#(or (< (+ j 1) M) (< k N) (<= M j)), 151164#(or (<= N (+ i 1)) (< (+ 2 i) N)), 151163#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 151176#(or (< (+ j 1) M) (<= (+ k 1) i) (<= N k) (<= M j)), 151182#(or (< (+ i 4) N) (<= N (+ 3 i))), 151172#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 151173#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 151174#(or (< j M) (<= k (+ 2 i))), 151154#(or (<= (+ k 1) N) (< j M)), 151157#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j))] [2022-03-15 21:57:45,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:57:45,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:45,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:57:45,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2377, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:57:45,763 INFO L87 Difference]: Start difference. First operand 3671 states and 16827 transitions. Second operand has 44 states, 44 states have (on average 2.590909090909091) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:58:19,879 INFO L93 Difference]: Finished difference Result 14150 states and 54740 transitions. [2022-03-15 21:58:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 640 states. [2022-03-15 21:58:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.590909090909091) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:58:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:58:19,916 INFO L225 Difference]: With dead ends: 14150 [2022-03-15 21:58:19,916 INFO L226 Difference]: Without dead ends: 14138 [2022-03-15 21:58:19,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203272 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=46410, Invalid=408540, Unknown=0, NotChecked=0, Total=454950 [2022-03-15 21:58:19,935 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1886 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 1369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1369 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:58:19,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1886 Valid, 0 Invalid, 4771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1369 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:58:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14138 states. [2022-03-15 21:58:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14138 to 5876. [2022-03-15 21:58:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5875 states have (on average 4.721702127659574) internal successors, (27740), 5875 states have internal predecessors, (27740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 27740 transitions. [2022-03-15 21:58:20,185 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 27740 transitions. Word has length 18 [2022-03-15 21:58:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:58:20,185 INFO L470 AbstractCegarLoop]: Abstraction has 5876 states and 27740 transitions. [2022-03-15 21:58:20,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.590909090909091) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 27740 transitions. [2022-03-15 21:58:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:58:20,198 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:58:20,198 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:58:20,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 21:58:20,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:20,399 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:58:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:58:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash 565597204, now seen corresponding path program 21 times [2022-03-15 21:58:20,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:58:20,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764489907] [2022-03-15 21:58:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:58:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:58:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:20,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:58:20,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764489907] [2022-03-15 21:58:20,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764489907] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:58:20,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257418047] [2022-03-15 21:58:20,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:58:20,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:20,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:58:20,453 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:58:20,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 21:58:20,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:58:20,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:58:20,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:58:20,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:58:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:20,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:20,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257418047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:20,627 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:20,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-03-15 21:58:20,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176994665] [2022-03-15 21:58:20,627 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:20,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:20,634 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 147 transitions. [2022-03-15 21:58:20,634 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:21,833 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [178479#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 178467#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 178466#(or (<= (+ i 4) N) (<= N i)), 178480#(or (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 178474#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 178457#(or (< j M) (< i N)), 178454#(< j M), 178478#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 178483#(or (<= N (+ k 1)) (<= (+ M i 1) (+ N j))), 178482#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 178484#(or (<= N i) (<= (+ 3 M i) (+ N j))), 178459#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 178460#(or (<= N i) (<= (+ 2 i) N)), 178468#(or (<= N i) (< (+ i 1) N) (< j M)), 178469#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 178472#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 178471#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 178476#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 178462#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1))), 178455#(or (< (+ j 1) M) (<= M j)), 178465#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 178473#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 178461#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 178475#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 178463#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 178470#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 178458#(or (< (+ j 1) M) (< i N) (<= M j)), 178477#(or (< j M) (<= (+ 2 i) N)), 178481#(or (<= N k) (<= (+ M i 1) (+ N j))), 178464#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 178456#(or (< (+ 2 j) M) (<= M (+ j 1)))] [2022-03-15 21:58:21,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:58:21,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:58:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:58:21,834 INFO L87 Difference]: Start difference. First operand 5876 states and 27740 transitions. Second operand has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:58:25,015 INFO L93 Difference]: Finished difference Result 12933 states and 58429 transitions. [2022-03-15 21:58:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 21:58:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:58:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:58:25,053 INFO L225 Difference]: With dead ends: 12933 [2022-03-15 21:58:25,054 INFO L226 Difference]: Without dead ends: 12933 [2022-03-15 21:58:25,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6531 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4134, Invalid=17328, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 21:58:25,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:58:25,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:58:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12933 states. [2022-03-15 21:58:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12933 to 7382. [2022-03-15 21:58:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7382 states, 7381 states have (on average 4.795827123695976) internal successors, (35398), 7381 states have internal predecessors, (35398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7382 states to 7382 states and 35398 transitions. [2022-03-15 21:58:25,254 INFO L78 Accepts]: Start accepts. Automaton has 7382 states and 35398 transitions. Word has length 18 [2022-03-15 21:58:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:58:25,254 INFO L470 AbstractCegarLoop]: Abstraction has 7382 states and 35398 transitions. [2022-03-15 21:58:25,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.682926829268293) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7382 states and 35398 transitions. [2022-03-15 21:58:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:58:25,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:58:25,271 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:58:25,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 21:58:25,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:25,472 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:58:25,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:58:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1379985280, now seen corresponding path program 22 times [2022-03-15 21:58:25,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:58:25,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553193471] [2022-03-15 21:58:25,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:58:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:58:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:25,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:58:25,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553193471] [2022-03-15 21:58:25,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553193471] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:58:25,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210065102] [2022-03-15 21:58:25,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:58:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:58:25,525 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:58:25,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 21:58:25,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:58:25,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:58:25,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:58:25,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:58:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:25,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:58:25,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210065102] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:25,649 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:25,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 21:58:25,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556198873] [2022-03-15 21:58:25,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:25,651 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:25,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 151 transitions. [2022-03-15 21:58:25,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:26,752 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [206521#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 206503#(or (<= N i) (<= (+ 2 i) N)), 206516#(or (<= (+ 3 i) N) (< j M)), 206512#(or (< (+ j 1) M) (<= N (+ 2 k)) (< i N) (<= M j)), 206523#(or (<= (+ i 4) N) (<= N i)), 206513#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= M j)), 206492#(<= N (+ k 1)), 206522#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 206493#(< j M), 206524#(or (<= N i) (<= (+ 3 i) k)), 206496#(or (<= N k) (< i N)), 206514#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 206495#(or (<= N (+ k 1)) (< j M)), 206509#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 206498#(or (< j M) (< i N)), 206511#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 206505#(or (< j M) (<= (+ 2 i) N)), 206501#(or (<= N k) (<= (+ 2 i) N)), 206525#(or (<= (+ i 4) N) (<= N i) (< j M)), 206510#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 206500#(or (<= N (+ k 1)) (< j M) (< i N)), 206499#(or (< j M) (<= N k) (< i N)), 206504#(or (<= N i) (< (+ i 1) N) (< j M)), 206506#(or (< j M) (<= N k) (<= (+ 2 i) N)), 206508#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 206507#(or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N)), 206491#(<= N k), 206497#(or (<= N (+ k 1)) (< i N)), 206517#(or (< j M) (<= (+ 2 i) k)), 206515#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 206519#(or (< (+ j 1) M) (<= (+ i 1) k) (<= M j)), 206520#(or (< (+ j 1) M) (<= N k) (<= i k) (<= M j)), 206494#(or (< j M) (<= N k)), 206502#(or (<= N (+ k 1)) (<= (+ 2 i) N)), 206518#(or (<= (+ i 1) k) (< j M)), 206526#(or (<= N i) (< j M) (<= (+ 3 i) k))] [2022-03-15 21:58:26,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:58:26,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:58:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1988, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:58:26,753 INFO L87 Difference]: Start difference. First operand 7382 states and 35398 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 44 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:58:31,158 INFO L93 Difference]: Finished difference Result 21817 states and 101261 transitions. [2022-03-15 21:58:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-15 21:58:31,158 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 44 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:58:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:58:31,223 INFO L225 Difference]: With dead ends: 21817 [2022-03-15 21:58:31,223 INFO L226 Difference]: Without dead ends: 21784 [2022-03-15 21:58:31,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7658, Invalid=28252, Unknown=0, NotChecked=0, Total=35910 [2022-03-15 21:58:31,226 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 441 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:58:31,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 0 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:58:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21784 states. [2022-03-15 21:58:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21784 to 9689. [2022-03-15 21:58:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9689 states, 9688 states have (on average 4.905759702725021) internal successors, (47527), 9688 states have internal predecessors, (47527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9689 states to 9689 states and 47527 transitions. [2022-03-15 21:58:31,550 INFO L78 Accepts]: Start accepts. Automaton has 9689 states and 47527 transitions. Word has length 18 [2022-03-15 21:58:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:58:31,550 INFO L470 AbstractCegarLoop]: Abstraction has 9689 states and 47527 transitions. [2022-03-15 21:58:31,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 44 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:58:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 9689 states and 47527 transitions. [2022-03-15 21:58:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:58:31,571 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:58:31,571 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:58:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 21:58:31,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 21:58:31,772 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:58:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:58:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 812770692, now seen corresponding path program 23 times [2022-03-15 21:58:31,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:58:31,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586130208] [2022-03-15 21:58:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:58:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:58:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:58:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:58:31,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:58:31,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586130208] [2022-03-15 21:58:31,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586130208] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:58:31,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585906072] [2022-03-15 21:58:31,821 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:58:31,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:58:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:58:31,822 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:58:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 21:58:31,847 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:58:31,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:58:31,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:58:31,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:58:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:58:31,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:58:31,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585906072] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:31,969 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:31,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 21:58:31,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47233132] [2022-03-15 21:58:31,970 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:31,971 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:31,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 142 transitions. [2022-03-15 21:58:31,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:33,108 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [248135#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ j 1) M) (<= M j)), 248144#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 248152#(or (<= k (+ 3 i)) (<= N (+ 2 i)) (< j M)), 248139#(or (<= N i) (< j M) (<= k (+ i 1))), 248150#(or (< (+ j 1) M) (<= k i) (<= N k) (<= M j)), 248142#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 248137#(or (<= N (+ i 1)) (<= k (+ 2 i))), 248125#(or (<= (+ 2 k) N) (< j M) (<= N k)), 248145#(or (< (+ j 1) M) (<= k i) (<= M j)), 248122#(or (<= (+ 2 k) N) (<= N k)), 248124#(or (<= (+ k 1) N) (< j M)), 248138#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 248129#(or (<= N i) (< (+ i 1) N) (< j M)), 248131#(or (< j M) (<= (+ k 1) i)), 248133#(or (<= N (+ i 1)) (< (+ 2 i) N)), 248141#(or (<= (+ 2 k) i) (< (+ j 1) M) (<= N k) (<= M j)), 248130#(or (<= k i) (< j M)), 248149#(or (< (+ j 1) M) (<= (+ k 1) i) (<= N k) (<= M j)), 248127#(or (< j M) (< i N)), 248140#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 248126#(< i N), 248143#(or (< (+ i 4) N) (<= N (+ 3 i))), 248123#(< j M), 248151#(or (<= k (+ 3 i)) (<= N (+ 2 i))), 248146#(or (<= N (+ i 1)) (< j M) (<= k (+ 2 i))), 248128#(or (<= N i) (< (+ i 1) N)), 248134#(or (<= N i) (<= k (+ i 1))), 248148#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 248147#(or (< j M) (<= k (+ i 1))), 248132#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= N k) (<= M j)), 248136#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 21:58:33,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:58:33,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:58:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1897, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:58:33,109 INFO L87 Difference]: Start difference. First operand 9689 states and 47527 transitions. Second operand has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:59:06,025 INFO L93 Difference]: Finished difference Result 22132 states and 91340 transitions. [2022-03-15 21:59:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 694 states. [2022-03-15 21:59:06,025 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:59:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:59:06,086 INFO L225 Difference]: With dead ends: 22132 [2022-03-15 21:59:06,086 INFO L226 Difference]: Without dead ends: 22130 [2022-03-15 21:59:06,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235545 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=51391, Invalid=463415, Unknown=0, NotChecked=0, Total=514806 [2022-03-15 21:59:06,107 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2272 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 1470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1470 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:59:06,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2272 Valid, 0 Invalid, 4840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1470 Valid, 3370 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:59:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22130 states. [2022-03-15 21:59:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22130 to 11079. [2022-03-15 21:59:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11079 states, 11078 states have (on average 4.963621592345189) internal successors, (54987), 11078 states have internal predecessors, (54987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11079 states to 11079 states and 54987 transitions. [2022-03-15 21:59:06,657 INFO L78 Accepts]: Start accepts. Automaton has 11079 states and 54987 transitions. Word has length 18 [2022-03-15 21:59:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:59:06,657 INFO L470 AbstractCegarLoop]: Abstraction has 11079 states and 54987 transitions. [2022-03-15 21:59:06,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11079 states and 54987 transitions. [2022-03-15 21:59:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:59:06,684 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:59:06,684 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:59:06,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 21:59:06,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 21:59:06,885 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:59:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:59:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1567244840, now seen corresponding path program 24 times [2022-03-15 21:59:06,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:59:06,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962619343] [2022-03-15 21:59:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:59:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:59:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:06,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:59:06,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962619343] [2022-03-15 21:59:06,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962619343] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:59:06,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091016857] [2022-03-15 21:59:06,936 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:59:06,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:06,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:59:06,937 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:59:06,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 21:59:06,963 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:59:06,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:59:06,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:59:06,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:59:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:07,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:59:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:07,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091016857] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:59:07,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:59:07,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-15 21:59:07,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1608020617] [2022-03-15 21:59:07,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:59:07,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:59:07,112 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 21:59:07,112 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:08,078 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [293928#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 293918#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 293910#(or (< j M) (< i N)), 293924#(or (<= N i) (<= (+ 3 M i) (+ N j))), 293917#(or (<= N i) (< (+ i 1) N) (< j M)), 293919#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 293925#(or (<= N i) (<= (+ 2 M i) (+ k j))), 293916#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 293909#(or (< (+ j 1) M) (<= M j)), 293920#(or (<= (+ i 4) N) (<= N i)), 293915#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 293930#(or (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 293932#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 293922#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 293923#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 293913#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 293927#(or (< j M) (<= (+ 2 i) N)), 293911#(or (< (+ j 1) M) (< i N) (<= M j)), 293912#(or (< (+ j 1) M) (<= N k) (<= M j)), 293906#(or (<= N i) (<= (+ 2 i) N)), 293908#(< j M), 293933#(or (<= N k) (<= (+ M i) (+ k j 1))), 293907#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 293921#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 293929#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 293926#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 293931#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 293914#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1)))] [2022-03-15 21:59:08,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:59:08,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:59:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:59:08,079 INFO L87 Difference]: Start difference. First operand 11079 states and 54987 transitions. Second operand has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:59:14,967 INFO L93 Difference]: Finished difference Result 30305 states and 139017 transitions. [2022-03-15 21:59:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2022-03-15 21:59:14,967 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:59:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:59:15,086 INFO L225 Difference]: With dead ends: 30305 [2022-03-15 21:59:15,086 INFO L226 Difference]: Without dead ends: 30305 [2022-03-15 21:59:15,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22512 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11922, Invalid=48348, Unknown=0, NotChecked=0, Total=60270 [2022-03-15 21:59:15,089 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:59:15,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:59:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30305 states. [2022-03-15 21:59:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30305 to 14025. [2022-03-15 21:59:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14025 states, 14024 states have (on average 5.080647461494581) internal successors, (71251), 14024 states have internal predecessors, (71251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14025 states to 14025 states and 71251 transitions. [2022-03-15 21:59:15,675 INFO L78 Accepts]: Start accepts. Automaton has 14025 states and 71251 transitions. Word has length 18 [2022-03-15 21:59:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:59:15,675 INFO L470 AbstractCegarLoop]: Abstraction has 14025 states and 71251 transitions. [2022-03-15 21:59:15,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 14025 states and 71251 transitions. [2022-03-15 21:59:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:59:15,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:59:15,709 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:59:15,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 21:59:15,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 21:59:15,910 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:59:15,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:59:15,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2084094210, now seen corresponding path program 25 times [2022-03-15 21:59:15,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:59:15,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644256439] [2022-03-15 21:59:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:59:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:59:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:15,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:59:15,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644256439] [2022-03-15 21:59:15,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644256439] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:59:15,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255699205] [2022-03-15 21:59:15,960 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:59:15,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:59:15,962 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:59:15,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 21:59:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:15,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:59:15,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:59:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:16,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:59:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:16,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255699205] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:59:16,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:59:16,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-03-15 21:59:16,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022953298] [2022-03-15 21:59:16,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:59:16,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:59:16,118 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 132 transitions. [2022-03-15 21:59:16,118 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:17,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [352807#(<= N k), 352816#(or (< j M) (<= N k) (< i N)), 352835#(or (<= (+ i 4) N) (<= N i) (< j M)), 352826#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 352828#(or (<= N k) (<= (+ M i) (+ k j 1))), 352834#(or (<= (+ 3 i) N) (< j M)), 352831#(or (<= N i) (<= (+ 3 i) k)), 352833#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 352815#(or (< j M) (< i N)), 352813#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 352818#(or (<= N i) (< (+ i 1) N) (< j M)), 352829#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 352823#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 352832#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 352814#(or (<= N k) (< i N)), 352810#(or (< (+ j 1) M) (<= N k) (<= M j)), 352809#(or (< j M) (<= N k)), 352819#(or (< j M) (<= (+ 2 i) N)), 352824#(or (<= N k) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 352830#(or (<= (+ i 4) N) (<= N i)), 352836#(or (<= N i) (<= (+ 2 M i) (+ k j))), 352825#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 352820#(or (<= N k) (<= (+ 2 i) N)), 352812#(or (<= N i) (<= (+ 2 i) N)), 352822#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 352821#(or (< j M) (<= N k) (<= (+ 2 i) N)), 352817#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 352808#(< j M), 352811#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1))), 352827#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1)))] [2022-03-15 21:59:17,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:59:17,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:59:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:59:17,023 INFO L87 Difference]: Start difference. First operand 14025 states and 71251 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:59:21,684 INFO L93 Difference]: Finished difference Result 25808 states and 118813 transitions. [2022-03-15 21:59:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 21:59:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:59:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:59:21,868 INFO L225 Difference]: With dead ends: 25808 [2022-03-15 21:59:21,869 INFO L226 Difference]: Without dead ends: 25752 [2022-03-15 21:59:21,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11912 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7675, Invalid=27857, Unknown=0, NotChecked=0, Total=35532 [2022-03-15 21:59:21,870 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 427 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:59:21,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 0 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:59:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25752 states. [2022-03-15 21:59:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25752 to 11614. [2022-03-15 21:59:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11614 states, 11613 states have (on average 4.977008524928959) internal successors, (57798), 11613 states have internal predecessors, (57798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11614 states to 11614 states and 57798 transitions. [2022-03-15 21:59:22,277 INFO L78 Accepts]: Start accepts. Automaton has 11614 states and 57798 transitions. Word has length 18 [2022-03-15 21:59:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:59:22,277 INFO L470 AbstractCegarLoop]: Abstraction has 11614 states and 57798 transitions. [2022-03-15 21:59:22,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:59:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11614 states and 57798 transitions. [2022-03-15 21:59:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:59:22,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:59:22,302 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:59:22,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 21:59:22,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 21:59:22,503 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:59:22,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:59:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash -723977470, now seen corresponding path program 26 times [2022-03-15 21:59:22,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:59:22,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569170037] [2022-03-15 21:59:22,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:59:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:59:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:59:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:22,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:59:22,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569170037] [2022-03-15 21:59:22,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569170037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:59:22,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131092761] [2022-03-15 21:59:22,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:59:22,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:59:22,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:59:22,566 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:59:22,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 21:59:22,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:59:22,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:59:22,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:59:22,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:59:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:22,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:59:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:59:22,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131092761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:59:22,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:59:22,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-15 21:59:22,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1688150806] [2022-03-15 21:59:22,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:59:22,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:59:22,741 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 160 transitions. [2022-03-15 21:59:22,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:59:24,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [402318#(or (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 j) M) (<= M (+ j 1))), 402285#(or (<= (+ k 1) N) (< j M)), 402292#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 402299#(or (<= (+ k 1) i) (<= N k) (< (+ 2 j) M) (<= M (+ j 1))), 402288#(or (< k N) (< (+ 2 j) M) (<= M (+ j 1))), 402308#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 402304#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 402295#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 402312#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 402305#(or (< (+ 2 j) M) (<= k (+ i 1)) (<= M (+ j 1))), 402306#(or (<= k i) (<= N k) (< (+ 2 j) M) (<= M (+ j 1))), 402313#(or (<= N i) (<= (+ k j) (+ 3 M i))), 402284#(or (< (+ j 1) M) (<= M j)), 402310#(or (<= k (+ 3 i)) (<= N i)), 402317#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 402300#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 402296#(or (< (+ j 1) M) (<= k i) (<= M j)), 402290#(or (< j M) (< i N)), 402297#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 402298#(or (<= k i) (< (+ 2 j) M) (<= M (+ j 1))), 402293#(or (<= N i) (< (+ i 1) N) (< j M)), 402294#(or (<= k i) (< j M)), 402316#(or (<= (+ k j) (+ 2 M i)) (<= N i)), 402302#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 402307#(or (<= N k) (<= (+ k j 1) (+ M i))), 402301#(or (< j M) (<= k (+ i 1))), 402283#(< j M), 402286#(or (< (+ j 1) M) (< k N) (<= M j)), 402291#(or (< (+ j 1) M) (< i N) (<= M j)), 402281#(or (<= N i) (< (+ i 1) N)), 402314#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 402315#(or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= M j)), 402280#(< i N), 402311#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 402287#(or (< (+ 2 j) M) (<= M (+ j 1))), 402282#(or (<= N (+ i 1)) (< (+ 2 i) N)), 402289#(or (<= N k) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 402303#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 402309#(or (< (+ i 4) N) (<= N (+ 3 i)))] [2022-03-15 21:59:24,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 21:59:24,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:59:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 21:59:24,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3019, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:59:24,304 INFO L87 Difference]: Start difference. First operand 11614 states and 57798 transitions. Second operand has 50 states, 50 states have (on average 2.64) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:38,476 INFO L93 Difference]: Finished difference Result 29847 states and 126781 transitions. [2022-03-15 22:00:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1094 states. [2022-03-15 22:00:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.64) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:00:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:38,603 INFO L225 Difference]: With dead ends: 29847 [2022-03-15 22:00:38,603 INFO L226 Difference]: Without dead ends: 29826 [2022-03-15 22:00:38,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 1139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605929 ImplicationChecksByTransitivity, 69.2s TimeCoverageRelationStatistics Valid=122919, Invalid=1177821, Unknown=0, NotChecked=0, Total=1300740 [2022-03-15 22:00:38,663 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4707 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 4774 mSolverCounterSat, 4041 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4707 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4041 IncrementalHoareTripleChecker+Valid, 4774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:38,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4707 Valid, 0 Invalid, 8815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4041 Valid, 4774 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 22:00:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29826 states. [2022-03-15 22:00:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29826 to 14511. [2022-03-15 22:00:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14511 states, 14510 states have (on average 5.092005513439007) internal successors, (73885), 14510 states have internal predecessors, (73885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14511 states to 14511 states and 73885 transitions. [2022-03-15 22:00:39,366 INFO L78 Accepts]: Start accepts. Automaton has 14511 states and 73885 transitions. Word has length 18 [2022-03-15 22:00:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:39,367 INFO L470 AbstractCegarLoop]: Abstraction has 14511 states and 73885 transitions. [2022-03-15 22:00:39,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.64) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14511 states and 73885 transitions. [2022-03-15 22:00:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:00:39,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:39,403 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:39,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 22:00:39,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 22:00:39,606 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:00:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1068615400, now seen corresponding path program 27 times [2022-03-15 22:00:39,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:39,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104981811] [2022-03-15 22:00:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:39,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:39,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104981811] [2022-03-15 22:00:39,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104981811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:39,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903694381] [2022-03-15 22:00:39,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:00:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:39,644 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:00:39,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 22:00:39,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:00:39,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:00:39,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:00:39,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:00:39,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:00:39,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903694381] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:39,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:39,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 15 [2022-03-15 22:00:39,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375193794] [2022-03-15 22:00:39,813 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:39,814 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:39,821 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 158 transitions. [2022-03-15 22:00:39,821 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:40,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [463472#(< j M), 463489#(or (<= N (+ i 1)) (< (+ 2 i) N)), 463478#(or (<= M (+ 3 j)) (< (+ j 4) M)), 463480#(or (< (+ j 1) M) (< i N) (<= M j)), 463473#(or (< (+ j 1) M) (<= M j)), 463500#(or (<= N (+ i 1)) (<= (+ 3 M i) (+ N j))), 463495#(or (<= N i) (<= (+ 3 M i) (+ N j))), 463494#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ 3 j)) (< (+ j 4) M)), 463474#(or (< (+ 2 j) M) (<= M (+ j 1))), 463487#(or (<= M (+ 3 j)) (< (+ j 4) M) (< i N)), 463485#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 463479#(or (< j M) (< i N)), 463476#(or (<= (+ i 4) N) (<= N i)), 463493#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 463501#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 463483#(or (<= N i) (< (+ i 1) N) (< j M)), 463486#(or (<= N i) (< (+ i 1) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 463492#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 463477#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 463484#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 463392#(< i N), 463498#(or (<= N (+ i 1)) (<= (+ 5 i) N)), 463490#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 463481#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 463475#(or (<= N i) (< (+ i 1) N)), 463496#(or (<= N i) (<= (+ 2 M i) (+ N j))), 463491#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 463499#(or (<= N (+ i 1)) (<= (+ M i 4) (+ N j))), 463497#(or (<= N i) (<= (+ M i 1) (+ N j))), 463482#(or (<= M (+ 2 j)) (< (+ 3 j) M) (< i N)), 463488#(or (<= N i) (< (+ i 1) N) (<= M (+ 3 j)) (< (+ j 4) M))] [2022-03-15 22:00:40,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:00:40,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:00:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:00:40,824 INFO L87 Difference]: Start difference. First operand 14511 states and 73885 transitions. Second operand has 39 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:43,450 INFO L93 Difference]: Finished difference Result 45216 states and 220774 transitions. [2022-03-15 22:00:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:00:43,450 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:00:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:43,666 INFO L225 Difference]: With dead ends: 45216 [2022-03-15 22:00:43,666 INFO L226 Difference]: Without dead ends: 45216 [2022-03-15 22:00:43,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2340, Invalid=7166, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 22:00:43,667 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 835 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:43,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 0 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:00:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45216 states. [2022-03-15 22:00:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45216 to 25609. [2022-03-15 22:00:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25609 states, 25608 states have (on average 5.251522961574508) internal successors, (134481), 25608 states have internal predecessors, (134481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25609 states to 25609 states and 134481 transitions. [2022-03-15 22:00:44,803 INFO L78 Accepts]: Start accepts. Automaton has 25609 states and 134481 transitions. Word has length 18 [2022-03-15 22:00:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:44,803 INFO L470 AbstractCegarLoop]: Abstraction has 25609 states and 134481 transitions. [2022-03-15 22:00:44,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 25609 states and 134481 transitions. [2022-03-15 22:00:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:00:44,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:44,862 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:44,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 22:00:45,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 22:00:45,063 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:00:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2027358226, now seen corresponding path program 28 times [2022-03-15 22:00:45,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:45,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57400308] [2022-03-15 22:00:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:45,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:45,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57400308] [2022-03-15 22:00:45,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57400308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:45,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059912704] [2022-03-15 22:00:45,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:00:45,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:45,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:45,121 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:00:45,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 22:00:45,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:00:45,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:00:45,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:00:45,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:45,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:45,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059912704] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:45,248 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:45,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-03-15 22:00:45,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222383222] [2022-03-15 22:00:45,249 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:45,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:45,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 198 transitions. [2022-03-15 22:00:45,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:46,829 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [560165#(or (< j M) (<= N k) (< i N)), 560175#(or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N)), 560191#(or (<= N i) (<= (+ 2 i) k)), 560162#(or (<= N k) (< i N)), 560180#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 560174#(or (< j M) (<= N k) (<= (+ 2 i) N)), 560182#(or (<= (+ 3 i) N) (< j M)), 560172#(or (<= N i) (< (+ i 1) N) (< j M)), 560173#(or (< j M) (<= (+ 2 i) N)), 560178#(or (<= (+ i 4) N) (<= N i)), 560193#(or (< (+ j 1) M) (<= i k) (<= M j)), 560166#(or (<= N (+ k 1)) (< j M) (< i N)), 560192#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= M j)), 560155#(<= N (+ k 1)), 560159#(<= N (+ 2 k)), 560186#(or (< (+ j 1) M) (<= N (+ 2 k)) (< i N) (<= M j)), 560170#(or (<= N (+ k 1)) (<= (+ 2 i) N)), 560181#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 560185#(or (<= N i) (< j M) (<= (+ 3 i) k)), 560183#(or (<= (+ i 4) N) (<= N i) (< j M)), 560169#(or (<= N k) (<= (+ 2 i) N)), 560154#(<= N k), 560194#(or (<= N i) (< j M) (<= (+ 2 i) k)), 560168#(or (< j M) (<= N (+ 2 k)) (< i N)), 560167#(or (<= N (+ 2 k)) (< i N)), 560177#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 560161#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 560190#(or (< j M) (<= i k)), 560184#(or (< j M) (<= (+ 2 i) k)), 560187#(or (<= (+ i 1) k) (< j M)), 560158#(or (<= N (+ k 1)) (< j M)), 560163#(or (<= N (+ k 1)) (< i N)), 560156#(< j M), 560164#(or (< j M) (< i N)), 560189#(or (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N)), 560160#(or (< j M) (<= N (+ 2 k))), 560171#(or (<= N i) (<= (+ 2 i) N)), 560179#(or (<= N i) (<= (+ 3 i) k)), 560188#(or (<= N (+ 2 k)) (<= (+ 2 i) N)), 560157#(or (< j M) (<= N k)), 560176#(or (<= N (+ i 1)) (<= (+ 3 i) N))] [2022-03-15 22:00:46,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:00:46,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:46,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:00:46,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=2321, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:00:46,830 INFO L87 Difference]: Start difference. First operand 25609 states and 134481 transitions. Second operand has 51 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:51,427 INFO L93 Difference]: Finished difference Result 47012 states and 235783 transitions. [2022-03-15 22:00:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-03-15 22:00:51,427 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:00:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:51,623 INFO L225 Difference]: With dead ends: 47012 [2022-03-15 22:00:51,623 INFO L226 Difference]: Without dead ends: 46989 [2022-03-15 22:00:51,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11249 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7686, Invalid=28604, Unknown=0, NotChecked=0, Total=36290 [2022-03-15 22:00:51,624 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 561 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:51,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 0 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:00:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46989 states. [2022-03-15 22:00:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46989 to 28180. [2022-03-15 22:00:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28180 states, 28179 states have (on average 5.266155647822846) internal successors, (148395), 28179 states have internal predecessors, (148395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28180 states to 28180 states and 148395 transitions. [2022-03-15 22:00:52,745 INFO L78 Accepts]: Start accepts. Automaton has 28180 states and 148395 transitions. Word has length 18 [2022-03-15 22:00:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:52,746 INFO L470 AbstractCegarLoop]: Abstraction has 28180 states and 148395 transitions. [2022-03-15 22:00:52,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:00:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 28180 states and 148395 transitions. [2022-03-15 22:00:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:00:52,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:52,811 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:52,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 22:00:53,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 22:00:53,018 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:00:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1725386748, now seen corresponding path program 29 times [2022-03-15 22:00:53,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:53,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723462364] [2022-03-15 22:00:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:00:53,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:53,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723462364] [2022-03-15 22:00:53,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723462364] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:53,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329096392] [2022-03-15 22:00:53,070 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:00:53,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:53,071 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:00:53,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 22:00:53,093 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:00:53,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:00:53,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:00:53,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:00:53,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:00:53,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329096392] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:53,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:53,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:00:53,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719174668] [2022-03-15 22:00:53,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:53,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:53,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 198 transitions. [2022-03-15 22:00:53,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:54,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [663983#(or (< (+ i 4) N) (<= N (+ 3 i))), 663990#(or (<= (+ 2 k) i) (< (+ j 1) M) (<= M j)), 663979#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 663980#(or (<= N (+ i 1)) (< j M) (<= k (+ 2 i))), 663962#(or (<= (+ 2 k) N) (< j M) (<= N k)), 663968#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 663964#(or (< j M) (< i N)), 663988#(or (<= N (+ 2 i)) (< j M) (<= k (+ 2 i))), 663986#(or (<= k (+ 3 i)) (<= N (+ 2 i)) (< j M)), 663984#(or (<= k (+ 3 i)) (<= N (+ 2 i))), 663966#(or (<= N i) (< (+ i 1) N) (< j M)), 663982#(or (<= N (+ i 1)) (< j M) (<= k (+ i 1))), 663971#(or (<= N (+ i 1)) (< (+ 2 i) N)), 663970#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ j 1) M) (<= M j)), 663972#(or (<= N i) (<= k (+ i 1))), 663992#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= j (+ i 1)) (<= N i))), 663985#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 663974#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 663975#(or (<= N i) (< j M) (<= k (+ i 1))), 663989#(or (<= (+ 2 k) i) (< j M)), 663991#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 663941#(or (<= k i) (< j M)), 663961#(or (<= (+ k 1) N) (< j M)), 663973#(or (<= N i) (<= k i)), 663969#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 663967#(or (< j M) (<= (+ k 1) i)), 663963#(< i N), 663981#(or (<= N (+ i 1)) (<= k (+ i 1))), 663978#(or (<= N (+ i 1)) (<= k (+ 2 i))), 663976#(or (<= N i) (<= k i) (< j M)), 663987#(or (<= N (+ 2 i)) (<= k (+ 2 i))), 663965#(or (<= N i) (< (+ i 1) N)), 663959#(or (<= (+ 2 k) N) (<= N k)), 663960#(< j M), 663977#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 22:00:54,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:00:54,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:00:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1938, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:00:54,743 INFO L87 Difference]: Start difference. First operand 28180 states and 148395 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:07,969 INFO L93 Difference]: Finished difference Result 37183 states and 183395 transitions. [2022-03-15 22:01:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 339 states. [2022-03-15 22:01:07,969 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:01:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:08,124 INFO L225 Difference]: With dead ends: 37183 [2022-03-15 22:01:08,125 INFO L226 Difference]: Without dead ends: 37183 [2022-03-15 22:01:08,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55256 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=17478, Invalid=119052, Unknown=0, NotChecked=0, Total=136530 [2022-03-15 22:01:08,229 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1340 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:08,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1340 Valid, 0 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:01:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37183 states. [2022-03-15 22:01:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37183 to 29053. [2022-03-15 22:01:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29053 states, 29052 states have (on average 5.275850199642021) internal successors, (153274), 29052 states have internal predecessors, (153274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29053 states to 29053 states and 153274 transitions. [2022-03-15 22:01:09,338 INFO L78 Accepts]: Start accepts. Automaton has 29053 states and 153274 transitions. Word has length 18 [2022-03-15 22:01:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:09,339 INFO L470 AbstractCegarLoop]: Abstraction has 29053 states and 153274 transitions. [2022-03-15 22:01:09,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29053 states and 153274 transitions. [2022-03-15 22:01:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:01:09,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:09,412 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:09,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:09,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 22:01:09,613 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1034128532, now seen corresponding path program 30 times [2022-03-15 22:01:09,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:09,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698784821] [2022-03-15 22:01:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:09,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:09,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698784821] [2022-03-15 22:01:09,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698784821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:09,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262785229] [2022-03-15 22:01:09,675 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:01:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:09,676 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:01:09,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 22:01:09,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:01:09,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:09,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:01:09,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:09,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:09,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262785229] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:09,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:09,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-03-15 22:01:09,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668749422] [2022-03-15 22:01:09,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:09,875 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:09,881 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 22:01:09,881 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:11,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [760074#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 760068#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ i 1) j))), 760047#(< j M), 760051#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 760054#(or (< j M) (< i N)), 760052#(or (<= N i) (<= (+ 2 i) N)), 760053#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 760048#(or (< (+ j 1) M) (<= M j)), 760055#(or (< (+ j 1) M) (< i N) (<= M j)), 760057#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 760066#(or (<= N i) (<= (+ 2 M i) (+ k j))), 760060#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 760070#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 760049#(or (< (+ j 1) M) (<= N k) (<= M j)), 760063#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 760072#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 760059#(or (<= N i) (< (+ i 1) N) (< j M)), 760065#(or (<= N i) (<= (+ 3 M i) (+ N j))), 760050#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 760058#(or (<= (+ i 4) N) (<= N i)), 760067#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 760073#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 760062#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 760056#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 760061#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 760064#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 760069#(or (< j M) (<= (+ 2 i) N)), 760071#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j))] [2022-03-15 22:01:11,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:01:11,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:01:11,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:01:11,022 INFO L87 Difference]: Start difference. First operand 29053 states and 153274 transitions. Second operand has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:19,812 INFO L93 Difference]: Finished difference Result 68581 states and 332529 transitions. [2022-03-15 22:01:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2022-03-15 22:01:19,813 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:01:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:20,345 INFO L225 Difference]: With dead ends: 68581 [2022-03-15 22:01:20,346 INFO L226 Difference]: Without dead ends: 68581 [2022-03-15 22:01:20,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23642 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12302, Invalid=53490, Unknown=0, NotChecked=0, Total=65792 [2022-03-15 22:01:20,348 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 500 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:20,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 0 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2692 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:01:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68581 states. [2022-03-15 22:01:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68581 to 32527. [2022-03-15 22:01:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32527 states, 32526 states have (on average 5.302434975096846) internal successors, (172467), 32526 states have internal predecessors, (172467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32527 states to 32527 states and 172467 transitions. [2022-03-15 22:01:22,193 INFO L78 Accepts]: Start accepts. Automaton has 32527 states and 172467 transitions. Word has length 18 [2022-03-15 22:01:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:22,194 INFO L470 AbstractCegarLoop]: Abstraction has 32527 states and 172467 transitions. [2022-03-15 22:01:22,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32527 states and 172467 transitions. [2022-03-15 22:01:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:01:22,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:22,274 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:22,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:22,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:22,474 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash 517279162, now seen corresponding path program 31 times [2022-03-15 22:01:22,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:22,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505624224] [2022-03-15 22:01:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:22,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:22,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505624224] [2022-03-15 22:01:22,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505624224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:22,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160966218] [2022-03-15 22:01:22,532 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:01:22,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:22,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:22,533 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:01:22,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 22:01:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:22,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:01:22,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:22,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:22,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160966218] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:22,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:22,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-03-15 22:01:22,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186598468] [2022-03-15 22:01:22,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:22,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:22,710 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 146 transitions. [2022-03-15 22:01:22,710 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:24,015 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [894272#(or (<= N i) (<= (+ 3 i) k)), 894257#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 894259#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 894268#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 894261#(or (<= N i) (<= (+ 2 i) N)), 894270#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 894276#(or (<= (+ i 4) N) (<= N i) (< j M)), 894254#(or (<= N k) (< i N)), 894249#(<= N k), 894275#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 894267#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 894264#(or (<= N k) (<= (+ 2 i) N)), 894273#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 894269#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 894274#(or (<= (+ 3 i) N) (< j M)), 894260#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 894262#(or (<= N i) (< (+ i 1) N) (< j M)), 894263#(or (< j M) (<= (+ 2 i) N)), 894253#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 894271#(or (<= (+ i 4) N) (<= N i)), 894277#(or (<= N i) (<= (+ 2 M i) (+ k j))), 894265#(or (< j M) (<= N k) (<= (+ 2 i) N)), 894278#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ i 1) j))), 894258#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 894255#(or (< j M) (< i N)), 894256#(or (< j M) (<= N k) (< i N)), 894266#(or (< (+ j 1) M) (<= N k) (<= (+ 2 i) N) (<= M j)), 894251#(or (< j M) (<= N k)), 894250#(< j M), 894252#(or (< (+ j 1) M) (<= N k) (<= M j))] [2022-03-15 22:01:24,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:01:24,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:01:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1846, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:01:24,017 INFO L87 Difference]: Start difference. First operand 32527 states and 172467 transitions. Second operand has 40 states, 40 states have (on average 2.725) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:30,146 INFO L93 Difference]: Finished difference Result 64024 states and 316852 transitions. [2022-03-15 22:01:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 22:01:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:01:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:30,486 INFO L225 Difference]: With dead ends: 64024 [2022-03-15 22:01:30,486 INFO L226 Difference]: Without dead ends: 64018 [2022-03-15 22:01:30,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12825 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7419, Invalid=32381, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 22:01:30,488 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 546 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:30,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 0 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:01:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64018 states. [2022-03-15 22:01:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64018 to 31687. [2022-03-15 22:01:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31687 states, 31686 states have (on average 5.295146121315407) internal successors, (167782), 31686 states have internal predecessors, (167782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31687 states to 31687 states and 167782 transitions. [2022-03-15 22:01:32,307 INFO L78 Accepts]: Start accepts. Automaton has 31687 states and 167782 transitions. Word has length 18 [2022-03-15 22:01:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:32,307 INFO L470 AbstractCegarLoop]: Abstraction has 31687 states and 167782 transitions. [2022-03-15 22:01:32,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 31687 states and 167782 transitions. [2022-03-15 22:01:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:01:32,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:32,390 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:32,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:32,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:32,591 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:32,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1674817876, now seen corresponding path program 32 times [2022-03-15 22:01:32,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:32,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964875352] [2022-03-15 22:01:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:32,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:32,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964875352] [2022-03-15 22:01:32,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964875352] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:32,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817572301] [2022-03-15 22:01:32,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:01:32,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:32,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:32,648 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:01:32,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 22:01:32,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:01:32,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:32,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:01:32,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:32,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:32,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817572301] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:32,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:32,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 15 [2022-03-15 22:01:32,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [959939952] [2022-03-15 22:01:32,793 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:32,794 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:32,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 22:01:32,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:34,411 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [1022119#(or (<= N k) (<= (+ 2 i) N)), 1022118#(or (<= N (+ k 1)) (< (+ j 1) M) (< i N) (<= M j)), 1022104#(<= N (+ k 1)), 1022101#(< j M), 1022110#(or (<= (+ 3 i) N) (< j M)), 1022105#(or (<= N i) (<= (+ 2 i) N)), 1022106#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 1022116#(or (<= N (+ k 1)) (< j M) (< i N)), 1022126#(or (<= N i) (<= (+ 3 i) k)), 1022111#(or (< j M) (<= N k)), 1022108#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 1022127#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 1022129#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 1022121#(or (< j M) (<= N k) (<= (+ 2 i) N)), 1022113#(or (<= N k) (< i N)), 1022125#(or (<= (+ i 4) N) (<= N i)), 1022131#(or (<= N i) (<= (+ 2 i) k)), 1022103#(<= N k), 1022117#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 1022120#(or (<= N (+ k 1)) (<= (+ 2 i) N)), 1022133#(or (< j M) (<= (+ 2 i) k)), 1022123#(or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 1022114#(or (<= N (+ k 1)) (< i N)), 1022112#(or (<= N (+ k 1)) (< j M)), 1022109#(or (< j M) (<= (+ 2 i) N)), 1022128#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 1022124#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 1022130#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 1022134#(or (<= N i) (< j M) (<= (+ 3 i) k)), 1022136#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ i 1) j))), 1022135#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 2 i) M))), 1022107#(or (<= N i) (< (+ i 1) N) (< j M)), 1022102#(or (< j M) (< i N)), 1022132#(or (<= (+ i 4) N) (<= N i) (< j M)), 1022122#(or (<= N (+ k 1)) (< j M) (<= (+ 2 i) N)), 1022115#(or (< j M) (<= N k) (< i N))] [2022-03-15 22:01:34,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:01:34,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:01:34,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2286, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:01:34,412 INFO L87 Difference]: Start difference. First operand 31687 states and 167782 transitions. Second operand has 47 states, 47 states have (on average 2.893617021276596) internal successors, (136), 46 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:38,855 INFO L93 Difference]: Finished difference Result 57189 states and 287872 transitions. [2022-03-15 22:01:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-03-15 22:01:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.893617021276596) internal successors, (136), 46 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:01:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:39,309 INFO L225 Difference]: With dead ends: 57189 [2022-03-15 22:01:39,309 INFO L226 Difference]: Without dead ends: 57175 [2022-03-15 22:01:39,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7620 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4735, Invalid=19757, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 22:01:39,310 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 382 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:39,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 0 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:01:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57175 states. [2022-03-15 22:01:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57175 to 33769. [2022-03-15 22:01:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33769 states, 33768 states have (on average 5.265547263681592) internal successors, (177807), 33768 states have internal predecessors, (177807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33769 states to 33769 states and 177807 transitions. [2022-03-15 22:01:41,017 INFO L78 Accepts]: Start accepts. Automaton has 33769 states and 177807 transitions. Word has length 18 [2022-03-15 22:01:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:41,017 INFO L470 AbstractCegarLoop]: Abstraction has 33769 states and 177807 transitions. [2022-03-15 22:01:41,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.893617021276596) internal successors, (136), 46 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33769 states and 177807 transitions. [2022-03-15 22:01:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:01:41,116 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:41,116 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:41,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:41,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 22:01:41,317 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2094102398, now seen corresponding path program 33 times [2022-03-15 22:01:41,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:41,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109018941] [2022-03-15 22:01:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:41,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:41,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109018941] [2022-03-15 22:01:41,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109018941] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:41,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255156844] [2022-03-15 22:01:41,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:01:41,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:41,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:41,378 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:01:41,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 22:01:41,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:01:41,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:01:41,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:41,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:41,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255156844] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:41,593 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:41,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2022-03-15 22:01:41,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631812691] [2022-03-15 22:01:41,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:41,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:41,602 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 157 transitions. [2022-03-15 22:01:41,602 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:43,003 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [1147217#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 1147203#(< i N), 1147227#(or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= M j)), 1147207#(or (< (+ i 4) N) (<= N (+ 3 i))), 1147215#(and (or (<= (+ 2 j) i) (<= M j)) (or (= (+ (* (- 1) k) M) 0) (<= M j))), 1147223#(or (<= N i) (<= (+ k j) (+ M i))), 1147225#(or (<= k (+ 3 i)) (<= N (+ 2 i))), 1147212#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 1147228#(or (<= N (+ 2 i)) (<= (+ k j) (+ 2 M i))), 1147206#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 1147222#(or (<= N (+ i 1)) (<= (+ k j) (+ 2 M i))), 1147200#(or (< (+ j 1) M) (< k N) (<= M j)), 1147214#(and (or (<= (+ 3 j) i) (<= M j)) (or (= (+ (* (- 1) k) M) 0) (<= M j))), 1147198#(or (<= (+ k 1) N) (< j M)), 1147221#(or (<= N (+ i 1)) (<= k (+ 2 i))), 1147197#(< j M), 1147219#(or (<= N i) (<= k (+ i 1))), 1147226#(or (<= N (+ 2 i)) (<= (+ k j) (+ 3 M i))), 1147209#(or (<= N i) (< (+ i 1) N) (< j M)), 1147210#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 1147218#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 1147199#(or (< (+ j 1) M) (<= M j)), 1147204#(or (<= N i) (< (+ i 1) N)), 1147208#(or (< j M) (< i N)), 1147202#(or (<= N k) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 1147224#(or (<= N (+ i 1)) (<= (+ k j) (+ M i 1))), 1147216#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 1147229#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= j (+ i 1)) (<= N i))), 1147220#(or (<= (+ k j) (+ M i 1)) (<= N i)), 1147211#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 1147201#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 1147205#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1147213#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:01:43,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 22:01:43,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 22:01:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 22:01:43,004 INFO L87 Difference]: Start difference. First operand 33769 states and 177807 transitions. Second operand has 43 states, 43 states have (on average 2.744186046511628) internal successors, (118), 42 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:06,319 INFO L93 Difference]: Finished difference Result 48316 states and 234801 transitions. [2022-03-15 22:02:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 458 states. [2022-03-15 22:02:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.744186046511628) internal successors, (118), 42 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:02:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:06,556 INFO L225 Difference]: With dead ends: 48316 [2022-03-15 22:02:06,556 INFO L226 Difference]: Without dead ends: 48313 [2022-03-15 22:02:06,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 497 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105400 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=30652, Invalid=217850, Unknown=0, NotChecked=0, Total=248502 [2022-03-15 22:02:06,566 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1750 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:06,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1750 Valid, 0 Invalid, 4163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1229 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:02:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48313 states. [2022-03-15 22:02:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48313 to 36164. [2022-03-15 22:02:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36164 states, 36163 states have (on average 5.29975389209966) internal successors, (191655), 36163 states have internal predecessors, (191655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36164 states to 36164 states and 191655 transitions. [2022-03-15 22:02:08,105 INFO L78 Accepts]: Start accepts. Automaton has 36164 states and 191655 transitions. Word has length 18 [2022-03-15 22:02:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:08,105 INFO L470 AbstractCegarLoop]: Abstraction has 36164 states and 191655 transitions. [2022-03-15 22:02:08,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.744186046511628) internal successors, (118), 42 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36164 states and 191655 transitions. [2022-03-15 22:02:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:02:08,195 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:08,195 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:08,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 22:02:08,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 22:02:08,396 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1127518718, now seen corresponding path program 34 times [2022-03-15 22:02:08,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:08,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244419195] [2022-03-15 22:02:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:08,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:08,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244419195] [2022-03-15 22:02:08,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244419195] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:08,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439989214] [2022-03-15 22:02:08,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:02:08,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:08,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:08,451 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:02:08,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 22:02:08,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:02:08,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:08,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:02:08,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:08,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:08,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439989214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:08,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:08,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 16 [2022-03-15 22:02:08,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819319968] [2022-03-15 22:02:08,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:08,634 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:08,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 22:02:08,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:10,301 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [1268893#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 1268906#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 1268888#(or (< j M) (< i N)), 1268905#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= j i))), 1268896#(or (< (+ i 4) N) (<= N (+ 3 i))), 1268909#(or (<= k (+ 3 i)) (<= N (+ 2 i)) (< j M)), 1268892#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1268907#(or (<= (+ k 1) i) (< (+ 2 j) M) (<= M (+ j 1))), 1268901#(or (<= N i) (< j M) (<= k (+ i 1))), 1268891#(or (< j M) (<= (+ k 1) i)), 1268884#(< j M), 1268908#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 1268904#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= j (+ i 1)) (<= N i))), 1268890#(or (<= N i) (< (+ i 1) N) (< j M)), 1268897#(or (<= k (+ 3 i)) (<= N (+ 2 i))), 1268900#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 1268883#(or (<= (+ 2 k) N) (<= N k)), 1268887#(< i N), 1268894#(or (<= N i) (<= k (+ i 1))), 1268910#(and (or (<= N (+ i 1)) (<= j (+ 2 i))) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1268885#(or (<= (+ k 1) N) (< j M)), 1268898#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= N k) (<= M j)), 1268857#(or (<= k i) (< j M)), 1268899#(or (<= (+ 2 k) N) (<= N k) (< (+ 2 j) M) (<= M (+ j 1))), 1268911#(and (or (<= N (+ i 1)) (<= j (+ i 1))) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 1268903#(or (<= N (+ i 1)) (< j M) (<= k (+ 2 i))), 1268886#(or (<= (+ 2 k) N) (< j M) (<= N k)), 1268902#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 1268889#(or (<= N i) (< (+ i 1) N)), 1268895#(or (<= N (+ i 1)) (<= k (+ 2 i)))] [2022-03-15 22:02:10,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:02:10,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:02:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:02:10,302 INFO L87 Difference]: Start difference. First operand 36164 states and 191655 transitions. Second operand has 39 states, 39 states have (on average 3.2051282051282053) internal successors, (125), 38 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:20,385 INFO L93 Difference]: Finished difference Result 46779 states and 234761 transitions. [2022-03-15 22:02:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2022-03-15 22:02:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.2051282051282053) internal successors, (125), 38 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:02:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:20,608 INFO L225 Difference]: With dead ends: 46779 [2022-03-15 22:02:20,609 INFO L226 Difference]: Without dead ends: 46779 [2022-03-15 22:02:20,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33154 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11321, Invalid=73651, Unknown=0, NotChecked=0, Total=84972 [2022-03-15 22:02:20,612 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1036 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:20,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1036 Valid, 0 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:02:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46779 states. [2022-03-15 22:02:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46779 to 36572. [2022-03-15 22:02:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36572 states, 36571 states have (on average 5.299745700144924) internal successors, (193817), 36571 states have internal predecessors, (193817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36572 states to 36572 states and 193817 transitions. [2022-03-15 22:02:22,055 INFO L78 Accepts]: Start accepts. Automaton has 36572 states and 193817 transitions. Word has length 18 [2022-03-15 22:02:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:22,055 INFO L470 AbstractCegarLoop]: Abstraction has 36572 states and 193817 transitions. [2022-03-15 22:02:22,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.2051282051282053) internal successors, (125), 38 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 36572 states and 193817 transitions. [2022-03-15 22:02:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:02:22,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:22,141 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:22,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 22:02:22,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 22:02:22,341 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:22,342 INFO L85 PathProgramCache]: Analyzing trace with hash -185220701, now seen corresponding path program 12 times [2022-03-15 22:02:22,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:22,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245627018] [2022-03-15 22:02:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:22,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:22,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245627018] [2022-03-15 22:02:22,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245627018] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:22,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942918481] [2022-03-15 22:02:22,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:02:22,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:22,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:22,792 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:02:22,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 22:02:22,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:02:22,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:22,825 WARN L261 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 22:02:22,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:23,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2022-03-15 22:02:23,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:23,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 3 [2022-03-15 22:02:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:23,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:23,702 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 22:02:23,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 202 [2022-03-15 22:02:23,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:23,807 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:23,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 49 treesize of output 198 [2022-03-15 22:02:25,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:25,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:25,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:25,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2022-03-15 22:02:25,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:25,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:25,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:25,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:25,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 5 [2022-03-15 22:02:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:25,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942918481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:25,372 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:25,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 22:02:25,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798508953] [2022-03-15 22:02:25,372 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:25,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:25,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 238 transitions. [2022-03-15 22:02:25,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:29,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [1389487#(and (or (<= (+ 3 i) N) (<= N (+ 2 k))) (or (<= (+ i 4) N) (<= N (+ 2 k)) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)))) (or (<= (+ i 4) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))) (<= N (+ 2 k)))), 1389483#(and (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N) (<= N (+ 3 k))) (or (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N) (<= N (+ 3 k)))), 1389469#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1))), 1389489#(and (or (<= (+ 5 i) N) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1))) (+ res2 1)) (not (< (+ 3 i) N))) (or (<= (+ 5 i) N) (not (< (+ 3 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1)))))), 1389480#(and (or (<= N (+ k 1)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))))), 1389470#(and (or (< res1 (+ res2 (select A k) (select B k) 1)) (<= N k) (< i N)) (or (<= N k) (<= (+ res2 (select A k) (select B k)) res1) (< i N))), 1389484#(and (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N) (<= N (+ 3 k))) (or (<= (+ (select A i) res1 (select B i)) (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N) (<= N (+ 3 k)))), 1389466#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 1389476#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (< i N)) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (< i N))), 1389468#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 1389481#(and (or (<= (+ 3 i) N) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= N (+ 2 k))) (or (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (<= N (+ 2 k)))), 1389474#(and (or (<= N (+ k 1)) (< res1 (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 1389488#(and (or (<= (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= N (+ 3 k))) (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))) (<= (+ i 4) N) (<= N (+ 3 k))) (or (<= (+ 3 i) N) (<= N (+ 3 k)))), 1389479#(and (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))))), 1389473#(and (or (<= N k) (< (+ 3 i) N) (<= (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ 3 i) N) (<= N k)) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) res1 (select B i) (select A (+ (- 1) N)))) (<= N k) (< (+ 3 i) N))), 1389472#(and (or (<= N k) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (<= N k) (<= (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N))) (+ res2 (select A k) (select B k)))) (or (<= (+ res2 (select A k) (select B k)) (+ (select A i) (select B (+ (- 1) N)) res1 (select B i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (<= N k))), 1389486#(and (or (<= N (+ k 1)) (<= (+ i 4) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N)) (or (<= N (+ k 1)) (<= (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))))), 1389475#(and (or (<= N (+ 2 k)) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1)) (or (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 2 k)))), 1389485#(and (or (<= (+ 2 i) N) (<= N (+ 3 k))) (or (<= (+ 3 i) N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (<= N (+ 3 k))) (or (<= (+ 3 i) N) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= N (+ 3 k)))), 1389467#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 1389471#(and (or (<= N k) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) (+ res2 (select A k) (select B k)))) (or (<= N k) (<= (+ 2 i) N) (<= (+ res2 (select A k) (select B k)) (+ (select A i) res1 (select B i))))), 1389477#(and (or (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 2 k)) (< i N)) (or (<= N (+ 2 k)) (< i N) (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1))), 1389482#(and (or (< res1 (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k) 1)) (<= N (+ 3 k))) (or (<= (+ (select B (+ 2 k)) (select A (+ k 1)) (select B (+ 3 k)) (select A (+ 3 k)) (select A (+ 2 k)) res2 (select B (+ k 1)) (select A k) (select B k)) res1) (<= N (+ 3 k)))), 1389478#(and (or (<= N (+ k 1)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i)))) (or (<= N (+ k 1)) (<= (+ (select A i) res1 (select B i)) (+ (select A (+ k 1)) res2 (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N)))] [2022-03-15 22:02:29,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:02:29,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:29,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:02:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2547, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 22:02:29,500 INFO L87 Difference]: Start difference. First operand 36572 states and 193817 transitions. Second operand has 37 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:51,874 INFO L93 Difference]: Finished difference Result 49969 states and 249225 transitions. [2022-03-15 22:02:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-03-15 22:02:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 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 [2022-03-15 22:02:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:52,097 INFO L225 Difference]: With dead ends: 49969 [2022-03-15 22:02:52,098 INFO L226 Difference]: Without dead ends: 49854 [2022-03-15 22:02:52,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19603 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=8878, Invalid=40628, Unknown=0, NotChecked=0, Total=49506 [2022-03-15 22:02:52,100 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 760 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:52,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 0 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:02:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49854 states. [2022-03-15 22:02:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49854 to 37337. [2022-03-15 22:02:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37337 states, 37336 states have (on average 5.289747160917077) internal successors, (197498), 37336 states have internal predecessors, (197498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37337 states to 37337 states and 197498 transitions. [2022-03-15 22:02:53,550 INFO L78 Accepts]: Start accepts. Automaton has 37337 states and 197498 transitions. Word has length 19 [2022-03-15 22:02:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:53,550 INFO L470 AbstractCegarLoop]: Abstraction has 37337 states and 197498 transitions. [2022-03-15 22:02:53,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37337 states and 197498 transitions. [2022-03-15 22:02:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:02:53,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:53,653 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:53,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 22:02:53,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:53,854 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -143330255, now seen corresponding path program 13 times [2022-03-15 22:02:53,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:53,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100823004] [2022-03-15 22:02:53,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:53,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:53,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100823004] [2022-03-15 22:02:53,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100823004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:53,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593139138] [2022-03-15 22:02:53,927 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:02:53,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:53,928 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:02:53,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 22:02:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:53,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:02:53,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:54,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:54,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593139138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:54,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:54,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-03-15 22:02:54,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966456824] [2022-03-15 22:02:54,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:54,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:54,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 233 transitions. [2022-03-15 22:02:54,073 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:56,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [1514592#(< j M), 1514630#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< j M) (< (+ 2 k) N)), 1514620#(or (<= N (+ i 1)) (< j M) (< k N)), 1514640#(or (< j M) (<= k (+ i 1))), 1514599#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 1514627#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 1514610#(or (<= N (+ 2 i)) (< k N)), 1514638#(or (<= N (+ 2 i)) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514624#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ k 1) N)), 1514633#(or (<= N (+ i 1)) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514628#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 1514603#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 1514598#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 1514635#(or (< j M) (<= N (+ 3 i))), 1514615#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 1514629#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N)), 1514616#(or (<= N i) (< j M)), 1514622#(or (<= N (+ 2 i)) (< j M)), 1514639#(or (<= N (+ 2 i)) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514618#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 1514607#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 1514594#(or (<= N k) (< (+ k 1) N)), 1514619#(or (<= N (+ i 1)) (< j M)), 1514625#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 1514601#(or (<= N i) (< k N)), 1514637#(or (< j M) (<= k (+ 2 i))), 1514597#(or (<= (+ N 1) i) (< k N)), 1514605#(or (< j M) (< k N)), 1514621#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 1514604#(or (<= N i) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514623#(or (<= N (+ 2 i)) (< j M) (< k N)), 1514612#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 1514593#(< k N), 1514595#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1514631#(or (< j M) (<= (+ N 1) i) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514611#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 1514613#(or (< j M) (<= (+ N 1) i)), 1514606#(or (< j M) (<= N k) (< (+ k 1) N)), 1514634#(or (<= N (+ i 1)) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514608#(or (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514614#(or (< j M) (<= (+ N 1) i) (< k N)), 1514636#(or (<= k (+ 3 i)) (< j M)), 1514632#(or (<= N i) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514602#(or (<= N i) (<= N k) (< (+ k 1) N)), 1514617#(or (<= N i) (< j M) (< k N)), 1514609#(or (<= N (+ i 1)) (< k N)), 1514600#(or (<= (+ N 1) i) (<= N (+ 2 k)) (< (+ 3 k) N)), 1514596#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 1514626#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 1514641#(and (or (< j M) (= (+ res2 (* (- 1) i)) 0)) (or (< j M) (<= k 0)) (or (< j M) (= res2 0)))] [2022-03-15 22:02:56,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 22:02:56,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 22:02:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=3603, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:02:56,378 INFO L87 Difference]: Start difference. First operand 37337 states and 197498 transitions. Second operand has 62 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 61 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:01,718 INFO L93 Difference]: Finished difference Result 40465 states and 209843 transitions. [2022-03-15 22:03:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-03-15 22:03:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 61 states have internal predecessors, (177), 0 states have call successors, (0), 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 [2022-03-15 22:03:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:01,888 INFO L225 Difference]: With dead ends: 40465 [2022-03-15 22:03:01,888 INFO L226 Difference]: Without dead ends: 40442 [2022-03-15 22:03:01,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12451 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8270, Invalid=32332, Unknown=0, NotChecked=0, Total=40602 [2022-03-15 22:03:01,889 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 615 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:01,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 0 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:03:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40442 states. [2022-03-15 22:03:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40442 to 37415. [2022-03-15 22:03:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37415 states, 37414 states have (on average 5.2839044208050465) internal successors, (197692), 37414 states have internal predecessors, (197692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37415 states to 37415 states and 197692 transitions. [2022-03-15 22:03:03,242 INFO L78 Accepts]: Start accepts. Automaton has 37415 states and 197692 transitions. Word has length 19 [2022-03-15 22:03:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:03,242 INFO L470 AbstractCegarLoop]: Abstraction has 37415 states and 197692 transitions. [2022-03-15 22:03:03,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 61 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37415 states and 197692 transitions. [2022-03-15 22:03:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:03:03,340 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:03,340 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:03,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:03,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 22:03:03,541 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash -452205349, now seen corresponding path program 35 times [2022-03-15 22:03:03,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:03,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521971688] [2022-03-15 22:03:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:03,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:03,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521971688] [2022-03-15 22:03:03,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521971688] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:03,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087858242] [2022-03-15 22:03:03,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:03:03,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:03,947 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:03:03,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 22:03:03,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:03:03,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:03,972 WARN L261 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 22:03:03,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:04,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2022-03-15 22:03:04,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:04,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2022-03-15 22:03:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:04,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:04,786 INFO L353 Elim1Store]: treesize reduction 114, result has 61.4 percent of original size [2022-03-15 22:03:04,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 73 treesize of output 228 [2022-03-15 22:03:04,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:04,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:03:04,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 47 treesize of output 218 [2022-03-15 22:03:16,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,588 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:03:16,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 133 [2022-03-15 22:03:16,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:16,636 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:03:16,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 107 [2022-03-15 22:03:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:17,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087858242] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:17,027 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:17,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2022-03-15 22:03:17,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829447398] [2022-03-15 22:03:17,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:17,028 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:17,036 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 153 transitions. [2022-03-15 22:03:17,036 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:22,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [1630369#(and (or (< (+ j 1) M) (<= (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1) (not (< j M)) (<= N (+ 2 k))) (or (< (+ j 1) M) (< res1 (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1)) (not (< j M)) (<= N (+ 2 k)))), 1630364#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1)) (< i N))), 1630373#(and (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N))), 1630368#(and (or (<= (+ 5 i) N) (< (+ j 1) M) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1)) (not (< j M)) (not (< (+ 3 i) N))) (or (<= (+ 5 i) N) (< (+ j 1) M) (not (< j M)) (not (< (+ 3 i) N)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1)))))), 1630355#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 1630358#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1630354#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 1630350#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)))), 1630380#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)))), 1630378#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M)))), 1630384#(and (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ i 4) N) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))) (not (< j M))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M))) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)))), 1630374#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (<= (+ 2 i) N))), 1630352#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< res1 (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1))) (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1))), 1630359#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ res2 1))) (or (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 1630349#(and (or (< res1 (+ res2 1)) (< j M)) (or (< j M) (<= res2 res1))), 1630366#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)))), 1630361#(and (or (<= (+ 5 i) N) (< j M) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1))) (+ res2 1)) (not (< (+ 3 i) N))) (or (<= (+ 5 i) N) (< j M) (not (< (+ 3 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1)))))), 1630367#(and (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< (+ 2 i) N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))))), 1630365#(and (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (< (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j) 1))) (or (< (+ j 1) M) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i))))), 1630357#(and (or (< j M) (<= res2 res1) (< i N)) (or (< res1 (+ res2 1)) (< j M) (< i N))), 1630356#(and (or (<= (+ 5 i) N) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1))) (+ res2 1)) (not (< (+ 3 i) N))) (or (<= (+ 5 i) N) (not (< (+ 3 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B (+ 3 i)) (select B i) (select A (+ 3 i)) (select A (+ i 1)))))), 1630375#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) res1 (select B i))) (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= (+ (select A i) res1 (select B i)) (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)) (<= N (+ 2 k)) (<= (+ 2 i) N))), 1630377#(and (or (< j M) (< (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) res1 (select B i) (select A (+ (- 1) N))))) (or (< j M) (< (+ 3 i) N) (<= (+ (select A i) (select B (+ (- 2) N)) (select B (+ (- 1) N)) (select A (+ (- 2) N)) res1 (select B i) (select A (+ (- 1) N))) res2)) (or (<= (+ 3 i) N) (< j M))), 1630353#(and (or (not (< i N)) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i)))) (or (< (+ (select A i) res1 (select B i)) (+ res2 1)) (not (< i N)) (<= (+ 2 i) N))), 1630360#(and (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (<= res2 (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (not (< (+ 2 i) N)) (< (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ res2 1)))), 1630385#(and (or (< (+ j 1) M) (<= (+ i 4) N) (not (< j M)) (<= (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1)))) (<= N (+ 2 k))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (<= N (+ 2 k))) (or (< (+ j 1) M) (<= (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (not (< j M)) (<= N (+ 2 k)))), 1630363#(and (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M)) (< i N))), 1630376#(and (or (<= (+ 3 i) N) (<= res2 (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) res2))), 1630371#(and (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) res1 (select B i)) res2)) (or (< j M) (<= (+ 2 i) N) (<= res2 (+ (select A i) res1 (select B i))))), 1630372#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A j) res2 (select B j)) (+ (select A i) res1 (select B i)))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select B i)) (+ (select A j) res2 (select B j))) (<= (+ 2 i) N))), 1630370#(and (or (< (+ j 1) M) (< res1 (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k) 1)) (not (< j M)) (<= N (+ 2 k)) (< i N)) (or (< (+ j 1) M) (<= (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) res1) (not (< j M)) (<= N (+ 2 k)) (< i N))), 1630351#(and (or (< (+ j 1) M) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) res1) (<= N k) (not (< j M))) (or (< (+ j 1) M) (< res1 (+ (select A j) res2 (select B j) (select A k) (select B k) 1)) (<= N k) (not (< j M)))), 1630379#(and (or (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) (select A k) (select B k))) (<= N k) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))))), 1630362#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) res2 (select B j)) res1) (< i N)) (or (< res1 (+ (select A j) res2 (select B j) 1)) (< (+ j 1) M) (not (< j M)) (< i N))), 1630382#(and (or (< (+ j 1) M) (<= (+ i 4) N) (not (< j M)) (<= (+ (select A j) res2 (select B j)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (<= (+ i 4) N) (not (< j M)) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j))))), 1630383#(and (or (< (+ j 1) M) (<= (+ i 4) N) (<= N k) (not (< j M)) (<= (+ (select A j) res2 (select B j) (select A k) (select B k)) (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))))) (or (< (+ j 1) M) (<= (+ i 4) N) (<= N k) (not (< j M)) (<= (+ (select A i) (select A (+ 2 i)) (select B (+ i 1)) (select B (+ 2 i)) res1 (select B i) (select A (+ i 1))) (+ (select A j) res2 (select B j) (select A k) (select B k)))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= N k) (not (< j M)))), 1630381#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1))) (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k))) (<= N (+ 2 k))) (or (< (+ j 1) M) (not (< j M)) (<= N (+ 2 k)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) (select B (+ 2 k)) (select A (+ k 1)) (select A (+ 2 k)) res2 (select B j) (select B (+ k 1)) (select A k) (select B k)) (+ (select A i) (select B (+ i 1)) res1 (select B i) (select A (+ i 1)))) (not (< j M)) (<= N (+ 2 k))))] [2022-03-15 22:03:22,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 22:03:22,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:22,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 22:03:22,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=3962, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:03:22,019 INFO L87 Difference]: Start difference. First operand 37415 states and 197692 transitions. Second operand has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 49 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:04:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 302 states. [2022-03-15 22:04:20,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47263 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=23051, Invalid=100501, Unknown=0, NotChecked=0, Total=123552 [2022-03-15 22:04:20,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 758 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 3214 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 3214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:20,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 0 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 3214 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 22:04:20,131 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:04:20,138 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:04:20,138 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:04:20,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 22:04:20,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:20,332 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (37415states) and FLOYD_HOARE automaton (currently 302 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 352 known predicates. [2022-03-15 22:04:20,333 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:04:20,333 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:04:20,333 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:04:20,335 INFO L732 BasicCegarLoop]: Path program histogram: [35, 13, 1, 1, 1] [2022-03-15 22:04:20,336 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:04:20,336 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:04:20,337 INFO L202 PluginConnector]: Adding new model array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:04:20 BasicIcfg [2022-03-15 22:04:20,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:04:20,337 INFO L158 Benchmark]: Toolchain (without parser) took 742323.92ms. Allocated memory was 195.0MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 159.7MB in the beginning and 915.2MB in the end (delta: -755.5MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-03-15 22:04:20,337 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:04:20,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.29ms. Allocated memory is still 195.0MB. Free memory was 159.6MB in the beginning and 158.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:04:20,338 INFO L158 Benchmark]: Boogie Preprocessor took 14.51ms. Allocated memory is still 195.0MB. Free memory was 158.1MB in the beginning and 157.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:04:20,338 INFO L158 Benchmark]: RCFGBuilder took 167.33ms. Allocated memory is still 195.0MB. Free memory was 157.1MB in the beginning and 148.0MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:04:20,338 INFO L158 Benchmark]: TraceAbstraction took 742118.98ms. Allocated memory was 195.0MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 147.5MB in the beginning and 915.2MB in the end (delta: -767.7MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-03-15 22:04:20,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.29ms. Allocated memory is still 195.0MB. Free memory was 159.6MB in the beginning and 158.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.51ms. Allocated memory is still 195.0MB. Free memory was 158.1MB in the beginning and 157.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 167.33ms. Allocated memory is still 195.0MB. Free memory was 157.1MB in the beginning and 148.0MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 742118.98ms. Allocated memory was 195.0MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 147.5MB in the beginning and 915.2MB in the end (delta: -767.7MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 39 PlacesBefore, 25 PlacesAfterwards, 32 TransitionsBefore, 18 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 109, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 163, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 109, unknown conditional: 0, unknown unconditional: 109] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (37415states) and FLOYD_HOARE automaton (currently 302 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 352 known predicates. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (37415states) and FLOYD_HOARE automaton (currently 302 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 352 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (37415states) and FLOYD_HOARE automaton (currently 302 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 352 known predicates. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (37415states) and FLOYD_HOARE automaton (currently 302 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 352 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 742.0s, OverallIterations: 51, TraceHistogramMax: 5, PathProgramHistogramMax: 35, EmptinessCheckTime: 1.1s, AutomataDifference: 588.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33258 SdHoareTripleChecker+Valid, 51.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33258 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 44.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20798 mSDsCounter, 19845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89645 IncrementalHoareTripleChecker+Invalid, 109490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19845 mSolverCounterUnsat, 0 mSDtfsCounter, 89645 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12935 GetRequests, 2423 SyntacticMatches, 199 SemanticMatches, 10312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741540 ImplicationChecksByTransitivity, 550.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37415occurred in iteration=50, InterpolantAutomatonStates: 8700, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.5s AutomataMinimizationTime, 50 MinimizatonAttempts, 297563 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 1655 NumberOfCodeBlocks, 1655 NumberOfCodeBlocksAsserted, 170 NumberOfCheckSat, 2318 ConstructedInterpolants, 36 QuantifiedInterpolants, 27296 SizeOfPredicates, 177 NumberOfNonLiveVariables, 3426 ConjunctsInSsa, 726 ConjunctsInUnsatCore, 147 InterpolantComputations, 3 PerfectInterpolantSequences, 518/1541 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown