/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/sum-fun-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:17:27,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:17:27,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:17:27,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:17:27,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:17:27,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:17:27,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:17:27,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:17:27,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:17:27,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:17:27,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:17:27,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:17:27,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:17:27,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:17:27,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:17:27,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:17:27,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:17:27,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:17:27,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:17:27,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:17:27,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:17:27,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:17:27,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:17:27,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:17:27,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:17:27,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:17:27,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:17:27,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:17:27,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:17:27,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:17:27,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:17:27,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:17:27,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:17:27,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:17:27,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:17:27,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:17:27,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:17:27,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:17:27,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:17:27,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:17:27,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:17:27,614 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 22:17:27,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:17:27,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:17:27,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:17:27,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:17:27,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:17:27,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:17:27,644 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:17:27,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:17:27,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:17:27,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:17:27,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:17:27,646 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:17:27,647 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:17:27,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:17:27,647 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 22:17:27,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:17:27,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:17:27,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:17:27,820 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:17:27,821 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:17:27,821 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/sum-fun-alt.wvr.bpl [2022-03-15 22:17:27,822 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun-alt.wvr.bpl' [2022-03-15 22:17:27,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:17:27,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:17:27,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:17:27,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:17:27,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:17:27,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,864 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:17:27,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:17:27,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:17:27,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:17:27,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:17:27,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:17:27,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:17:27,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:17:27,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:17:27,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/1) ... [2022-03-15 22:17:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:17:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:27,917 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 22:17:27,923 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 22:17:27,948 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:17:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:17:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:17:27,949 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:17:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:17:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:17:27,949 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:17:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:17:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:17:27,949 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:17:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:17:27,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:17:27,950 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 22:17:27,984 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:17:27,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:17:28,095 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:17:28,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:17:28,105 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:17:28,106 INFO L202 PluginConnector]: Adding new model sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:17:28 BoogieIcfgContainer [2022-03-15 22:17:28,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:17:28,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:17:28,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:17:28,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:17:28,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:17:27" (1/2) ... [2022-03-15 22:17:28,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3277e8 and model type sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:17:28, skipping insertion in model container [2022-03-15 22:17:28,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:17:28" (2/2) ... [2022-03-15 22:17:28,131 INFO L111 eAbstractionObserver]: Analyzing ICFG sum-fun-alt.wvr.bpl [2022-03-15 22:17:28,134 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:17:28,135 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:17:28,135 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:17:28,135 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:17:28,156 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:17:28,188 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:17:28,193 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 22:17:28,193 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:17:28,214 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:17:28,221 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:17:28,223 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:17:28,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:17:28,241 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:17:28,242 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:17:28,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:17:28,245 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:17:28,483 INFO L131 LiptonReduction]: Checked pairs total: 106 [2022-03-15 22:17:28,483 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:17:28,488 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:17:28,511 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 22:17:28,513 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 22:17:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:17:28,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:28,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:28,518 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1022751962, now seen corresponding path program 1 times [2022-03-15 22:17:28,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:28,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393224971] [2022-03-15 22:17:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:28,664 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 22:17:28,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:28,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393224971] [2022-03-15 22:17:28,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393224971] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:17:28,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:17:28,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:17:28,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166100995] [2022-03-15 22:17:28,668 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:28,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:28,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:17:28,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:28,890 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:28,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:17:28,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:17:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:17:28,907 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 22:17:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:28,938 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:17:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:17:28,940 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 22:17:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:28,946 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:17:28,947 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:17:28,948 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 22:17:28,956 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 22:17:28,958 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 22:17:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:17:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:17:28,985 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 22:17:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:17:28,987 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:17:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:28,988 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:17:28,988 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 22:17:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:17:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:17:28,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:28,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:28,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:17:28,990 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1617420820, now seen corresponding path program 1 times [2022-03-15 22:17:28,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:28,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947439305] [2022-03-15 22:17:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:29,042 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 22:17:29,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:29,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947439305] [2022-03-15 22:17:29,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947439305] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:17:29,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:17:29,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:17:29,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941763448] [2022-03-15 22:17:29,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:29,044 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:29,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:17:29,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:29,226 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:29,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:17:29,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:17:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:17:29,228 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:29,265 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:17:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:17:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:17:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:29,267 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:17:29,267 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:17:29,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 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 22:17:29,268 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:29,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:17:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:17:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:17:29,271 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 22:17:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:17:29,272 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:17:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:29,272 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:17:29,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:17:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:17:29,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:29,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:29,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:17:29,273 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1327324498, now seen corresponding path program 1 times [2022-03-15 22:17:29,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:29,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474975391] [2022-03-15 22:17:29,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:29,323 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 22:17:29,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:29,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474975391] [2022-03-15 22:17:29,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474975391] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:17:29,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:17:29,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:17:29,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742613558] [2022-03-15 22:17:29,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:29,325 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:29,327 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:17:29,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:29,438 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:17:29,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:17:29,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:17:29,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:17:29,439 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:29,471 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:17:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:17:29,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:17:29,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:29,473 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:17:29,473 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:17:29,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 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 22:17:29,474 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 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 22:17:29,474 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 22:17:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:17:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:17:29,477 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 22:17:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:17:29,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:17:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:29,478 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:17:29,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:17:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:17:29,479 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:29,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:29,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:17:29,479 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1745317284, now seen corresponding path program 1 times [2022-03-15 22:17:29,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:29,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525040189] [2022-03-15 22:17:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:29,616 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 22:17:29,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:29,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525040189] [2022-03-15 22:17:29,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525040189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:29,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815720317] [2022-03-15 22:17:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:29,618 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 22:17:29,619 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 22:17:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:29,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:17:29,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:29,797 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 19 treesize of output 15 [2022-03-15 22:17:29,810 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 22:17:29,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:29,876 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:29,876 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 11 treesize of output 16 [2022-03-15 22:17:29,895 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 5 [2022-03-15 22:17:29,969 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 22:17:29,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815720317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:29,969 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:29,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 22:17:29,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328775392] [2022-03-15 22:17:29,970 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:29,971 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:29,973 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:17:29,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:30,574 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [543#(and (< sum2 (+ (select A i) sum1 1)) (<= (+ (select A i) sum1) sum2)), 545#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 544#(and (or (< sum2 (+ (select A i) sum1 1)) (< j M)) (or (< j M) (<= (+ (select A i) sum1) sum2))), 541#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 542#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= sum1 (select A k))))] [2022-03-15 22:17:30,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:17:30,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:17:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:17:30,576 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 22:17:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:30,757 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:17:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:17:30,757 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 22:17:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:30,758 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:17:30,758 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:17:30,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:17:30,759 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:30,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:17:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:17:30,763 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 22:17:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:17:30,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:17:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:30,764 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:17:30,764 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 22:17:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:17:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:30,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:30,765 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:30,784 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 22:17:30,981 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 22:17:30,982 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1818191762, now seen corresponding path program 2 times [2022-03-15 22:17:30,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:30,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869375350] [2022-03-15 22:17:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:31,026 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 22:17:31,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:31,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869375350] [2022-03-15 22:17:31,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869375350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:31,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128724377] [2022-03-15 22:17:31,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:31,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:31,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:31,044 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 22:17:31,045 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 22:17:31,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:31,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:31,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:17:31,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:31,121 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 22:17:31,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:31,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 22:17:31,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128724377] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:31,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:31,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:17:31,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311305161] [2022-03-15 22:17:31,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:31,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:31,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:17:31,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:31,719 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [851#(or (< j M) (< i N)), 838#(or (<= k i) (< j M)), 845#(< i N), 852#(or (< k N) (< i N)), 860#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 850#(or (<= (+ 2 k) N) (< j M)), 847#(or (<= N (+ i 1)) (< (+ 2 i) N)), 853#(or (< j M) (< k N) (< i N)), 849#(or (<= (+ k 1) N) (< j M)), 855#(or (<= N i) (< (+ i 1) N) (< j M)), 859#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 848#(< j M), 846#(or (<= N i) (< (+ i 1) N)), 856#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 854#(or (<= N i) (< (+ i 1) N) (< k N)), 857#(or (< j M) (<= (+ k 1) i)), 858#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:17:31,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:17:31,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:17:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:17:31,721 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:32,587 INFO L93 Difference]: Finished difference Result 171 states and 489 transitions. [2022-03-15 22:17:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:17:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:17:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:32,589 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:17:32,589 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 22:17:32,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:17:32,591 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:32,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:17:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 22:17:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2022-03-15 22:17:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.2989690721649483) internal successors, (320), 97 states have internal predecessors, (320), 0 states have call successors, (0), 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:17:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 320 transitions. [2022-03-15 22:17:32,599 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 320 transitions. Word has length 14 [2022-03-15 22:17:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:32,599 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 320 transitions. [2022-03-15 22:17:32,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 320 transitions. [2022-03-15 22:17:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:32,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:32,601 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:32,619 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 22:17:32,815 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 22:17:32,816 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1729849712, now seen corresponding path program 3 times [2022-03-15 22:17:32,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:32,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780278963] [2022-03-15 22:17:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:32,876 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 22:17:32,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:32,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780278963] [2022-03-15 22:17:32,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780278963] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:32,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747004758] [2022-03-15 22:17:32,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:32,878 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 22:17:32,879 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 22:17:32,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:17:32,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:32,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:17:32,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:32,968 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 22:17:32,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:32,991 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 22:17:32,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747004758] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:32,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:32,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:17:32,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346786753] [2022-03-15 22:17:32,992 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:32,993 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:32,997 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:17:32,997 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:33,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1386#(or (<= N i) (< (+ i 1) N) (<= N k)), 1384#(or (<= N i) (< (+ i 1) N)), 1383#(< i N), 1385#(or (<= N k) (< i N))] [2022-03-15 22:17:33,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:17:33,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:17:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:17:33,221 INFO L87 Difference]: Start difference. First operand 98 states and 320 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:33,528 INFO L93 Difference]: Finished difference Result 216 states and 644 transitions. [2022-03-15 22:17:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:17:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:17:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:33,530 INFO L225 Difference]: With dead ends: 216 [2022-03-15 22:17:33,530 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 22:17:33,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:17:33,531 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:33,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 22:17:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2022-03-15 22:17:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.335570469798658) internal successors, (497), 149 states have internal predecessors, (497), 0 states have call successors, (0), 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:17:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:17:33,539 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:17:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:33,540 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:17:33,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:17:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:33,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:33,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:33,559 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 22:17:33,757 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 22:17:33,757 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1144577720, now seen corresponding path program 1 times [2022-03-15 22:17:33,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:33,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826669059] [2022-03-15 22:17:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:33,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:33,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826669059] [2022-03-15 22:17:33,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826669059] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:33,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796501622] [2022-03-15 22:17:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:33,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:33,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:33,788 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 22:17:33,789 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 22:17:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:33,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:17:33,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:33,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:33,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796501622] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:33,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:33,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:17:33,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333476726] [2022-03-15 22:17:33,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:33,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:33,886 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:17:33,886 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:34,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2025#(or (< (+ j 1) M) (<= M j)), 2026#(or (< j M) (< i N)), 2024#(< j M), 2029#(or (< (+ j 1) M) (< i N) (<= M j)), 2027#(or (<= N i) (<= (+ 2 i) N)), 2028#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 22:17:34,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:17:34,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:17:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:17:34,157 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:34,308 INFO L93 Difference]: Finished difference Result 204 states and 669 transitions. [2022-03-15 22:17:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:17:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:17:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:34,309 INFO L225 Difference]: With dead ends: 204 [2022-03-15 22:17:34,309 INFO L226 Difference]: Without dead ends: 204 [2022-03-15 22:17:34,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:17:34,310 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:34,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-03-15 22:17:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2022-03-15 22:17:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.312883435582822) internal successors, (540), 163 states have internal predecessors, (540), 0 states have call successors, (0), 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:17:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 540 transitions. [2022-03-15 22:17:34,328 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 540 transitions. Word has length 14 [2022-03-15 22:17:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:34,328 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 540 transitions. [2022-03-15 22:17:34,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 540 transitions. [2022-03-15 22:17:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:17:34,329 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:34,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:34,349 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 22:17:34,529 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 22:17:34,529 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1863769352, now seen corresponding path program 2 times [2022-03-15 22:17:34,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:34,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527498917] [2022-03-15 22:17:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:34,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:34,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527498917] [2022-03-15 22:17:34,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527498917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:34,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185255046] [2022-03-15 22:17:34,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:34,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:34,562 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 22:17:34,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:34,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:34,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:17:34,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:34,593 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 22:17:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:34,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:17:34,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185255046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:34,679 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:34,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 22:17:34,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728422526] [2022-03-15 22:17:34,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:34,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:34,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 22:17:34,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:34,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2660#(< j M), 2662#(or (< (+ j 1) M) (<= M j)), 2661#(or (< j M) (< i N)), 2663#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:17:34,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:17:34,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:17:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:17:34,963 INFO L87 Difference]: Start difference. First operand 164 states and 540 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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 22:17:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:35,128 INFO L93 Difference]: Finished difference Result 229 states and 744 transitions. [2022-03-15 22:17:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:17:35,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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 14 [2022-03-15 22:17:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:35,129 INFO L225 Difference]: With dead ends: 229 [2022-03-15 22:17:35,130 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 22:17:35,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:17:35,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:35,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:17:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 22:17:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2022-03-15 22:17:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.3333333333333335) internal successors, (550), 165 states have internal predecessors, (550), 0 states have call successors, (0), 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:17:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:17:35,136 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:17:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:35,136 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:17:35,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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 22:17:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:17:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:35,137 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:35,137 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:35,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 22:17:35,350 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 22:17:35,350 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 529259106, now seen corresponding path program 4 times [2022-03-15 22:17:35,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:35,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704014347] [2022-03-15 22:17:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:35,513 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 22:17:35,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:35,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704014347] [2022-03-15 22:17:35,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704014347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:35,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077223133] [2022-03-15 22:17:35,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:35,515 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 22:17:35,516 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 22:17:35,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:35,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:35,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:17:35,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:35,680 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 21 treesize of output 13 [2022-03-15 22:17:35,693 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 22:17:35,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:35,793 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:17:35,793 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 21 treesize of output 46 [2022-03-15 22:17:35,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:35,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:35,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:35,853 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 5 [2022-03-15 22:17:35,914 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 22:17:35,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077223133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:35,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:35,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-03-15 22:17:35,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28673997] [2022-03-15 22:17:35,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:35,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:35,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:17:35,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:38,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [3357#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= sum1 (select A k))) (or (< j M) (<= (+ k 1) i))), 3364#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 3341#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 3342#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 3360#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 3346#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 3359#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 3363#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 3356#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 3361#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 3358#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 3344#(and (or (< j M) (<= sum1 (+ (select A k) (select A (+ (- 1) N)))) (< (+ 2 k) N)) (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) (select A (+ (- 1) N))) sum1)) (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 3355#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 3349#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 3348#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 3343#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 3351#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 3354#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 3350#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 3345#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 3347#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 3352#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 3362#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 3353#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N)))] [2022-03-15 22:17:38,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:17:38,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:38,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:17:38,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:17:38,133 INFO L87 Difference]: Start difference. First operand 166 states and 550 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 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 22:17:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:43,389 INFO L93 Difference]: Finished difference Result 461 states and 1398 transitions. [2022-03-15 22:17:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 22:17:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 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 15 [2022-03-15 22:17:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:43,392 INFO L225 Difference]: With dead ends: 461 [2022-03-15 22:17:43,392 INFO L226 Difference]: Without dead ends: 440 [2022-03-15 22:17:43,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3719 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1969, Invalid=10463, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 22:17:43,394 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:43,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:17:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-15 22:17:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 218. [2022-03-15 22:17:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 3.414746543778802) internal successors, (741), 217 states have internal predecessors, (741), 0 states have call successors, (0), 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:17:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 741 transitions. [2022-03-15 22:17:43,400 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 741 transitions. Word has length 15 [2022-03-15 22:17:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:43,400 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 741 transitions. [2022-03-15 22:17:43,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 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 22:17:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 741 transitions. [2022-03-15 22:17:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:43,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:43,401 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:43,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:17:43,618 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 22:17:43,618 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 689522916, now seen corresponding path program 5 times [2022-03-15 22:17:43,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:43,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240360766] [2022-03-15 22:17:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:43,690 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 22:17:43,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:43,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240360766] [2022-03-15 22:17:43,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240360766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:43,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919808938] [2022-03-15 22:17:43,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:17:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:43,691 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 22:17:43,692 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 22:17:43,724 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:17:43,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:43,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:17:43,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:43,763 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 22:17:43,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:43,817 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 22:17:43,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919808938] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:43,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:43,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 22:17:43,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800775612] [2022-03-15 22:17:43,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:43,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:43,824 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:17:43,824 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:44,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [4502#(or (< j M) (< k N)), 4508#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4506#(or (< j M) (<= N k) (< (+ k 1) N)), 4492#(or (< j M) (<= k (+ i 1))), 4500#(or (<= N k) (< (+ k 1) N)), 4509#(or (<= N i) (< k N)), 4505#(or (< j M) (<= (+ N 1) i) (< k N)), 4510#(or (<= N i) (<= N k) (< (+ k 1) N)), 4504#(or (< j M) (<= (+ N 1) i)), 4507#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4511#(or (<= N i) (< j M)), 4515#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 4501#(< j M), 4499#(< k N), 4512#(or (<= N i) (< j M) (< k N)), 4514#(or (<= N (+ i 1)) (< j M)), 4513#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 4503#(or (<= (+ N 1) i) (< k N))] [2022-03-15 22:17:44,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:17:44,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:17:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:17:44,456 INFO L87 Difference]: Start difference. First operand 218 states and 741 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 22:17:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:45,154 INFO L93 Difference]: Finished difference Result 307 states and 974 transitions. [2022-03-15 22:17:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:17:45,154 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 22:17:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:45,156 INFO L225 Difference]: With dead ends: 307 [2022-03-15 22:17:45,156 INFO L226 Difference]: Without dead ends: 304 [2022-03-15 22:17:45,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=698, Invalid=2608, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:17:45,157 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:45,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:17:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-15 22:17:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 215. [2022-03-15 22:17:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.411214953271028) internal successors, (730), 214 states have internal predecessors, (730), 0 states have call successors, (0), 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:17:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 730 transitions. [2022-03-15 22:17:45,162 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 730 transitions. Word has length 15 [2022-03-15 22:17:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:45,162 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 730 transitions. [2022-03-15 22:17:45,163 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 22:17:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 730 transitions. [2022-03-15 22:17:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:45,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:45,163 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:45,179 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 22:17:45,371 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 22:17:45,372 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 833199328, now seen corresponding path program 3 times [2022-03-15 22:17:45,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:45,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898139702] [2022-03-15 22:17:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:45,542 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 22:17:45,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:45,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898139702] [2022-03-15 22:17:45,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898139702] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:45,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793942157] [2022-03-15 22:17:45,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:45,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:45,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:45,543 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 22:17:45,544 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 22:17:45,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:17:45,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:45,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:17:45,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:45,785 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:45,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 40 [2022-03-15 22:17:46,223 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 22:17:46,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:46,432 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:46,433 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 35 treesize of output 68 [2022-03-15 22:17:46,991 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 22:17:46,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793942157] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:46,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:46,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:17:46,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285701673] [2022-03-15 22:17:46,991 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:46,992 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:46,995 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:17:46,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:48,840 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [5412#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 5418#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 5415#(and (or (< (+ j 1) M) (<= (+ 2 k) N) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1))), 5422#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 5423#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 5429#(and (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (<= k i) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (<= k i) (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (<= (+ k j) (+ M i 1)) (<= k i) (not (< i N)) (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0))), 5428#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 5419#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 5420#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 5425#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 5417#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 5416#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 5424#(and (or (<= k i) (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (<= k i) (not (< i N)) (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (or (<= k i) (not (< i N)) (<= (+ (select A i) sum1) sum2))), 5421#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 5413#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 5427#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 5414#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 5426#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))))] [2022-03-15 22:17:48,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:17:48,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:17:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:17:48,841 INFO L87 Difference]: Start difference. First operand 215 states and 730 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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:17:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:53,836 INFO L93 Difference]: Finished difference Result 659 states and 1787 transitions. [2022-03-15 22:17:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 22:17:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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 22:17:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:53,839 INFO L225 Difference]: With dead ends: 659 [2022-03-15 22:17:53,839 INFO L226 Difference]: Without dead ends: 635 [2022-03-15 22:17:53,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3421 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1633, Invalid=9709, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 22:17:53,842 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 326 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:53,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 0 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:17:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-03-15 22:17:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 216. [2022-03-15 22:17:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.4232558139534883) internal successors, (736), 215 states have internal predecessors, (736), 0 states have call successors, (0), 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:17:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 736 transitions. [2022-03-15 22:17:53,848 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 736 transitions. Word has length 15 [2022-03-15 22:17:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:53,849 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 736 transitions. [2022-03-15 22:17:53,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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:17:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 736 transitions. [2022-03-15 22:17:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:53,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:53,849 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:53,866 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 22:17:54,064 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 22:17:54,065 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash -764809232, now seen corresponding path program 4 times [2022-03-15 22:17:54,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:54,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142036166] [2022-03-15 22:17:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:54,092 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 22:17:54,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:54,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142036166] [2022-03-15 22:17:54,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142036166] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:54,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498726211] [2022-03-15 22:17:54,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:54,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:54,094 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 22:17:54,095 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 22:17:54,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:54,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:54,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:17:54,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:54,166 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 22:17:54,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:54,218 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 22:17:54,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498726211] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:54,218 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:54,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 11 [2022-03-15 22:17:54,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822839107] [2022-03-15 22:17:54,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:54,219 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:54,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 103 transitions. [2022-03-15 22:17:54,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:54,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6732#(< i N), 6761#(or (<= N i) (< (+ i 1) N) (< j M)), 6757#(or (<= N i) (< (+ i 1) N)), 6759#(< j M), 6758#(or (<= (+ 3 i) N) (<= N i)), 6763#(or (< (+ j 1) M) (<= M j)), 6760#(or (< j M) (< i N)), 6762#(or (<= N i) (<= (+ 2 M i) (+ N j))), 6764#(or (< (+ 2 j) M) (<= M (+ j 1)))] [2022-03-15 22:17:54,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:17:54,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:17:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:17:54,523 INFO L87 Difference]: Start difference. First operand 216 states and 736 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:54,950 INFO L93 Difference]: Finished difference Result 520 states and 1668 transitions. [2022-03-15 22:17:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:17:54,951 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:17:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:54,953 INFO L225 Difference]: With dead ends: 520 [2022-03-15 22:17:54,953 INFO L226 Difference]: Without dead ends: 520 [2022-03-15 22:17:54,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:17:54,954 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:54,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:17:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-03-15 22:17:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 313. [2022-03-15 22:17:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 3.503205128205128) internal successors, (1093), 312 states have internal predecessors, (1093), 0 states have call successors, (0), 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:17:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 1093 transitions. [2022-03-15 22:17:54,962 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 1093 transitions. Word has length 15 [2022-03-15 22:17:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:54,962 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 1093 transitions. [2022-03-15 22:17:54,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 1093 transitions. [2022-03-15 22:17:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:54,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:54,963 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:54,981 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 22:17:55,181 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 22:17:55,181 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -519709146, now seen corresponding path program 5 times [2022-03-15 22:17:55,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:55,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937262306] [2022-03-15 22:17:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:55,295 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 22:17:55,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:55,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937262306] [2022-03-15 22:17:55,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937262306] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:55,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049162456] [2022-03-15 22:17:55,295 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:17:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:55,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:55,296 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 22:17:55,299 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 22:17:55,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:55,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:55,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:17:55,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:55,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:55,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:55,506 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 19 treesize of output 11 [2022-03-15 22:17:55,521 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 22:17:55,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:55,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:55,667 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:55,668 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 19 treesize of output 54 [2022-03-15 22:17:55,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:55,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:55,806 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:17:55,806 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 20 treesize of output 47 [2022-03-15 22:17:55,951 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 22:17:55,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049162456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:55,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:55,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:17:55,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873335604] [2022-03-15 22:17:55,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:55,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:55,955 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:17:55,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:57,195 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [8058#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)))), 8055#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 8061#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 8057#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 8052#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 8063#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (< k N)) (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N)) (< k N))), 8060#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1)))))), 8053#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 8054#(and (or (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< i N))), 8064#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< k N))), 8062#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 8056#(and (or (< k N) (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< k N) (< i N))), 8059#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N)))] [2022-03-15 22:17:57,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:17:57,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:57,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:17:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:17:57,196 INFO L87 Difference]: Start difference. First operand 313 states and 1093 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:59,386 INFO L93 Difference]: Finished difference Result 596 states and 1870 transitions. [2022-03-15 22:17:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:17:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:17:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:59,392 INFO L225 Difference]: With dead ends: 596 [2022-03-15 22:17:59,392 INFO L226 Difference]: Without dead ends: 584 [2022-03-15 22:17:59,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=641, Invalid=3781, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:17:59,393 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 341 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:59,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 0 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:17:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-15 22:17:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 318. [2022-03-15 22:17:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 3.5078864353312302) internal successors, (1112), 317 states have internal predecessors, (1112), 0 states have call successors, (0), 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:17:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1112 transitions. [2022-03-15 22:17:59,401 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 1112 transitions. Word has length 15 [2022-03-15 22:17:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:59,401 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 1112 transitions. [2022-03-15 22:17:59,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 1112 transitions. [2022-03-15 22:17:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:17:59,402 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:59,402 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:59,420 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 22:17:59,616 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 22:17:59,617 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1842155728, now seen corresponding path program 6 times [2022-03-15 22:17:59,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:59,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143079888] [2022-03-15 22:17:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:59,655 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 22:17:59,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:59,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143079888] [2022-03-15 22:17:59,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143079888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:59,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965942538] [2022-03-15 22:17:59,656 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:17:59,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:59,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:59,657 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 22:17:59,658 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 22:17:59,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:17:59,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:59,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:17:59,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:59,718 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 22:17:59,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:59,780 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 22:17:59,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965942538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:59,780 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:59,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:17:59,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991503001] [2022-03-15 22:17:59,780 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:59,783 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:59,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:17:59,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:00,739 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [9477#(or (< j M) (< k N) (< i N)), 9478#(or (<= (+ 2 k) N) (< j M)), 9496#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 9469#(or (<= N i) (< (+ i 1) N)), 9470#(< j M), 9494#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9495#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9468#(< i N), 9497#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 9475#(or (< k N) (< i N)), 9488#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 9492#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 9476#(or (<= (+ k 1) N) (< j M)), 9486#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 9487#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9461#(or (<= k i) (< j M)), 9482#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9472#(or (<= N i) (< (+ i 1) N) (< j M)), 9491#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 9471#(or (< j M) (< i N)), 9489#(or (<= (+ 2 k) i) (< j M)), 9483#(or (<= N i) (< (+ i 1) N) (< k N)), 9473#(or (<= N (+ i 1)) (< (+ 2 i) N)), 9481#(or (<= (+ 3 k) N) (< j M)), 9480#(or (<= (+ 2 k) N) (< j M) (< i N)), 9485#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9490#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9484#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9474#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9479#(or (<= (+ 2 k) N) (< i N)), 9493#(or (< j M) (<= (+ k 1) i))] [2022-03-15 22:18:00,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:18:00,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:18:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:18:00,740 INFO L87 Difference]: Start difference. First operand 318 states and 1112 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 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:18:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:02,544 INFO L93 Difference]: Finished difference Result 617 states and 2031 transitions. [2022-03-15 22:18:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:18:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 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 22:18:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:02,547 INFO L225 Difference]: With dead ends: 617 [2022-03-15 22:18:02,547 INFO L226 Difference]: Without dead ends: 617 [2022-03-15 22:18:02,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3286 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2472, Invalid=9518, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:18:02,550 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 392 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:02,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 0 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:18:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-03-15 22:18:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 384. [2022-03-15 22:18:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.587467362924282) internal successors, (1374), 383 states have internal predecessors, (1374), 0 states have call successors, (0), 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:18:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1374 transitions. [2022-03-15 22:18:02,560 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1374 transitions. Word has length 16 [2022-03-15 22:18:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:02,561 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 1374 transitions. [2022-03-15 22:18:02,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 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:18:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1374 transitions. [2022-03-15 22:18:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:02,562 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:02,562 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:02,584 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 22:18:02,778 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 22:18:02,778 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -772947566, now seen corresponding path program 7 times [2022-03-15 22:18:02,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:02,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117210031] [2022-03-15 22:18:02,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:02,828 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 22:18:02,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:02,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117210031] [2022-03-15 22:18:02,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117210031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:02,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899790350] [2022-03-15 22:18:02,829 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:18:02,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:02,830 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 22:18:02,831 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 22:18:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:02,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:02,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:02,940 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 22:18:02,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:02,971 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 22:18:02,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899790350] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:02,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:02,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:18:02,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [921637446] [2022-03-15 22:18:02,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:02,972 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:02,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:18:02,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:03,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11131#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 11133#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 11130#(or (<= N (+ k 1)) (< i N)), 11134#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 11126#(< i N), 11132#(or (<= N (+ i 1)) (< (+ 2 i) N)), 11129#(or (<= N i) (< (+ i 1) N) (<= N k)), 11128#(or (<= N k) (< i N)), 11127#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:18:03,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:18:03,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:03,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:18:03,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:18:03,410 INFO L87 Difference]: Start difference. First operand 384 states and 1374 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 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:18:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:04,105 INFO L93 Difference]: Finished difference Result 1085 states and 3837 transitions. [2022-03-15 22:18:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:18:04,105 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 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 22:18:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:04,110 INFO L225 Difference]: With dead ends: 1085 [2022-03-15 22:18:04,110 INFO L226 Difference]: Without dead ends: 1063 [2022-03-15 22:18:04,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=944, Invalid=2716, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:18:04,114 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:04,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:18:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-03-15 22:18:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 504. [2022-03-15 22:18:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 3.63220675944334) internal successors, (1827), 503 states have internal predecessors, (1827), 0 states have call successors, (0), 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:18:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1827 transitions. [2022-03-15 22:18:04,140 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1827 transitions. Word has length 16 [2022-03-15 22:18:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:04,141 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1827 transitions. [2022-03-15 22:18:04,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 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:18:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1827 transitions. [2022-03-15 22:18:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:04,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:04,142 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:04,160 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 22:18:04,351 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 22:18:04,351 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:04,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2110966522, now seen corresponding path program 6 times [2022-03-15 22:18:04,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:04,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120164368] [2022-03-15 22:18:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:04,394 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 22:18:04,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:04,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120164368] [2022-03-15 22:18:04,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120164368] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:04,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625080774] [2022-03-15 22:18:04,394 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:04,395 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 22:18:04,396 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 22:18:04,416 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:18:04,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:04,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:04,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:04,453 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 22:18:04,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:04,491 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 22:18:04,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625080774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:04,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:04,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:18:04,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [202925506] [2022-03-15 22:18:04,491 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:04,492 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:04,497 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:18:04,497 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:05,153 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [13417#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 13407#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 13405#(or (<= N i) (< (+ i 1) N) (<= N k)), 13408#(< j M), 13409#(or (< j M) (<= N k)), 13403#(or (<= N i) (< (+ i 1) N)), 13402#(< i N), 13410#(or (<= N (+ k 1)) (< j M)), 13412#(or (<= N i) (< (+ i 1) N) (< j M)), 13414#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 13419#(or (< (+ j 1) M) (<= i k) (<= M j)), 13418#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 13420#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 13416#(or (< j M) (<= i k)), 13411#(or (< j M) (< i N)), 13406#(or (<= N (+ i 1)) (< (+ 2 i) N)), 13413#(or (< j M) (<= N k) (< i N)), 13421#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 13404#(or (<= N k) (< i N)), 13415#(or (< j M) (<= i (+ k 1)))] [2022-03-15 22:18:05,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:18:05,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:18:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:18:05,154 INFO L87 Difference]: Start difference. First operand 504 states and 1827 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 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 22:18:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:06,937 INFO L93 Difference]: Finished difference Result 1352 states and 4675 transitions. [2022-03-15 22:18:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:18:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 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 16 [2022-03-15 22:18:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:06,943 INFO L225 Difference]: With dead ends: 1352 [2022-03-15 22:18:06,943 INFO L226 Difference]: Without dead ends: 1338 [2022-03-15 22:18:06,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2305, Invalid=8825, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 22:18:06,945 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 334 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:06,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 0 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:18:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-03-15 22:18:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 682. [2022-03-15 22:18:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 3.922173274596182) internal successors, (2671), 681 states have internal predecessors, (2671), 0 states have call successors, (0), 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:18:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2671 transitions. [2022-03-15 22:18:06,972 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2671 transitions. Word has length 16 [2022-03-15 22:18:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:06,972 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 2671 transitions. [2022-03-15 22:18:06,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 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 22:18:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2671 transitions. [2022-03-15 22:18:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:06,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:06,974 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:06,998 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 22:18:07,187 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 22:18:07,187 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash -687661098, now seen corresponding path program 7 times [2022-03-15 22:18:07,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:07,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630857065] [2022-03-15 22:18:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:07,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:07,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630857065] [2022-03-15 22:18:07,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630857065] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:07,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744230805] [2022-03-15 22:18:07,236 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:18:07,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:07,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:07,237 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 22:18:07,238 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 22:18:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:07,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:07,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:07,376 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 22:18:07,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744230805] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:07,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:07,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:18:07,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1015233046] [2022-03-15 22:18:07,376 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:07,377 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:07,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:18:07,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:08,143 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16405#(or (< j M) (<= (+ k 1) i)), 16399#(or (< k N) (< i N)), 16410#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 16400#(or (< j M) (< k N) (< i N)), 16411#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 16395#(or (<= (+ k 1) N) (< j M)), 16406#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 16408#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16414#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 16397#(< i N), 16404#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 16403#(or (<= N i) (< (+ i 1) N) (< j M)), 16415#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16413#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16407#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 16396#(or (<= (+ 2 k) N) (< j M)), 16402#(or (<= N i) (< (+ i 1) N) (< k N)), 16416#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 16417#(or (<= (+ k j) (+ M i 1)) (<= N i)), 16394#(< j M), 16412#(or (<= N i) (<= k (+ i 1))), 16398#(or (< j M) (< i N)), 16401#(or (<= N i) (< (+ i 1) N)), 16409#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 22:18:08,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:18:08,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:08,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:18:08,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:18:08,144 INFO L87 Difference]: Start difference. First operand 682 states and 2671 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:12,380 INFO L93 Difference]: Finished difference Result 2095 states and 6909 transitions. [2022-03-15 22:18:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:18:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:18:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:12,388 INFO L225 Difference]: With dead ends: 2095 [2022-03-15 22:18:12,389 INFO L226 Difference]: Without dead ends: 2095 [2022-03-15 22:18:12,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11810 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5679, Invalid=27993, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:18:12,391 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 638 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:12,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 0 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:18:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-03-15 22:18:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 946. [2022-03-15 22:18:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.061375661375662) internal successors, (3838), 945 states have internal predecessors, (3838), 0 states have call successors, (0), 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:18:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 3838 transitions. [2022-03-15 22:18:12,418 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 3838 transitions. Word has length 16 [2022-03-15 22:18:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:12,418 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 3838 transitions. [2022-03-15 22:18:12,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 3838 transitions. [2022-03-15 22:18:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:12,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:12,421 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:12,436 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 22:18:12,639 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 22:18:12,640 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 416737112, now seen corresponding path program 8 times [2022-03-15 22:18:12,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:12,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262906794] [2022-03-15 22:18:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:12,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:12,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262906794] [2022-03-15 22:18:12,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262906794] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:12,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621641717] [2022-03-15 22:18:12,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:12,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:12,688 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 22:18:12,689 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 22:18:12,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:12,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:12,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:18:12,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:12,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621641717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:12,834 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:12,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 22:18:12,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122275213] [2022-03-15 22:18:12,834 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:12,835 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:12,839 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:18:12,840 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:13,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [20801#(or (< (+ j 1) M) (<= M j)), 20808#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 20803#(or (< j M) (< i N)), 20804#(or (<= N i) (< (+ i 1) N) (< j M)), 20800#(< j M), 20802#(or (<= N i) (<= (+ 2 i) N)), 20809#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 20806#(or (< (+ 2 j) M) (<= M (+ j 1))), 20805#(or (<= N i) (<= (+ M i 1) (+ N j))), 20807#(or (<= N (+ i 1)) (<= (+ 3 i) N))] [2022-03-15 22:18:13,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:18:13,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:18:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:18:13,298 INFO L87 Difference]: Start difference. First operand 946 states and 3838 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:14,162 INFO L93 Difference]: Finished difference Result 2684 states and 9854 transitions. [2022-03-15 22:18:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:18:14,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:18:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:14,174 INFO L225 Difference]: With dead ends: 2684 [2022-03-15 22:18:14,175 INFO L226 Difference]: Without dead ends: 2684 [2022-03-15 22:18:14,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:18:14,175 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:14,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:18:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2022-03-15 22:18:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1140. [2022-03-15 22:18:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 4.183494293239684) internal successors, (4765), 1139 states have internal predecessors, (4765), 0 states have call successors, (0), 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:18:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 4765 transitions. [2022-03-15 22:18:14,211 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 4765 transitions. Word has length 16 [2022-03-15 22:18:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:14,211 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 4765 transitions. [2022-03-15 22:18:14,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 4765 transitions. [2022-03-15 22:18:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:14,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:14,215 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:14,233 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 22:18:14,432 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 22:18:14,432 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 661837198, now seen corresponding path program 9 times [2022-03-15 22:18:14,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:14,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003077453] [2022-03-15 22:18:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:14,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:14,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003077453] [2022-03-15 22:18:14,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003077453] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:14,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383631066] [2022-03-15 22:18:14,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:14,484 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 22:18:14,484 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 22:18:14,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:18:14,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:14,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:14,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:14,588 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 22:18:14,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:14,674 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 22:18:14,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383631066] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:14,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:14,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:18:14,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [735217193] [2022-03-15 22:18:14,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:14,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:14,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:18:14,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:15,432 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [25959#(or (<= (+ 2 k j) (+ N M)) (< i N)), 25944#(or (<= (+ j 1) M) (< i N)), 25947#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 25943#(or (<= N i) (< (+ i 1) N) (< k N)), 25951#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 25953#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 25952#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 25960#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 25963#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 25939#(< i N), 25945#(or (<= N i) (< (+ i 1) N) (< j M)), 25950#(or (<= (+ 2 j) M) (< i N)), 25961#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 25954#(or (< k N) (<= (+ j 1) M)), 25940#(or (<= N i) (< (+ i 1) N)), 25955#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 25956#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 25957#(or (< j M) (< k N) (< i N)), 25941#(< k N), 25946#(or (<= N (+ i 1)) (< (+ 2 i) N)), 25958#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 25948#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 25964#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 25962#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 25949#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 25942#(or (< k N) (< i N))] [2022-03-15 22:18:15,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:18:15,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:18:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:18:15,433 INFO L87 Difference]: Start difference. First operand 1140 states and 4765 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 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:18:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:18,587 INFO L93 Difference]: Finished difference Result 2135 states and 7891 transitions. [2022-03-15 22:18:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:18:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 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 22:18:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:18,597 INFO L225 Difference]: With dead ends: 2135 [2022-03-15 22:18:18,598 INFO L226 Difference]: Without dead ends: 2135 [2022-03-15 22:18:18,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7429 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4412, Invalid=19768, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:18:18,599 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 504 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:18,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 0 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:18:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2022-03-15 22:18:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1312. [2022-03-15 22:18:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 4.276125095347063) internal successors, (5606), 1311 states have internal predecessors, (5606), 0 states have call successors, (0), 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:18:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 5606 transitions. [2022-03-15 22:18:18,634 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 5606 transitions. Word has length 16 [2022-03-15 22:18:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:18,634 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 5606 transitions. [2022-03-15 22:18:18,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 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:18:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 5606 transitions. [2022-03-15 22:18:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:18,638 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:18,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:18,657 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 22:18:18,854 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 22:18:18,855 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1488485624, now seen corresponding path program 10 times [2022-03-15 22:18:18,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:18,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205460007] [2022-03-15 22:18:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:18,891 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 22:18:18,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:18,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205460007] [2022-03-15 22:18:18,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205460007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:18,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011388768] [2022-03-15 22:18:18,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:18:18,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:18,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:18,893 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 22:18:18,894 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 22:18:18,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:18:18,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:18,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:18,993 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 22:18:18,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:19,071 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 22:18:19,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011388768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:19,071 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:19,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:18:19,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484182346] [2022-03-15 22:18:19,072 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:19,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:19,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:18:19,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:19,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31056#(or (< j M) (< i N)), 31061#(or (<= N (+ i 1)) (< (+ 2 i) N)), 31063#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 31059#(or (<= N k) (< i N)), 31058#(or (<= N i) (< (+ i 1) N) (< j M)), 31066#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 31057#(or (<= N i) (< (+ i 1) N)), 31062#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 31054#(< i N), 31065#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 31060#(or (<= N i) (< (+ i 1) N) (<= N k)), 31064#(or (<= (+ N M) (+ k j 1)) (< i N)), 31055#(< j M)] [2022-03-15 22:18:19,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:18:19,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:18:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:18:19,504 INFO L87 Difference]: Start difference. First operand 1312 states and 5606 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 22:18:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:20,935 INFO L93 Difference]: Finished difference Result 4192 states and 16930 transitions. [2022-03-15 22:18:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:18:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 16 [2022-03-15 22:18:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:20,953 INFO L225 Difference]: With dead ends: 4192 [2022-03-15 22:18:20,953 INFO L226 Difference]: Without dead ends: 4137 [2022-03-15 22:18:20,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2284 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:18:20,954 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:20,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2022-03-15 22:18:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 1974. [2022-03-15 22:18:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 4.596553471870249) internal successors, (9069), 1973 states have internal predecessors, (9069), 0 states have call successors, (0), 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:18:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 9069 transitions. [2022-03-15 22:18:21,026 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 9069 transitions. Word has length 16 [2022-03-15 22:18:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:21,026 INFO L470 AbstractCegarLoop]: Abstraction has 1974 states and 9069 transitions. [2022-03-15 22:18:21,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 22:18:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 9069 transitions. [2022-03-15 22:18:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:21,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:21,032 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:21,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:21,247 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 22:18:21,248 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2034886336, now seen corresponding path program 11 times [2022-03-15 22:18:21,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:21,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286604372] [2022-03-15 22:18:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:21,284 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 22:18:21,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:21,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286604372] [2022-03-15 22:18:21,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286604372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:21,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320021146] [2022-03-15 22:18:21,285 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:18:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:21,286 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 22:18:21,287 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 22:18:21,310 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:21,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:21,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:21,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:21,387 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 22:18:21,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:21,468 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 22:18:21,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320021146] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:21,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:21,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:18:21,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536394022] [2022-03-15 22:18:21,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:21,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:21,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:18:21,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:21,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [39434#(or (<= N i) (< (+ i 1) N) (<= M j)), 39440#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 39435#(or (<= N (+ i 1)) (< (+ 2 i) N)), 39436#(< k N), 39438#(or (<= N i) (< (+ i 1) N) (< k N)), 39433#(or (< i N) (<= M j)), 39439#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 39437#(or (< k N) (< i N)), 39443#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 39441#(or (<= (+ N M) (+ k j 1)) (< i N)), 39432#(or (<= N i) (< (+ i 1) N)), 39442#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 39431#(< i N)] [2022-03-15 22:18:21,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:18:21,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:21,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:18:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:18:21,891 INFO L87 Difference]: Start difference. First operand 1974 states and 9069 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 22:18:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:23,756 INFO L93 Difference]: Finished difference Result 4098 states and 16712 transitions. [2022-03-15 22:18:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:18:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 16 [2022-03-15 22:18:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:23,789 INFO L225 Difference]: With dead ends: 4098 [2022-03-15 22:18:23,789 INFO L226 Difference]: Without dead ends: 4039 [2022-03-15 22:18:23,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4859 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2783, Invalid=11259, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:18:23,791 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:23,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2022-03-15 22:18:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2108. [2022-03-15 22:18:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 4.643569055529189) internal successors, (9784), 2107 states have internal predecessors, (9784), 0 states have call successors, (0), 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:18:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 9784 transitions. [2022-03-15 22:18:23,860 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 9784 transitions. Word has length 16 [2022-03-15 22:18:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:23,862 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 9784 transitions. [2022-03-15 22:18:23,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 22:18:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 9784 transitions. [2022-03-15 22:18:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:23,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:23,869 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:23,892 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 22:18:24,081 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 22:18:24,081 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1272142052, now seen corresponding path program 8 times [2022-03-15 22:18:24,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:24,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84827444] [2022-03-15 22:18:24,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:24,269 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 22:18:24,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:24,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84827444] [2022-03-15 22:18:24,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84827444] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:24,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484428550] [2022-03-15 22:18:24,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:24,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:24,270 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 22:18:24,273 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 22:18:24,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:24,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:24,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:18:24,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:24,494 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 28 treesize of output 16 [2022-03-15 22:18:24,509 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 22:18:24,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:24,715 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:18:24,715 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 31 treesize of output 96 [2022-03-15 22:18:24,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:24,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:24,943 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 22:18:25,017 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 22:18:25,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484428550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:25,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:25,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 22:18:25,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620546533] [2022-03-15 22:18:25,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:25,019 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:25,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:18:25,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:29,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [48054#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 48067#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 48056#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 48093#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 48089#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 48080#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 48062#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 48063#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 48066#(and (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N)) (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N)) (or (< j M) (<= (+ (select A (+ (- 2) N)) (select A k) (select A (+ (- 1) N))) sum1) (< (+ 3 k) N)) (or (< j M) (<= sum1 (+ (select A (+ (- 2) N)) (select A k) (select A (+ (- 1) N)))) (< (+ 3 k) N))), 48084#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= sum1 (select A k))) (or (< j M) (<= (+ k 1) i))), 48058#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 48055#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 48065#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 48085#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 48090#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 48083#(and (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 48077#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 48088#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 48069#(and (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (<= sum1 (+ sum2 (select A k) (select A (+ (- 1) N)))) (< i N)) (or (< (+ 2 k) N) (<= (+ sum2 (select A k) (select A (+ (- 1) N))) sum1) (< i N))), 48073#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 48071#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N)))), 48064#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 48068#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 48072#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 48059#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 48074#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (< j M) (not (< i N)))), 48078#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 48079#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 48086#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 48060#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 48081#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 48091#(and (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N))), 48057#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 48092#(and (or (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 48075#(and (or (<= sum1 (+ (select A (+ (- 1) i)) (select A k))) (< j M) (< (+ 2 k) i)) (or (= sum2 0) (< j M) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (<= (+ (select A (+ (- 1) i)) (select A k)) sum1) (< (+ 2 k) i))), 48070#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (< i N))), 48082#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 48061#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 48076#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 48087#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)))] [2022-03-15 22:18:29,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:18:29,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:18:29,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=3522, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:18:29,201 INFO L87 Difference]: Start difference. First operand 2108 states and 9784 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:46,848 INFO L93 Difference]: Finished difference Result 3015 states and 12757 transitions. [2022-03-15 22:18:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-03-15 22:18:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:46,857 INFO L225 Difference]: With dead ends: 3015 [2022-03-15 22:18:46,857 INFO L226 Difference]: Without dead ends: 2973 [2022-03-15 22:18:46,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 32 SyntacticMatches, 13 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16518 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=6819, Invalid=40487, Unknown=0, NotChecked=0, Total=47306 [2022-03-15 22:18:46,859 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 859 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:46,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 0 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:18:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-03-15 22:18:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2215. [2022-03-15 22:18:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 4.625112917795844) internal successors, (10240), 2214 states have internal predecessors, (10240), 0 states have call successors, (0), 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:18:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 10240 transitions. [2022-03-15 22:18:46,909 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 10240 transitions. Word has length 17 [2022-03-15 22:18:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:46,909 INFO L470 AbstractCegarLoop]: Abstraction has 2215 states and 10240 transitions. [2022-03-15 22:18:46,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 10240 transitions. [2022-03-15 22:18:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:46,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:46,915 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:46,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:47,130 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 22:18:47,130 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2114457254, now seen corresponding path program 9 times [2022-03-15 22:18:47,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:47,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698311409] [2022-03-15 22:18:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:47,181 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 22:18:47,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:47,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698311409] [2022-03-15 22:18:47,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698311409] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:47,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811641627] [2022-03-15 22:18:47,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:47,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:47,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:47,183 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 22:18:47,183 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 22:18:47,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:18:47,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:47,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:18:47,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:47,247 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 22:18:47,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:47,309 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 22:18:47,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811641627] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:47,309 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:47,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 22:18:47,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1558776968] [2022-03-15 22:18:47,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:47,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:47,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:18:47,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:48,444 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [55970#(or (<= N k) (< (+ k 1) N)), 55973#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 55983#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 55968#(or (<= N i) (< j M) (< k N)), 55975#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 55958#(< k N), 55971#(or (< j M) (<= N k) (< (+ k 1) N)), 55966#(or (< j M) (< k N)), 55981#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 55979#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 55959#(or (<= (+ N 1) i) (< k N)), 55963#(or (< j M) (<= (+ N 1) i)), 55976#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 55960#(or (<= N i) (< k N)), 55987#(or (< j M) (<= k (+ 2 i))), 55986#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 55974#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 55980#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 55964#(or (<= N i) (< j M)), 55962#(< j M), 55978#(or (<= N i) (<= N k) (< (+ k 1) N)), 55951#(or (< j M) (<= k (+ i 1))), 55985#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 55961#(or (<= N (+ i 1)) (< k N)), 55965#(or (<= N (+ i 1)) (< j M)), 55984#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 55988#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 55972#(or (<= N (+ k 1)) (< (+ 2 k) N)), 55982#(or (<= N (+ 2 i)) (< j M)), 55969#(or (<= N (+ i 1)) (< j M) (< k N)), 55967#(or (< j M) (<= (+ N 1) i) (< k N)), 55977#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N))] [2022-03-15 22:18:48,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:18:48,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:18:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1765, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:18:48,445 INFO L87 Difference]: Start difference. First operand 2215 states and 10240 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 22:18:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:50,610 INFO L93 Difference]: Finished difference Result 2815 states and 12315 transitions. [2022-03-15 22:18:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 22:18:50,611 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 22:18:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:50,620 INFO L225 Difference]: With dead ends: 2815 [2022-03-15 22:18:50,620 INFO L226 Difference]: Without dead ends: 2799 [2022-03-15 22:18:50,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3325 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2699, Invalid=10411, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 22:18:50,621 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:50,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:18:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2022-03-15 22:18:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2316. [2022-03-15 22:18:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2315 states have (on average 4.6030237580993525) internal successors, (10656), 2315 states have internal predecessors, (10656), 0 states have call successors, (0), 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:18:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 10656 transitions. [2022-03-15 22:18:50,678 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 10656 transitions. Word has length 17 [2022-03-15 22:18:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:50,678 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 10656 transitions. [2022-03-15 22:18:50,678 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 22:18:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 10656 transitions. [2022-03-15 22:18:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:50,684 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:50,684 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:50,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 22:18:50,899 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 22:18:50,899 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2888034, now seen corresponding path program 12 times [2022-03-15 22:18:50,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:50,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298435012] [2022-03-15 22:18:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:51,058 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 22:18:51,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:51,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298435012] [2022-03-15 22:18:51,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298435012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:51,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380392543] [2022-03-15 22:18:51,058 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:51,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:51,059 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 22:18:51,060 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 22:18:51,081 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:18:51,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:51,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:18:51,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:51,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:51,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:51,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:51,308 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 29 treesize of output 17 [2022-03-15 22:18:51,325 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 22:18:51,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:51,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:51,545 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:18:51,545 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 29 treesize of output 114 [2022-03-15 22:18:52,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:52,966 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:18:52,966 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 29 treesize of output 72 [2022-03-15 22:18:53,166 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 22:18:53,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380392543] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:53,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:53,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 22:18:53,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225808963] [2022-03-15 22:18:53,167 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:53,168 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:53,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:18:53,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:56,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [63700#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 63706#(and (or (not (< (+ j 1) M)) (<= (+ k 1) N) (= (+ (select A i) (* (- 1) (select A k))) 0) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2))) (or (not (< (+ j 1) M)) (= (+ (select A i) (* (- 1) (select A k))) 0) (< (+ 2 j) M) (< i (+ k 1))) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ 2 i) N) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1))), 63709#(and (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) sum1) sum2)) (or (<= (+ k 1) N) (< j M)) (or (<= (+ i 1) k) (< j M)) (or (<= (+ 3 i) N) (< j M) (<= sum2 (+ (select A i) sum1)))), 63711#(and (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ k 1) N) (< (+ 2 j) M)) (or (<= (+ 3 i) N) (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1)) (< (+ 2 j) M)) (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ j 1)) sum2)) (<= (+ 3 i) N) (not (< (+ j 1) M)) (< (+ 2 j) M))), 63702#(and (or (< j M) (= (+ (select A i) (* (- 1) (select A k))) 0) (< i (+ k 1))) (or (<= (+ k 1) N) (< j M) (= (+ (select A i) (* (- 1) (select A k))) 0)) (or (< j M) (<= sum2 sum1) (<= (+ 2 i) N)) (or (<= sum1 sum2) (< j M) (<= (+ 2 i) N))), 63698#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)))), 63696#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 63693#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 63701#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 63707#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 63708#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 63699#(and (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)) (< i N)) (or (< (+ j 1) M) (not (< j M)) (< i N) (<= (+ (select A j) sum2 (select A k)) sum1))), 63710#(and (or (<= (+ 3 i) N) (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ j 1) M) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (not (< j M))) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)))), 63703#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2) sum1) (<= (+ 2 i) N)) (or (< (+ j 1) M) (= (+ (select A i) (* (- 1) (select A k))) 0) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (<= (+ k 1) N) (= (+ (select A i) (* (- 1) (select A k))) 0) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= sum1 (+ (select A j) sum2)) (<= (+ 2 i) N))), 63697#(and (or (< j M) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (< j M) (<= sum1 (+ sum2 (select A k))) (< i N))), 63713#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 63705#(and (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (not (< (+ j 1) M)) (< (+ 2 j) M) (< i N)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (< (+ 2 j) M) (< i N))), 63694#(and (or (< j M) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum2 (select A k))))), 63704#(and (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (< (+ 2 j) M)) (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (not (< (+ j 1) M)) (< (+ 2 j) M))), 63695#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 63712#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))))] [2022-03-15 22:18:56,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:18:56,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:18:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:18:56,261 INFO L87 Difference]: Start difference. First operand 2316 states and 10656 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 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 22:19:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:05,301 INFO L93 Difference]: Finished difference Result 3976 states and 15449 transitions. [2022-03-15 22:19:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:19:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 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 17 [2022-03-15 22:19:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:05,312 INFO L225 Difference]: With dead ends: 3976 [2022-03-15 22:19:05,312 INFO L226 Difference]: Without dead ends: 3944 [2022-03-15 22:19:05,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2229, Invalid=13271, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 22:19:05,313 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 350 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:05,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 0 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:19:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2022-03-15 22:19:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 2434. [2022-03-15 22:19:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 4.577887381833128) internal successors, (11138), 2433 states have internal predecessors, (11138), 0 states have call successors, (0), 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:19:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 11138 transitions. [2022-03-15 22:19:05,376 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 11138 transitions. Word has length 17 [2022-03-15 22:19:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:05,377 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 11138 transitions. [2022-03-15 22:19:05,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 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 22:19:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 11138 transitions. [2022-03-15 22:19:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:05,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:05,382 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:05,400 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 22:19:05,601 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 22:19:05,601 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash -778125788, now seen corresponding path program 13 times [2022-03-15 22:19:05,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:05,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983539819] [2022-03-15 22:19:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:05,804 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 22:19:05,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:05,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983539819] [2022-03-15 22:19:05,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983539819] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:05,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377470782] [2022-03-15 22:19:05,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:05,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:05,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:05,805 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 22:19:05,806 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 22:19:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:05,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:19:05,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:06,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:06,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:19:06,125 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2022-03-15 22:19:06,172 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 22:19:06,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:06,541 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:19:06,542 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 56 treesize of output 141 [2022-03-15 22:19:12,441 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 22:19:12,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377470782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:12,441 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:12,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 22:19:12,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1491216422] [2022-03-15 22:19:12,441 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:12,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:12,448 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:19:12,448 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:14,735 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [72850#(and (or (not (<= k i)) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ M i) (+ N j)) (not (< j M)) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1)) (or (<= (+ k 1) N) (<= k i) (not (< j M))) (or (<= (+ M i) (+ 2 k j)) (<= (+ M i) (+ N j)) (< i (+ k 1)) (<= M j)) (or (not (= k i)) (<= (+ M i) (+ N j)) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2)) (<= M j))), 72845#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 72842#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 72858#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)) (<= M j)) (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N) (<= M j))), 72843#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 72844#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 72853#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N)) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< (+ (select A j) sum2) (+ (select A i) sum1 1)) (<= M j))), 72847#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 72852#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 72857#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1)) 1)) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (<= M j))), 72846#(and (or (<= sum1 (+ (select A j) sum2)) (< i N) (<= M j)) (or (< (+ (select A j) sum2) (+ sum1 1)) (< i N) (<= M j))), 72855#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 72848#(and (or (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (<= M (+ j 1))) (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (<= M (+ j 1)))), 72856#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 72854#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 72851#(and (or (<= (+ M 1) N) (not (< j M))) (or (not (<= (+ j 1) i)) (not (< j M)) (<= (+ (select A j) sum2) sum1)) (or (not (<= (+ j 1) i)) (not (< j M)) (<= sum1 (+ (select A j) sum2))) (or (< i (+ 2 j)) (<= M j)) (or (not (<= (+ j 1) i)) (not (< j M)) (<= (+ M i) (+ k j 1))) (or (<= (+ k 1) N) (not (< j M)))), 72849#(and (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (<= M (+ j 1)) (< i N)) (or (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (<= M (+ j 1)) (< i N)))] [2022-03-15 22:19:14,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:19:14,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:19:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:19:14,736 INFO L87 Difference]: Start difference. First operand 2434 states and 11138 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 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 22:19:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:41,368 INFO L93 Difference]: Finished difference Result 5708 states and 20982 transitions. [2022-03-15 22:19:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-03-15 22:19:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 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 17 [2022-03-15 22:19:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:41,380 INFO L225 Difference]: With dead ends: 5708 [2022-03-15 22:19:41,380 INFO L226 Difference]: Without dead ends: 5675 [2022-03-15 22:19:41,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17475 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=8070, Invalid=39672, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 22:19:41,382 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 635 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:41,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 0 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:19:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5675 states. [2022-03-15 22:19:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5675 to 2560. [2022-03-15 22:19:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 4.572880031262212) internal successors, (11702), 2559 states have internal predecessors, (11702), 0 states have call successors, (0), 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:19:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 11702 transitions. [2022-03-15 22:19:41,443 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 11702 transitions. Word has length 17 [2022-03-15 22:19:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:41,443 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 11702 transitions. [2022-03-15 22:19:41,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 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 22:19:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 11702 transitions. [2022-03-15 22:19:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:41,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:41,449 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:41,466 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 22:19:41,654 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 22:19:41,655 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 157231774, now seen corresponding path program 14 times [2022-03-15 22:19:41,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:41,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588369894] [2022-03-15 22:19:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:41,835 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 22:19:41,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:41,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588369894] [2022-03-15 22:19:41,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588369894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:41,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721291259] [2022-03-15 22:19:41,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:19:41,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:41,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:41,837 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 22:19:41,838 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 22:19:41,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:19:41,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:41,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:19:41,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:42,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:42,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:42,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:42,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:42,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:42,100 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 30 treesize of output 16 [2022-03-15 22:19:42,114 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 22:19:42,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:42,351 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:19:42,351 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 30 treesize of output 115 [2022-03-15 22:19:43,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:43,108 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:19:43,108 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 29 treesize of output 72 [2022-03-15 22:19:43,283 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 22:19:43,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721291259] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:43,284 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:43,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:19:43,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099509124] [2022-03-15 22:19:43,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:43,285 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:43,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:19:43,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:46,777 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [84173#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 84166#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 84171#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 84179#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 84172#(and (or (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (not (< i N)) (<= k (+ i 1))) (or (= (select A k) (select A (+ i 1))) (not (< i N))) (or (not (< i N)) (<= (+ (select A i) sum1) sum2))), 84163#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 84174#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 84162#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 84189#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 84165#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 84164#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 84176#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 84181#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 84177#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 84169#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 84187#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 84191#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 84170#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 84190#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 84168#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 84180#(and (or (<= (+ 3 k) N) (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) sum2 (select A k)) sum1) (not (< j M))) (or (<= (+ 3 k) N) (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 84178#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 84186#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 84160#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 84167#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 84184#(and (or (< j M) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum2 (select A k)))) (or (< j M) (<= (+ k 1) i))), 84161#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 84188#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 84185#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M)))), 84182#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 84183#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 84175#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 84192#(and (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (not (< i N)) (<= sum2 (+ (select A i) sum1))) (or (not (= (+ (* (- 1) (select A k)) (select A (+ i 1))) 0)) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (= (select A k) (select A (+ i 1))) (< i k) (not (< i N))) (or (<= (+ k j) (+ M i 1)) (not (< i N))))] [2022-03-15 22:19:46,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:19:46,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:19:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2931, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:19:46,778 INFO L87 Difference]: Start difference. First operand 2560 states and 11702 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 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:20:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:09,213 INFO L93 Difference]: Finished difference Result 4670 states and 17786 transitions. [2022-03-15 22:20:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2022-03-15 22:20:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 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 17 [2022-03-15 22:20:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:09,224 INFO L225 Difference]: With dead ends: 4670 [2022-03-15 22:20:09,224 INFO L226 Difference]: Without dead ends: 4600 [2022-03-15 22:20:09,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 35 SyntacticMatches, 14 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23794 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=8380, Invalid=59480, Unknown=0, NotChecked=0, Total=67860 [2022-03-15 22:20:09,227 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 861 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:09,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 0 Invalid, 4081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:20:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2022-03-15 22:20:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 2584. [2022-03-15 22:20:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2583 states have (on average 4.569879984514131) internal successors, (11804), 2583 states have internal predecessors, (11804), 0 states have call successors, (0), 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:20:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 11804 transitions. [2022-03-15 22:20:09,308 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 11804 transitions. Word has length 17 [2022-03-15 22:20:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:09,308 INFO L470 AbstractCegarLoop]: Abstraction has 2584 states and 11804 transitions. [2022-03-15 22:20:09,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 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:20:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 11804 transitions. [2022-03-15 22:20:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:09,315 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:09,315 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:09,356 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 22:20:09,529 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 22:20:09,529 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -965868444, now seen corresponding path program 15 times [2022-03-15 22:20:09,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:09,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880845836] [2022-03-15 22:20:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:09,851 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 22:20:09,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:09,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880845836] [2022-03-15 22:20:09,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880845836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:09,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111318245] [2022-03-15 22:20:09,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:20:09,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:09,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:09,853 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 22:20:09,854 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 22:20:09,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:20:09,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:09,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:20:09,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:10,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:10,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:20:10,182 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 36 [2022-03-15 22:20:10,208 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 22:20:10,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:10,550 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:20:10,550 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 56 treesize of output 141 [2022-03-15 22:20:14,675 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 22:20:14,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111318245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:14,676 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:14,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 22:20:14,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180833492] [2022-03-15 22:20:14,676 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:14,677 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:14,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 22:20:14,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:18,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [94573#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 94590#(and (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N)) (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 94595#(and (or (<= (+ k 1) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= j 0) (< k N)) (or (<= (+ k 1) N) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2)) (< (+ 3 i) N) (< (+ 2 k) (+ N M))) (or (<= (+ k 1) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ 2 k) (+ N M)))), 94577#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N))) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)))), 94579#(and (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ j 1)) sum2)) (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (not (< i N)) (= j 0)) (or (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1)) (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)))), 94575#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94589#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= j 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= 2 M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) sum2)))), 94594#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= j 0) (< k N)) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 2 k) (+ N M))) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (< (+ 2 k) (+ N M)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2))) (or (not (< (+ i 1) N)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ 2 k) (+ N M)))), 94572#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94561#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 94562#(and (or (< sum2 (+ sum1 1)) (<= (+ j 1) M) (< i N)) (or (<= sum1 sum2) (<= (+ j 1) M) (< i N))), 94582#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 94581#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ j 1) M)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ j 1) M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94576#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (<= (+ j 1) M)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (<= (+ j 1) M))), 94563#(and (or (<= (+ 2 j) M) (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ 2 j) M) (<= (+ (select A j) sum2) sum1) (< i N))), 94580#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ j 1) M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (<= (+ j 1) M))), 94591#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= 2 M)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (= j 0)) (or (not (< (+ 2 i) N)) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 3 j) M) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) sum2)) (<= (+ 3 j) M) (< (+ 3 i) N))), 94565#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 94570#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 94586#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 94568#(and (or (<= (+ 2 j) M) (< k N) (<= sum1 (+ (select A j) sum2))) (or (<= (+ 2 j) M) (<= (+ (select A j) sum2) sum1) (< k N))), 94566#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 94592#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 94571#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 94584#(and (or (<= (+ k 1) N) (= j 0) (< i N)) (or (<= (+ k 1) N) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) sum1) (< (+ 2 k) (+ N M)) (< i N)) (or (<= sum1 (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2)) (<= (+ k 1) N) (< (+ 2 k) (+ N M)) (< i N)) (or (<= (+ k 1) N) (<= (+ 2 k) (+ N M)) (< i N))), 94578#(and (or (<= 2 M) (< i N)) (or (<= (+ 3 j) M) (< i N) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2))) (or (= j 0) (< i N)) (or (<= (+ 3 j) M) (< i N) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1))), 94588#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< k N))), 94587#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)))), 94593#(and (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (<= (+ 2 j) M) (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N) (< k N))), 94564#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 94569#(and (or (<= (+ 2 j) M) (<= (+ (select A j) sum2) sum1) (< k N) (< i N)) (or (<= (+ 2 j) M) (< k N) (<= sum1 (+ (select A j) sum2)) (< i N))), 94583#(and (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (< k N)) (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N))), 94585#(and (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ 2 k) (+ N M))) (or (< (+ i 1) N) (not (< i N)) (= j 0) (< k N)) (or (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2) (+ (select A i) sum1)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) (+ N M))) (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) sum2)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) (+ N M)))), 94574#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 94567#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N)))] [2022-03-15 22:20:18,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:20:18,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:20:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=3452, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 22:20:18,422 INFO L87 Difference]: Start difference. First operand 2584 states and 11804 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 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:20:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:43,188 INFO L93 Difference]: Finished difference Result 3858 states and 15862 transitions. [2022-03-15 22:20:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-15 22:20:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 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 17 [2022-03-15 22:20:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:43,198 INFO L225 Difference]: With dead ends: 3858 [2022-03-15 22:20:43,198 INFO L226 Difference]: Without dead ends: 3833 [2022-03-15 22:20:43,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17828 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=7292, Invalid=43558, Unknown=0, NotChecked=0, Total=50850 [2022-03-15 22:20:43,201 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1080 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:43,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1080 Valid, 0 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:20:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2022-03-15 22:20:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 2611. [2022-03-15 22:20:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2610 states have (on average 4.563218390804598) internal successors, (11910), 2610 states have internal predecessors, (11910), 0 states have call successors, (0), 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:20:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 11910 transitions. [2022-03-15 22:20:43,286 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 11910 transitions. Word has length 17 [2022-03-15 22:20:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:43,286 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 11910 transitions. [2022-03-15 22:20:43,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 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:20:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 11910 transitions. [2022-03-15 22:20:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:43,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:43,292 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:43,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:20:43,507 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 22:20:43,508 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:43,508 INFO L85 PathProgramCache]: Analyzing trace with hash 779712672, now seen corresponding path program 16 times [2022-03-15 22:20:43,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:43,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058164051] [2022-03-15 22:20:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:43,725 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 22:20:43,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:43,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058164051] [2022-03-15 22:20:43,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058164051] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:43,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488553110] [2022-03-15 22:20:43,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:20:43,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:43,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:43,727 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 22:20:43,727 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 22:20:43,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:20:43,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:43,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:20:43,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:43,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:43,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:43,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:43,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:43,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:43,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:43,984 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 30 treesize of output 16 [2022-03-15 22:20:43,999 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 22:20:43,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:44,261 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:20:44,261 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 30 treesize of output 115 [2022-03-15 22:20:45,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:45,344 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:20:45,344 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 29 treesize of output 72 [2022-03-15 22:20:45,508 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 22:20:45,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488553110] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:45,509 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:45,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:20:45,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032724497] [2022-03-15 22:20:45,509 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:45,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:45,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 121 transitions. [2022-03-15 22:20:45,514 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:48,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [104139#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 104129#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 104144#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 104124#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 104145#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 104131#(and (or (<= (+ 2 k) N) (<= sum1 (+ (select A j) sum2 (select A k))) (<= 2 M) (< i N)) (or (<= (+ 2 k) N) (= j 0) (< i N)) (or (<= (+ 2 k) N) (<= 2 M) (< i N) (<= (+ (select A j) sum2 (select A k)) sum1))), 104123#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 104138#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 104125#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 104128#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 104151#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 2 M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 2 M) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (= j 0))), 104143#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 104150#(and (or (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= 2 M) (<= (+ (select A i) sum1) (+ (select A j) sum2 (select A k)))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= j 0))), 104148#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 104149#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 104141#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 104126#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 104127#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 104135#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 104132#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 104137#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 104147#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 104134#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 104130#(and (or (<= (+ 2 k) N) (<= (+ j 1) M) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (<= (+ j 1) M) (< i N))), 104136#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 104140#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 104142#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 104133#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 104152#(and (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (= j 0)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (<= 2 M)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 104146#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))))] [2022-03-15 22:20:48,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:20:48,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:48,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:20:48,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2712, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 22:20:48,389 INFO L87 Difference]: Start difference. First operand 2611 states and 11910 transitions. Second operand has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:12,971 INFO L93 Difference]: Finished difference Result 3751 states and 15470 transitions. [2022-03-15 22:21:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2022-03-15 22:21:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:12,980 INFO L225 Difference]: With dead ends: 3751 [2022-03-15 22:21:12,980 INFO L226 Difference]: Without dead ends: 3719 [2022-03-15 22:21:12,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13460 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=6036, Invalid=34970, Unknown=0, NotChecked=0, Total=41006 [2022-03-15 22:21:12,982 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 955 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:12,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 0 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 22:21:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-03-15 22:21:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 2635. [2022-03-15 22:21:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 4.56795747911921) internal successors, (12032), 2634 states have internal predecessors, (12032), 0 states have call successors, (0), 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:21:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 12032 transitions. [2022-03-15 22:21:13,032 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 12032 transitions. Word has length 17 [2022-03-15 22:21:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:13,033 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 12032 transitions. [2022-03-15 22:21:13,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 12032 transitions. [2022-03-15 22:21:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:13,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:13,038 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:13,053 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 22:21:13,239 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 22:21:13,239 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash 8117336, now seen corresponding path program 17 times [2022-03-15 22:21:13,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:13,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008537962] [2022-03-15 22:21:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:13,404 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 22:21:13,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:13,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008537962] [2022-03-15 22:21:13,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008537962] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:13,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532201329] [2022-03-15 22:21:13,404 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:13,405 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 22:21:13,406 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 22:21:13,430 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:21:13,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:13,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:21:13,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:13,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:13,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:13,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:13,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:13,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,697 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 31 treesize of output 17 [2022-03-15 22:21:13,717 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 22:21:13,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:13,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:13,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 30 treesize of output 111 [2022-03-15 22:21:14,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:14,330 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:14,330 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 29 treesize of output 72 [2022-03-15 22:21:14,486 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 22:21:14,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532201329] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:14,486 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:14,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:21:14,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032574153] [2022-03-15 22:21:14,486 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:14,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:14,492 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 119 transitions. [2022-03-15 22:21:14,492 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:16,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [113598#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 113602#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 113606#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 113603#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 113591#(and (or (<= sum1 sum2) (< k N)) (or (< sum2 (+ sum1 1)) (< k N))), 113607#(and (or (<= (+ 2 k) N) (<= N k) (< i N) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (<= (+ 2 k) N) (<= sum1 (+ (select A j) sum2 (select A k))) (<= N k) (< i N))), 113593#(and (or (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< i N))), 113610#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 113599#(and (or (not (< (+ 2 i) N)) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A j) sum2) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 113611#(and (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (< (+ k 1) N))), 113597#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1)))))), 113608#(and (or (not (< k N)) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N)) (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N) (<= (+ (select A i) sum1) (+ (select A j) sum2 (select A k))))), 113594#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 113600#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 113605#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select A j) sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2)) (< k N))), 113601#(and (or (< k N) (<= sum1 (+ (select A j) sum2)) (< i N)) (or (<= (+ (select A j) sum2) sum1) (< k N) (< i N))), 113596#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 113592#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 113609#(and (or (not (< k N)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (+ (select A j) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 113595#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)))), 113604#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (< k N)) (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ i 1) N) (not (< i N)) (< k N)))] [2022-03-15 22:21:16,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:21:16,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:21:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:21:16,571 INFO L87 Difference]: Start difference. First operand 2635 states and 12032 transitions. Second operand has 32 states, 31 states have (on average 2.774193548387097) 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 22:21:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:26,674 INFO L93 Difference]: Finished difference Result 3693 states and 15136 transitions. [2022-03-15 22:21:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:21:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.774193548387097) 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 17 [2022-03-15 22:21:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:26,685 INFO L225 Difference]: With dead ends: 3693 [2022-03-15 22:21:26,685 INFO L226 Difference]: Without dead ends: 3656 [2022-03-15 22:21:26,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1697, Invalid=14305, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 22:21:26,686 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 631 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:26,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 0 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:21:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-03-15 22:21:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 2644. [2022-03-15 22:21:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 4.5701853953840335) internal successors, (12079), 2643 states have internal predecessors, (12079), 0 states have call successors, (0), 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:21:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 12079 transitions. [2022-03-15 22:21:26,768 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 12079 transitions. Word has length 17 [2022-03-15 22:21:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:26,769 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 12079 transitions. [2022-03-15 22:21:26,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.774193548387097) 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 22:21:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 12079 transitions. [2022-03-15 22:21:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:26,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:26,775 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:26,791 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 22:21:26,975 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 22:21:26,975 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1479806234, now seen corresponding path program 18 times [2022-03-15 22:21:26,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:26,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87843474] [2022-03-15 22:21:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:21:27,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:27,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87843474] [2022-03-15 22:21:27,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87843474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:27,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115159149] [2022-03-15 22:21:27,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:21:27,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:27,015 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 22:21:27,043 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 22:21:27,054 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:21:27,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:27,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:21:27,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:21:27,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:21:27,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115159149] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:27,169 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:27,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-03-15 22:21:27,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972832581] [2022-03-15 22:21:27,169 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:27,170 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:27,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 135 transitions. [2022-03-15 22:21:27,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:27,679 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [122870#(or (<= N i) (< (+ i 1) N) (<= M j)), 122869#(or (<= N i) (< (+ i 1) N) (<= (+ M 1) j)), 122874#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 122875#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 122866#(or (<= N i) (< (+ i 1) N)), 122872#(or (<= N (+ i 1)) (< (+ 2 i) N)), 122871#(or (<= N i) (< (+ i 1) N) (<= M (+ j 1))), 122868#(or (< i N) (<= M j)), 122865#(< i N), 122873#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ M 1) j)), 122867#(or (<= (+ M 1) j) (< i N)), 122847#(or (<= M (+ j 1)) (< i N))] [2022-03-15 22:21:27,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:21:27,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:21:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:21:27,680 INFO L87 Difference]: Start difference. First operand 2644 states and 12079 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:28,254 INFO L93 Difference]: Finished difference Result 5483 states and 23954 transitions. [2022-03-15 22:21:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 22:21:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:21:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:28,268 INFO L225 Difference]: With dead ends: 5483 [2022-03-15 22:21:28,268 INFO L226 Difference]: Without dead ends: 5444 [2022-03-15 22:21:28,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=667, Invalid=1883, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:21:28,269 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:28,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2022-03-15 22:21:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 3223. [2022-03-15 22:21:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 4.65114835505897) internal successors, (14986), 3222 states have internal predecessors, (14986), 0 states have call successors, (0), 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:21:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 14986 transitions. [2022-03-15 22:21:28,365 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 14986 transitions. Word has length 17 [2022-03-15 22:21:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:28,365 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 14986 transitions. [2022-03-15 22:21:28,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 14986 transitions. [2022-03-15 22:21:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:21:28,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:28,372 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:28,390 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 22:21:28,587 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 22:21:28,587 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1028269030, now seen corresponding path program 19 times [2022-03-15 22:21:28,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:28,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304072017] [2022-03-15 22:21:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:28,643 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 22:21:28,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:28,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304072017] [2022-03-15 22:21:28,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304072017] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:28,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027683321] [2022-03-15 22:21:28,644 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:21:28,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:28,645 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 22:21:28,645 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 22:21:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:28,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:21:28,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:28,730 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 22:21:28,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:28,796 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 22:21:28,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027683321] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:28,796 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:28,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-15 22:21:28,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1149187509] [2022-03-15 22:21:28,796 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:28,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:28,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 127 transitions. [2022-03-15 22:21:28,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:29,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [134994#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j)), 134991#(or (<= N (+ i 1)) (< j M)), 134986#(or (<= N i) (< j M)), 134973#(< j M), 134988#(or (< (+ j 1) M) (<= N i) (<= M j)), 134976#(or (< j M) (<= (+ N 1) i) (< k N)), 134993#(or (<= N (+ i 1)) (< j M) (< k N)), 134989#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 134990#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 134987#(or (<= N i) (< j M) (< k N)), 134995#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 134992#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 134972#(or (<= (+ N 1) i) (< k N)), 134981#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 134971#(< k N), 134978#(or (< (+ j 1) M) (<= (+ N 1) i) (<= M j)), 134984#(or (<= N (+ i 1)) (< k N)), 134977#(or (< (+ j 1) M) (<= M j)), 134974#(or (< j M) (< k N)), 134975#(or (< j M) (<= (+ N 1) i)), 134983#(or (<= N i) (< k N)), 134985#(or (<= N (+ 2 i)) (< k N)), 134996#(or (<= (+ N j) (+ 2 M i)) (< k N)), 134982#(or (< (+ j 1) M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N) (<= M j)), 134979#(or (< (+ j 1) M) (< k N) (<= M j)), 134980#(or (< (+ j 1) M) (<= (+ N 1) i) (< k N) (<= M j))] [2022-03-15 22:21:29,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:21:29,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:21:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1611, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:21:29,676 INFO L87 Difference]: Start difference. First operand 3223 states and 14986 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 22:21:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:32,359 INFO L93 Difference]: Finished difference Result 3994 states and 17147 transitions. [2022-03-15 22:21:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-03-15 22:21:32,360 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 22:21:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:32,369 INFO L225 Difference]: With dead ends: 3994 [2022-03-15 22:21:32,370 INFO L226 Difference]: Without dead ends: 3977 [2022-03-15 22:21:32,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6540 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4219, Invalid=18131, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 22:21:32,372 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:32,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:21:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2022-03-15 22:21:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3302. [2022-03-15 22:21:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3301 states have (on average 4.6201151166313235) internal successors, (15251), 3301 states have internal predecessors, (15251), 0 states have call successors, (0), 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:21:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 15251 transitions. [2022-03-15 22:21:32,452 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 15251 transitions. Word has length 17 [2022-03-15 22:21:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:32,452 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 15251 transitions. [2022-03-15 22:21:32,452 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 22:21:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 15251 transitions. [2022-03-15 22:21:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:32,459 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:32,459 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:32,481 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 22:21:32,674 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 22:21:32,675 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash 781587280, now seen corresponding path program 10 times [2022-03-15 22:21:32,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:32,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401049441] [2022-03-15 22:21:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:32,726 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 22:21:32,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:32,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401049441] [2022-03-15 22:21:32,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401049441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:32,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668824839] [2022-03-15 22:21:32,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:21:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:32,728 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 22:21:32,728 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 22:21:32,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:21:32,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:32,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:21:32,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:32,848 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 22:21:32,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:32,876 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 22:21:32,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668824839] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:32,876 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:32,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-15 22:21:32,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389125437] [2022-03-15 22:21:32,877 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:32,878 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:32,886 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 22:21:32,886 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:33,615 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [145933#(or (<= N (+ k 1)) (< i N)), 145943#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= N (+ 2 k))), 145938#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k))), 145937#(or (<= N (+ 2 k)) (< i N)), 145928#(< i N), 145941#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 145939#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 145942#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 145930#(or (<= N (+ i 1)) (< (+ 2 i) N)), 145934#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 145935#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 145940#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 145931#(or (<= N k) (< i N)), 145929#(or (<= N i) (< (+ i 1) N)), 145932#(or (<= N i) (< (+ i 1) N) (<= N k)), 145936#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:21:33,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:21:33,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:21:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:21:33,616 INFO L87 Difference]: Start difference. First operand 3302 states and 15251 transitions. Second operand has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 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 22:21:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:35,275 INFO L93 Difference]: Finished difference Result 11462 states and 52197 transitions. [2022-03-15 22:21:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 22:21:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 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 18 [2022-03-15 22:21:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:35,307 INFO L225 Difference]: With dead ends: 11462 [2022-03-15 22:21:35,307 INFO L226 Difference]: Without dead ends: 11428 [2022-03-15 22:21:35,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3923 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2982, Invalid=8360, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 22:21:35,308 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:35,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:21:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11428 states. [2022-03-15 22:21:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11428 to 5139. [2022-03-15 22:21:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 5138 states have (on average 4.742312183729077) internal successors, (24366), 5138 states have internal predecessors, (24366), 0 states have call successors, (0), 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:21:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 24366 transitions. [2022-03-15 22:21:35,478 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 24366 transitions. Word has length 18 [2022-03-15 22:21:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:35,478 INFO L470 AbstractCegarLoop]: Abstraction has 5139 states and 24366 transitions. [2022-03-15 22:21:35,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 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 22:21:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 24366 transitions. [2022-03-15 22:21:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:35,489 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:35,489 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:35,507 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 22:21:35,705 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 22:21:35,705 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2021259246, now seen corresponding path program 11 times [2022-03-15 22:21:35,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:35,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475562695] [2022-03-15 22:21:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:35,765 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 22:21:35,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:35,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475562695] [2022-03-15 22:21:35,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475562695] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:35,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694662171] [2022-03-15 22:21:35,766 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:35,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:35,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:35,767 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 22:21:35,769 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 22:21:35,795 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:21:35,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:21:35,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:35,840 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 22:21:35,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:35,880 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 22:21:35,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694662171] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:35,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:35,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-03-15 22:21:35,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [100022043] [2022-03-15 22:21:35,881 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:35,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:35,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 203 transitions. [2022-03-15 22:21:35,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:37,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [167959#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 167964#(or (<= N i) (< (+ i 1) N) (< j M)), 167978#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 167965#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 167943#(< i N), 167951#(or (<= (+ k 1) N) (< j M)), 167986#(or (<= (+ 2 k) i) (< j M) (<= N k)), 167962#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 167974#(or (< j M) (<= (+ k 1) i)), 167980#(or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (<= N (+ 3 i))), 167985#(or (<= (+ 3 k) i) (< j M) (<= N k)), 167944#(or (< k N) (< i N)), 167988#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 167975#(or (< (+ i 4) N) (<= N (+ 3 i))), 167977#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 167948#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 167963#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 167972#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 167936#(or (<= k i) (< j M)), 167947#(or (<= N i) (< (+ i 1) N) (< k N)), 167949#(or (<= N k) (<= (+ k 4) N)), 167967#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 167946#(or (<= N i) (< (+ i 1) N)), 167954#(or (< j M) (<= N k) (<= (+ k 4) N)), 167973#(or (<= (+ 2 k) i) (< j M)), 167984#(or (<= (+ k 1) i) (<= N k)), 167960#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 167971#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 167966#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 167981#(or (< j M) (<= k (+ i 1))), 167953#(or (<= (+ 3 k) N) (< j M)), 167983#(or (<= (+ 2 k) i) (<= N k)), 167956#(or (< j M) (< k N) (< i N)), 167982#(or (<= (+ 3 k) i) (<= N k)), 167976#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 167958#(or (<= N (+ i 1)) (< (+ 2 i) N)), 167979#(or (< (+ i 4) N) (<= (+ 2 k) N) (<= N (+ 3 i))), 167961#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 167957#(or (<= (+ 2 k) N) (< j M) (< i N)), 167969#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 167987#(or (< j M) (<= (+ k 1) i) (<= N k)), 167970#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 167968#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 167955#(or (< j M) (< i N)), 167952#(or (<= (+ 2 k) N) (< j M)), 167950#(< j M), 167945#(or (<= (+ 2 k) N) (< i N))] [2022-03-15 22:21:37,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 22:21:37,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 22:21:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2957, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:21:37,493 INFO L87 Difference]: Start difference. First operand 5139 states and 24366 transitions. Second operand has 58 states, 58 states have (on average 2.7586206896551726) internal successors, (160), 57 states have internal predecessors, (160), 0 states have call successors, (0), 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:21:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:41,844 INFO L93 Difference]: Finished difference Result 6469 states and 28855 transitions. [2022-03-15 22:21:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-15 22:21:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.7586206896551726) internal successors, (160), 57 states have internal predecessors, (160), 0 states have call successors, (0), 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:21:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:41,861 INFO L225 Difference]: With dead ends: 6469 [2022-03-15 22:21:41,861 INFO L226 Difference]: Without dead ends: 6469 [2022-03-15 22:21:41,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9141 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5661, Invalid=25139, Unknown=0, NotChecked=0, Total=30800 [2022-03-15 22:21:41,863 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1002 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:41,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1002 Valid, 0 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:21:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2022-03-15 22:21:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 5330. [2022-03-15 22:21:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5330 states, 5329 states have (on average 4.722274347907675) internal successors, (25165), 5329 states have internal predecessors, (25165), 0 states have call successors, (0), 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:21:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 25165 transitions. [2022-03-15 22:21:41,988 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 25165 transitions. Word has length 18 [2022-03-15 22:21:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:41,988 INFO L470 AbstractCegarLoop]: Abstraction has 5330 states and 25165 transitions. [2022-03-15 22:21:41,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.7586206896551726) internal successors, (160), 57 states have internal predecessors, (160), 0 states have call successors, (0), 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:21:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 25165 transitions. [2022-03-15 22:21:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:42,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:42,000 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:42,015 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 22:21:42,200 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 22:21:42,201 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1953981816, now seen corresponding path program 20 times [2022-03-15 22:21:42,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:42,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237989773] [2022-03-15 22:21:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:42,261 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:21:42,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:42,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237989773] [2022-03-15 22:21:42,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237989773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:42,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368486753] [2022-03-15 22:21:42,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:42,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:42,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:42,263 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 22:21:42,263 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 22:21:42,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:42,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:42,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:21:42,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:42,326 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:21:42,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:42,369 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:21:42,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368486753] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:42,369 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:42,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 22:21:42,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1189723652] [2022-03-15 22:21:42,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:42,371 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:42,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 198 transitions. [2022-03-15 22:21:42,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:43,560 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [185472#(or (<= N (+ k 1)) (< j M)), 185487#(or (<= N (+ i 1)) (< (+ 2 i) N)), 185495#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 185494#(or (< (+ j 1) M) (<= i k) (<= M j)), 185479#(or (<= N i) (< (+ i 1) N)), 185482#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 185485#(or (< j M) (<= i (+ k 1))), 185499#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ 3 i) N)), 185488#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 185492#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 185473#(or (< j M) (<= N (+ 2 k))), 185484#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< j M)), 185466#(< j M), 185480#(or (<= N i) (< (+ i 1) N) (< j M)), 185497#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 185468#(or (< j M) (< i N)), 185474#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 185500#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 185477#(or (< j M) (<= i (+ 2 k))), 185478#(or (< (+ j 1) M) (<= i (+ 2 k)) (<= M j)), 185491#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 185481#(or (<= N i) (< (+ i 1) N) (<= N k)), 185475#(or (<= N (+ k 1)) (< i N)), 185470#(or (<= N k) (< i N)), 185490#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 185476#(or (<= N (+ k 1)) (< j M) (< i N)), 185496#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 185489#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 185483#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 185486#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 185469#(or (< j M) (<= N k)), 185471#(or (< j M) (<= N k) (< i N)), 185467#(< i N), 185498#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 185493#(or (< j M) (<= i k))] [2022-03-15 22:21:43,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:21:43,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:21:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:21:43,561 INFO L87 Difference]: Start difference. First operand 5330 states and 25165 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:48,692 INFO L93 Difference]: Finished difference Result 11679 states and 51505 transitions. [2022-03-15 22:21:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-03-15 22:21:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:21:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:48,733 INFO L225 Difference]: With dead ends: 11679 [2022-03-15 22:21:48,733 INFO L226 Difference]: Without dead ends: 11630 [2022-03-15 22:21:48,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17091 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=9714, Invalid=38906, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 22:21:48,735 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 612 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:48,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 0 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:21:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11630 states. [2022-03-15 22:21:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11630 to 5648. [2022-03-15 22:21:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5648 states, 5647 states have (on average 4.7651850540109795) internal successors, (26909), 5647 states have internal predecessors, (26909), 0 states have call successors, (0), 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:21:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 26909 transitions. [2022-03-15 22:21:48,936 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 26909 transitions. Word has length 18 [2022-03-15 22:21:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:48,936 INFO L470 AbstractCegarLoop]: Abstraction has 5648 states and 26909 transitions. [2022-03-15 22:21:48,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 26909 transitions. [2022-03-15 22:21:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:21:48,948 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:48,948 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:48,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 22:21:49,148 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 22:21:49,148 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -836565544, now seen corresponding path program 21 times [2022-03-15 22:21:49,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:49,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596563997] [2022-03-15 22:21:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:49,221 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 22:21:49,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:49,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596563997] [2022-03-15 22:21:49,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596563997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:49,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943782208] [2022-03-15 22:21:49,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:49,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:49,222 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 22:21:49,223 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 22:21:49,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:21:49,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:49,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:21:49,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:49,313 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 22:21:49,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:49,380 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 22:21:49,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943782208] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:49,381 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:49,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-03-15 22:21:49,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1174134084] [2022-03-15 22:21:49,381 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:49,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:49,389 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 22:21:49,389 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:50,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [208954#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 208957#(or (<= (+ 2 k) N) (< j M)), 208962#(or (< (+ j 1) M) (<= k i) (<= M j)), 208949#(or (<= N i) (< (+ i 1) N) (< k N)), 208968#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 208969#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 208958#(or (< j M) (<= (+ k 1) i)), 208947#(or (<= N i) (< (+ i 1) N) (< j M)), 208975#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 208970#(or (< j M) (<= k (+ i 1))), 208952#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 208972#(or (< (+ 2 j) M) (<= k (+ i 1)) (<= M (+ j 1))), 208967#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 208976#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 208973#(or (< (+ i 4) N) (<= N (+ 3 i))), 208971#(or (< (+ j 1) M) (<= k (+ i 1)) (<= M j)), 208955#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 208965#(or (<= k i) (< (+ 2 j) M) (<= M (+ j 1))), 208964#(or (<= (+ k 1) i) (< (+ 2 j) M) (<= M (+ j 1))), 208944#(< j M), 208956#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 208943#(< i N), 208963#(or (<= (+ 2 k) N) (< (+ 2 j) M) (<= M (+ j 1))), 208974#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 208950#(or (<= (+ k 1) N) (< j M)), 208959#(or (<= k i) (< j M)), 208946#(or (<= N i) (< (+ i 1) N)), 208960#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 208953#(or (<= N (+ i 1)) (< (+ 2 i) N)), 208945#(or (< j M) (< i N)), 208951#(or (< j M) (< k N) (< i N)), 208966#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 208948#(or (< k N) (< i N)), 208961#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j))] [2022-03-15 22:21:50,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:21:50,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:21:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2227, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:21:50,682 INFO L87 Difference]: Start difference. First operand 5648 states and 26909 transitions. Second operand has 45 states, 45 states have (on average 2.911111111111111) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 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:22:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:10,653 INFO L93 Difference]: Finished difference Result 14732 states and 58076 transitions. [2022-03-15 22:22:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2022-03-15 22:22:10,653 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.911111111111111) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 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:22:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:10,696 INFO L225 Difference]: With dead ends: 14732 [2022-03-15 22:22:10,696 INFO L226 Difference]: Without dead ends: 14729 [2022-03-15 22:22:10,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103099 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=31572, Invalid=214940, Unknown=0, NotChecked=0, Total=246512 [2022-03-15 22:22:10,704 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1432 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 1149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1149 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:10,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1432 Valid, 0 Invalid, 5396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1149 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:22:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14729 states. [2022-03-15 22:22:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14729 to 7016. [2022-03-15 22:22:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 7015 states have (on average 4.823093371347113) internal successors, (33834), 7015 states have internal predecessors, (33834), 0 states have call successors, (0), 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:22:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 33834 transitions. [2022-03-15 22:22:10,976 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 33834 transitions. Word has length 18 [2022-03-15 22:22:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:10,977 INFO L470 AbstractCegarLoop]: Abstraction has 7016 states and 33834 transitions. [2022-03-15 22:22:10,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.911111111111111) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 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:22:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 33834 transitions. [2022-03-15 22:22:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:10,992 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:10,992 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:11,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:11,192 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 22:22:11,193 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash -89639722, now seen corresponding path program 22 times [2022-03-15 22:22:11,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:11,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329824203] [2022-03-15 22:22:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:11,249 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:22:11,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:11,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329824203] [2022-03-15 22:22:11,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329824203] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:11,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992481226] [2022-03-15 22:22:11,250 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:22:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:11,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:11,251 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 22:22:11,253 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 22:22:11,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:22:11,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:11,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:11,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:11,323 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:22:11,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:11,375 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:22:11,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992481226] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:11,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:11,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:22:11,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665241490] [2022-03-15 22:22:11,376 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:11,376 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:11,383 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 22:22:11,383 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:12,636 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [238763#(or (<= N i) (< (+ i 1) N) (< j M)), 238761#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 238777#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 238756#(or (<= N (+ k 1)) (< (+ 2 j) M) (<= M (+ j 1))), 238769#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 238771#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 238774#(or (< (+ j 1) M) (<= (+ i 1) k) (<= M j)), 238770#(or (< (+ j 1) M) (<= i k) (<= M j)), 238762#(or (< (+ 2 j) M) (<= i (+ k 1)) (<= M (+ j 1))), 238778#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ 3 i) N)), 238776#(or (<= (+ i 1) k) (< (+ 2 j) M) (<= M (+ j 1))), 238749#(< i N), 238766#(or (< j M) (<= i k)), 238750#(or (<= N i) (< (+ i 1) N)), 238759#(or (< j M) (<= N k) (< i N)), 238767#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 238755#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 238764#(or (<= N i) (< (+ i 1) N) (<= N k)), 238772#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 238765#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 238757#(or (<= N k) (< i N)), 238760#(or (< j M) (<= i (+ k 1))), 238752#(< j M), 238768#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 238753#(or (< j M) (<= N k)), 238773#(or (<= (+ i 1) k) (< j M)), 238775#(or (<= i k) (< (+ 2 j) M) (<= M (+ j 1))), 238758#(or (< j M) (< i N)), 238751#(or (<= N (+ i 1)) (< (+ 2 i) N)), 238754#(or (<= N (+ k 1)) (< j M))] [2022-03-15 22:22:12,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:22:12,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:12,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:22:12,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:22:12,637 INFO L87 Difference]: Start difference. First operand 7016 states and 33834 transitions. Second operand has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 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:22:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:21,465 INFO L93 Difference]: Finished difference Result 14370 states and 62029 transitions. [2022-03-15 22:22:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2022-03-15 22:22:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 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:22:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:21,520 INFO L225 Difference]: With dead ends: 14370 [2022-03-15 22:22:21,521 INFO L226 Difference]: Without dead ends: 14290 [2022-03-15 22:22:21,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32846 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=14561, Invalid=71581, Unknown=0, NotChecked=0, Total=86142 [2022-03-15 22:22:21,524 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 779 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:21,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 0 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:22:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14290 states. [2022-03-15 22:22:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14290 to 8712. [2022-03-15 22:22:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 8711 states have (on average 4.871197336700723) internal successors, (42433), 8711 states have internal predecessors, (42433), 0 states have call successors, (0), 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:22:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 42433 transitions. [2022-03-15 22:22:21,893 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 42433 transitions. Word has length 18 [2022-03-15 22:22:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:21,893 INFO L470 AbstractCegarLoop]: Abstraction has 8712 states and 42433 transitions. [2022-03-15 22:22:21,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 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:22:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 42433 transitions. [2022-03-15 22:22:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:21,950 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:21,950 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:21,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 22:22:22,150 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 22:22:22,151 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1692067640, now seen corresponding path program 23 times [2022-03-15 22:22:22,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:22,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601717991] [2022-03-15 22:22:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:22:22,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:22,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601717991] [2022-03-15 22:22:22,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601717991] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:22,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378605607] [2022-03-15 22:22:22,195 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:22,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:22,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:22,196 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 22:22:22,196 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 22:22:22,218 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:22:22,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:22,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:22,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:22,311 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 22:22:22,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:22,408 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:22:22,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378605607] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:22,408 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:22,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-03-15 22:22:22,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617445271] [2022-03-15 22:22:22,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:22,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:22,417 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 188 transitions. [2022-03-15 22:22:22,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:23,427 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [271211#(or (<= (+ 3 i) N) (< j M)), 271207#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 271210#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 271215#(or (<= N (+ 2 i)) (<= (+ i 4) N)), 271202#(or (<= M (+ 2 j)) (< (+ 3 j) M) (< i N)), 271199#(or (< j M) (< i N)), 271209#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 271201#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 271200#(or (< (+ j 1) M) (< i N) (<= M j)), 271212#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 271204#(or (<= N i) (< (+ i 1) N) (< j M)), 271198#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 271195#(< j M), 271213#(or (<= (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 271203#(or (<= N i) (<= (+ 2 i) N)), 271196#(or (< (+ j 1) M) (<= M j)), 271214#(or (<= (+ 3 i) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 271197#(or (< (+ 2 j) M) (<= M (+ j 1))), 271205#(or (< j M) (<= (+ 2 i) N)), 271216#(or (<= N (+ 2 i)) (<= (+ i 4) N) (< j M)), 271206#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 271208#(or (<= M (+ 2 j)) (< (+ 3 j) M) (<= (+ 2 i) N))] [2022-03-15 22:22:23,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:22:23,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:22:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1506, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:22:23,428 INFO L87 Difference]: Start difference. First operand 8712 states and 42433 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 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 22:22:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:25,021 INFO L93 Difference]: Finished difference Result 12809 states and 59985 transitions. [2022-03-15 22:22:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 22:22:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 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) Word has length 18 [2022-03-15 22:22:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:25,067 INFO L225 Difference]: With dead ends: 12809 [2022-03-15 22:22:25,067 INFO L226 Difference]: Without dead ends: 12795 [2022-03-15 22:22:25,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1428, Invalid=6404, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:22:25,068 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:25,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 0 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:22:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12795 states. [2022-03-15 22:22:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12795 to 9578. [2022-03-15 22:22:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9578 states, 9577 states have (on average 4.865615537224601) internal successors, (46598), 9577 states have internal predecessors, (46598), 0 states have call successors, (0), 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:22:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 46598 transitions. [2022-03-15 22:22:25,412 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 46598 transitions. Word has length 18 [2022-03-15 22:22:25,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:25,412 INFO L470 AbstractCegarLoop]: Abstraction has 9578 states and 46598 transitions. [2022-03-15 22:22:25,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 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 22:22:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 46598 transitions. [2022-03-15 22:22:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:25,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:25,435 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:25,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:25,635 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 22:22:25,635 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1240855888, now seen corresponding path program 24 times [2022-03-15 22:22:25,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:25,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761971931] [2022-03-15 22:22:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:25,695 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 22:22:25,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:25,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761971931] [2022-03-15 22:22:25,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761971931] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:25,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205842755] [2022-03-15 22:22:25,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:25,697 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 22:22:25,698 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 22:22:25,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:22:25,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:25,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:25,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:25,820 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 22:22:25,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:25,937 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 22:22:25,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205842755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:25,937 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:25,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2022-03-15 22:22:25,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493459525] [2022-03-15 22:22:25,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:25,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:25,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 157 transitions. [2022-03-15 22:22:25,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:27,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [303407#(or (<= (+ j 1) M) (< i N)), 303416#(or (< (+ i 4) N) (<= (+ 2 j) M) (<= N (+ 3 i))), 303432#(or (<= M j) (<= (+ k j 1) (+ M i))), 303429#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 303430#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 303421#(or (<= N i) (< (+ i 1) N) (< k N)), 303402#(< i N), 303427#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 303403#(or (<= N i) (< (+ i 1) N)), 303426#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 303408#(or (<= N i) (< (+ i 1) N) (< j M)), 303410#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 303423#(or (<= (+ k j 4) (+ N M)) (<= M j)), 303409#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 303436#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 303413#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 303424#(or (<= M j) (<= (+ 3 k j) (+ M i))), 303418#(or (< k N) (< i N)), 303414#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 303417#(< k N), 303422#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 303431#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 303420#(or (< j M) (< k N) (< i N)), 303404#(or (<= N (+ i 1)) (< (+ 2 i) N)), 303434#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 303415#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 303433#(or (<= (+ 2 k j) (+ N M)) (< i N)), 303406#(or (< (+ i 4) N) (<= N (+ 3 i))), 303412#(or (<= (+ 2 j) M) (< i N)), 303405#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 303428#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 303411#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 303425#(or (<= (+ 2 k j) (+ M i)) (<= M j)), 303419#(or (< k N) (<= (+ j 1) M)), 303435#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 303437#(or (< (+ i 4) N) (<= (+ 2 k j) (+ N M)) (<= N (+ 3 i)))] [2022-03-15 22:22:27,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:22:27,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:22:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3105, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:22:27,232 INFO L87 Difference]: Start difference. First operand 9578 states and 46598 transitions. Second operand has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 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:22:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:40,724 INFO L93 Difference]: Finished difference Result 18776 states and 78633 transitions. [2022-03-15 22:22:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 370 states. [2022-03-15 22:22:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 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 18 [2022-03-15 22:22:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:40,777 INFO L225 Difference]: With dead ends: 18776 [2022-03-15 22:22:40,777 INFO L226 Difference]: Without dead ends: 18760 [2022-03-15 22:22:40,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64508 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=26327, Invalid=140545, Unknown=0, NotChecked=0, Total=166872 [2022-03-15 22:22:40,783 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1294 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 2802 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:40,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 0 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2802 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:22:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18760 states. [2022-03-15 22:22:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18760 to 11130. [2022-03-15 22:22:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11130 states, 11129 states have (on average 4.8755503639140985) internal successors, (54260), 11129 states have internal predecessors, (54260), 0 states have call successors, (0), 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:22:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 54260 transitions. [2022-03-15 22:22:41,197 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 54260 transitions. Word has length 18 [2022-03-15 22:22:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:41,197 INFO L470 AbstractCegarLoop]: Abstraction has 11130 states and 54260 transitions. [2022-03-15 22:22:41,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 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:22:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 54260 transitions. [2022-03-15 22:22:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:41,219 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:41,219 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:41,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 22:22:41,419 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 22:22:41,419 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -909466934, now seen corresponding path program 25 times [2022-03-15 22:22:41,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:41,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480075404] [2022-03-15 22:22:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:41,469 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:22:41,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:41,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480075404] [2022-03-15 22:22:41,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480075404] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:41,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260856964] [2022-03-15 22:22:41,469 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:41,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:41,470 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 22:22:41,471 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 22:22:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:41,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:41,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:41,583 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:22:41,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:41,697 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:22:41,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260856964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:41,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:41,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2022-03-15 22:22:41,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170946102] [2022-03-15 22:22:41,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:41,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:41,704 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 146 transitions. [2022-03-15 22:22:41,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:42,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [345310#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 345301#(or (<= N i) (< (+ i 1) N) (< j M)), 345303#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 345305#(or (<= (+ M i) (+ 3 k j)) (<= M j)), 345312#(or (<= M j) (<= (+ M i) (+ k j 1))), 345315#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 345298#(< j M), 345316#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 345314#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 345300#(or (<= N i) (< (+ i 1) N)), 345297#(< i N), 345304#(or (<= (+ N M) (+ 3 k j)) (<= M j)), 345311#(or (<= (+ M i) (+ 2 k j)) (<= M j)), 345317#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 345302#(or (<= N (+ i 1)) (< (+ 2 i) N)), 345313#(or (<= (+ N M) (+ k j 1)) (< i N)), 345309#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 345306#(or (<= N k) (< i N)), 345299#(or (< j M) (< i N)), 345308#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 345307#(or (<= N i) (< (+ i 1) N) (<= N k))] [2022-03-15 22:22:42,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:22:42,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:22:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:22:42,464 INFO L87 Difference]: Start difference. First operand 11130 states and 54260 transitions. Second operand has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:49,031 INFO L93 Difference]: Finished difference Result 41413 states and 188526 transitions. [2022-03-15 22:22:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-03-15 22:22:49,031 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:49,244 INFO L225 Difference]: With dead ends: 41413 [2022-03-15 22:22:49,244 INFO L226 Difference]: Without dead ends: 41294 [2022-03-15 22:22:49,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22281 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=11589, Invalid=47217, Unknown=0, NotChecked=0, Total=58806 [2022-03-15 22:22:49,246 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:49,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 0 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:22:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41294 states. [2022-03-15 22:22:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41294 to 16830. [2022-03-15 22:22:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16830 states, 16829 states have (on average 4.947471626359261) internal successors, (83261), 16829 states have internal predecessors, (83261), 0 states have call successors, (0), 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:22:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16830 states to 16830 states and 83261 transitions. [2022-03-15 22:22:50,322 INFO L78 Accepts]: Start accepts. Automaton has 16830 states and 83261 transitions. Word has length 18 [2022-03-15 22:22:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:50,322 INFO L470 AbstractCegarLoop]: Abstraction has 16830 states and 83261 transitions. [2022-03-15 22:22:50,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 16830 states and 83261 transitions. [2022-03-15 22:22:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:50,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:50,372 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:50,389 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 22:22:50,584 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 22:22:50,585 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1681062270, now seen corresponding path program 26 times [2022-03-15 22:22:50,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:50,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480652282] [2022-03-15 22:22:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:50,646 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:22:50,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:50,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480652282] [2022-03-15 22:22:50,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480652282] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:50,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123865041] [2022-03-15 22:22:50,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:22:50,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:50,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:50,648 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 22:22:50,651 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 22:22:50,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:22:50,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:50,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:22:50,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:50,782 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:22:50,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:50,908 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:22:50,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123865041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:50,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:50,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2022-03-15 22:22:50,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711769397] [2022-03-15 22:22:50,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:50,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:50,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 22:22:50,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:51,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [420915#(or (<= N i) (< (+ i 1) N)), 420916#(or (<= (+ N M) (+ 3 k j)) (<= M j)), 420934#(or (<= M j) (<= (+ M i) (+ k j 1))), 420931#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 420918#(or (< i N) (<= M j)), 420933#(or (<= (+ M i) (+ 2 k j)) (<= M j)), 420926#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 420914#(< i N), 420930#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 420919#(< k N), 420932#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 420923#(or (<= N (+ i 1)) (< (+ 2 i) N)), 420922#(or (<= N i) (< (+ i 1) N) (< k N)), 420927#(or (<= N i) (< (+ i 1) N) (<= M j)), 420925#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 420917#(or (<= (+ M i) (+ 3 k j)) (<= M j)), 420921#(or (<= (+ N M) (+ k j 1)) (< i N)), 420928#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 420929#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 420920#(or (< k N) (< i N)), 420924#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N))] [2022-03-15 22:22:51,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:22:51,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:22:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:22:51,691 INFO L87 Difference]: Start difference. First operand 16830 states and 83261 transitions. Second operand has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:56,024 INFO L93 Difference]: Finished difference Result 36604 states and 167411 transitions. [2022-03-15 22:22:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-03-15 22:22:56,025 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:22:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:56,198 INFO L225 Difference]: With dead ends: 36604 [2022-03-15 22:22:56,198 INFO L226 Difference]: Without dead ends: 36448 [2022-03-15 22:22:56,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14532 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=8015, Invalid=30991, Unknown=0, NotChecked=0, Total=39006 [2022-03-15 22:22:56,202 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:56,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:22:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36448 states. [2022-03-15 22:22:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36448 to 12819. [2022-03-15 22:22:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12819 states, 12818 states have (on average 4.795365891714776) internal successors, (61467), 12818 states have internal predecessors, (61467), 0 states have call successors, (0), 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:22:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12819 states to 12819 states and 61467 transitions. [2022-03-15 22:22:56,838 INFO L78 Accepts]: Start accepts. Automaton has 12819 states and 61467 transitions. Word has length 18 [2022-03-15 22:22:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:56,838 INFO L470 AbstractCegarLoop]: Abstraction has 12819 states and 61467 transitions. [2022-03-15 22:22:56,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 12819 states and 61467 transitions. [2022-03-15 22:22:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:22:56,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:56,867 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:56,887 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:22:57,076 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:22:57,076 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:22:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1100756972, now seen corresponding path program 27 times [2022-03-15 22:22:57,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:57,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930292031] [2022-03-15 22:22:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:57,133 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 22:22:57,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:57,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930292031] [2022-03-15 22:22:57,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930292031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:57,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868855058] [2022-03-15 22:22:57,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:22:57,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:57,136 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:22:57,137 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:22:57,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:22:57,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:57,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:22:57,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:57,214 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 22:22:57,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:57,276 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 22:22:57,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868855058] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:57,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:57,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 15 [2022-03-15 22:22:57,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734259481] [2022-03-15 22:22:57,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:57,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:57,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 198 transitions. [2022-03-15 22:22:57,285 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:58,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [483629#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 483628#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 483618#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 483624#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 483621#(or (<= (+ 2 k) i) (< (+ j 1) M) (<= M j)), 483622#(or (<= N (+ i 1)) (< (+ 2 i) N)), 483604#(or (<= (+ k 1) N) (< j M)), 483635#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 483620#(or (<= (+ 2 k) i) (< j M)), 483643#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 483619#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 483634#(or (<= N i) (<= k (+ i 1))), 483627#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 483642#(or (< j M) (<= (+ k 1) i)), 483611#(or (<= (+ 2 k) N) (< j M) (< i N)), 483609#(or (<= (+ 2 k) N) (< i N)), 483638#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 483640#(or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (<= N (+ 3 i))), 483613#(or (<= (+ 3 k) N) (< (+ j 1) M) (<= M j)), 483607#(or (< k N) (< i N)), 483630#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 483637#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 483639#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 483608#(or (< j M) (< k N) (< i N)), 483605#(< i N), 483615#(or (<= N i) (< (+ i 1) N) (< k N)), 483633#(or (< (+ i 4) N) (<= (+ 2 k) N) (<= N (+ 3 i))), 483641#(or (<= (+ k j) (+ M i 1)) (<= N i)), 483626#(or (< (+ i 4) N) (<= N (+ 3 i))), 483614#(or (<= N i) (< (+ i 1) N)), 483612#(or (<= (+ 3 k) N) (< j M)), 483623#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 483632#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 483631#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 483606#(or (< j M) (< i N)), 483610#(or (<= (+ 2 k) N) (< j M)), 483617#(or (<= N i) (< (+ i 1) N) (< j M)), 483616#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 483625#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 483603#(< j M), 483636#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M))] [2022-03-15 22:22:58,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 22:22:58,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:58,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 22:22:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=2726, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:22:58,814 INFO L87 Difference]: Start difference. First operand 12819 states and 61467 transitions. Second operand has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 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:23:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:15,020 INFO L93 Difference]: Finished difference Result 22060 states and 93927 transitions. [2022-03-15 22:23:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 436 states. [2022-03-15 22:23:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 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:23:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:15,081 INFO L225 Difference]: With dead ends: 22060 [2022-03-15 22:23:15,081 INFO L226 Difference]: Without dead ends: 22060 [2022-03-15 22:23:15,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87771 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=34025, Invalid=177115, Unknown=0, NotChecked=0, Total=211140 [2022-03-15 22:23:15,089 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1397 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:15,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 0 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:23:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22060 states. [2022-03-15 22:23:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22060 to 13890. [2022-03-15 22:23:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13890 states, 13889 states have (on average 4.801929584563323) internal successors, (66694), 13889 states have internal predecessors, (66694), 0 states have call successors, (0), 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:23:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13890 states to 13890 states and 66694 transitions. [2022-03-15 22:23:15,515 INFO L78 Accepts]: Start accepts. Automaton has 13890 states and 66694 transitions. Word has length 18 [2022-03-15 22:23:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:15,515 INFO L470 AbstractCegarLoop]: Abstraction has 13890 states and 66694 transitions. [2022-03-15 22:23:15,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 51 states have internal predecessors, (146), 0 states have call successors, (0), 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:23:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 13890 states and 66694 transitions. [2022-03-15 22:23:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:15,544 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:15,544 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:15,561 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:23:15,744 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:23:15,745 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:23:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash 628801996, now seen corresponding path program 28 times [2022-03-15 22:23:15,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:15,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598993126] [2022-03-15 22:23:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:15,798 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 22:23:15,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:15,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598993126] [2022-03-15 22:23:15,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598993126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:15,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112193893] [2022-03-15 22:23:15,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:23:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:15,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:15,799 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:23:15,800 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:23:15,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:23:15,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:15,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:23:15,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:15,919 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 22:23:15,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:16,100 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 22:23:16,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112193893] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:16,101 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:16,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-03-15 22:23:16,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [473093604] [2022-03-15 22:23:16,101 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:16,102 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:16,108 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 160 transitions. [2022-03-15 22:23:16,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:17,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [534424#(or (< j M) (< k N) (< i N)), 534417#(or (<= (+ 2 j) M) (< i N)), 534449#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= (+ 3 j) M)), 534434#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 534448#(or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N)), 534444#(or (< (+ i 4) N) (<= (+ 2 j) M) (<= N (+ 3 i))), 534446#(or (<= N i) (< (+ i 1) N) (<= (+ 3 j) M)), 534455#(or (< (+ i 4) N) (<= (+ 2 j) M) (<= N (+ 3 i)) (< k N)), 534435#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 534430#(or (<= N (+ i 1)) (< (+ 2 i) N)), 534443#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 534440#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 534454#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N)), 534453#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 534416#(or (<= (+ j 1) M) (< i N)), 534450#(or (<= (+ 3 k j) (+ N M)) (< i N)), 534432#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 534451#(or (<= (+ 3 k j) (+ N M)) (<= N i) (< (+ i 1) N)), 534442#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 534426#(or (<= (+ 2 j) M) (< k N) (< i N)), 534419#(or (<= N i) (< (+ i 1) N) (< j M)), 534433#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 534439#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 534429#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N) (< k N)), 534423#(or (< k N) (< i N)), 534445#(or (<= (+ 3 j) M) (< i N)), 534447#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 j) M)), 534441#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< k N)), 534437#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 534456#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 534427#(or (<= N i) (< (+ i 1) N) (< k N)), 534425#(or (<= (+ 2 j) M) (< k N)), 534452#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N)), 534428#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 534421#(< k N), 534438#(or (< (+ i 4) N) (<= N (+ 3 i))), 534418#(or (<= N i) (< (+ i 1) N)), 534420#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 534422#(or (< k N) (<= (+ j 1) M)), 534415#(< i N), 534436#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 534457#(or (<= (+ 3 k j) (+ N M)) (< (+ i 4) N) (<= N (+ 3 i))), 534431#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N))] [2022-03-15 22:23:17,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 22:23:17,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 22:23:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:23:17,481 INFO L87 Difference]: Start difference. First operand 13890 states and 66694 transitions. Second operand has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 53 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:23:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:26,938 INFO L93 Difference]: Finished difference Result 17851 states and 81650 transitions. [2022-03-15 22:23:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 295 states. [2022-03-15 22:23:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 53 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:23:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:26,990 INFO L225 Difference]: With dead ends: 17851 [2022-03-15 22:23:26,990 INFO L226 Difference]: Without dead ends: 17840 [2022-03-15 22:23:26,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38769 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=19940, Invalid=88630, Unknown=0, NotChecked=0, Total=108570 [2022-03-15 22:23:26,996 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 772 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 2749 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:26,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 0 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2749 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:23:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2022-03-15 22:23:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 14528. [2022-03-15 22:23:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14528 states, 14527 states have (on average 4.829214565980588) internal successors, (70154), 14527 states have internal predecessors, (70154), 0 states have call successors, (0), 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:23:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14528 states to 14528 states and 70154 transitions. [2022-03-15 22:23:27,402 INFO L78 Accepts]: Start accepts. Automaton has 14528 states and 70154 transitions. Word has length 18 [2022-03-15 22:23:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:27,402 INFO L470 AbstractCegarLoop]: Abstraction has 14528 states and 70154 transitions. [2022-03-15 22:23:27,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 53 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:23:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 14528 states and 70154 transitions. [2022-03-15 22:23:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:27,493 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:27,493 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:27,509 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:23:27,694 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:23:27,694 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:23:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1598821612, now seen corresponding path program 29 times [2022-03-15 22:23:27,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:27,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902590173] [2022-03-15 22:23:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:27,745 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 22:23:27,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:27,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902590173] [2022-03-15 22:23:27,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902590173] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:27,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726709977] [2022-03-15 22:23:27,746 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:23:27,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:27,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:27,747 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:23:27,749 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:23:27,770 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:23:27,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:27,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:27,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:27,857 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 22:23:27,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:27,951 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:23:27,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726709977] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:27,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:27,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 22:23:27,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656711798] [2022-03-15 22:23:27,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:27,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:27,959 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 151 transitions. [2022-03-15 22:23:27,959 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:28,825 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [582038#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 582032#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 582022#(or (< j M) (< i N)), 582036#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 582041#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 582042#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 582018#(< i N), 582017#(< j M), 582033#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 582029#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 582023#(or (<= N i) (< (+ i 1) N) (< j M)), 582037#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 582026#(or (<= N k) (< i N)), 582019#(or (<= N i) (< (+ i 1) N)), 582040#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 582031#(or (< j M) (<= N k) (< i N)), 582028#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 582021#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 582025#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 582034#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ 3 i) N)), 582030#(or (< j M) (<= N k)), 582035#(or (<= N (+ k 1)) (< i N)), 582027#(or (<= N i) (< (+ i 1) N) (<= N k)), 582020#(or (<= N (+ i 1)) (< (+ 2 i) N)), 582039#(or (< i N) (<= (+ N M) (+ 2 k j))), 582024#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:23:28,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:23:28,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:23:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:23:28,826 INFO L87 Difference]: Start difference. First operand 14528 states and 70154 transitions. Second operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 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:23:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:33,297 INFO L93 Difference]: Finished difference Result 35355 states and 159475 transitions. [2022-03-15 22:23:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 22:23:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 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:23:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:33,420 INFO L225 Difference]: With dead ends: 35355 [2022-03-15 22:23:33,420 INFO L226 Difference]: Without dead ends: 35349 [2022-03-15 22:23:33,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11256 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7410, Invalid=24810, Unknown=0, NotChecked=0, Total=32220 [2022-03-15 22:23:33,422 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 478 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:33,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 0 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:23:33,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35349 states. [2022-03-15 22:23:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35349 to 15201. [2022-03-15 22:23:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15201 states, 15200 states have (on average 4.834013157894737) internal successors, (73477), 15200 states have internal predecessors, (73477), 0 states have call successors, (0), 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:23:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15201 states to 15201 states and 73477 transitions. [2022-03-15 22:23:34,054 INFO L78 Accepts]: Start accepts. Automaton has 15201 states and 73477 transitions. Word has length 18 [2022-03-15 22:23:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:34,054 INFO L470 AbstractCegarLoop]: Abstraction has 15201 states and 73477 transitions. [2022-03-15 22:23:34,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 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:23:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 15201 states and 73477 transitions. [2022-03-15 22:23:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:34,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:34,086 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:34,101 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:23:34,286 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:23:34,287 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:23:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash -687040614, now seen corresponding path program 30 times [2022-03-15 22:23:34,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:34,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217214401] [2022-03-15 22:23:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:34,340 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:23:34,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:34,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217214401] [2022-03-15 22:23:34,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217214401] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:34,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678696615] [2022-03-15 22:23:34,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:34,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:34,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:34,341 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:23:34,342 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:23:34,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:23:34,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:34,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:34,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:34,478 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:23:34,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:34,584 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:23:34,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678696615] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:34,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:34,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:23:34,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375501406] [2022-03-15 22:23:34,585 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:34,586 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:34,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 132 transitions. [2022-03-15 22:23:34,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:35,295 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [648196#(or (<= N k) (< i N)), 648199#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 648203#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 648191#(or (<= N i) (< (+ i 1) N)), 648202#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 648193#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 648204#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 648201#(or (<= N i) (< (+ i 1) N) (<= N k)), 648205#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N)), 648194#(< j M), 648197#(or (<= (+ N M) (+ k j 1)) (< i N)), 648210#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 648190#(< i N), 648195#(or (< j M) (< i N)), 648209#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 648192#(or (<= N (+ i 1)) (< (+ 2 i) N)), 648206#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 648200#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 648198#(or (<= N i) (< (+ i 1) N) (< j M)), 648207#(or (< i N) (<= (+ N M) (+ 2 k j))), 648208#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j)))] [2022-03-15 22:23:35,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:23:35,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:23:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:23:35,296 INFO L87 Difference]: Start difference. First operand 15201 states and 73477 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 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:23:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:39,989 INFO L93 Difference]: Finished difference Result 36445 states and 163492 transitions. [2022-03-15 22:23:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 22:23:39,989 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 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:23:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:40,122 INFO L225 Difference]: With dead ends: 36445 [2022-03-15 22:23:40,122 INFO L226 Difference]: Without dead ends: 36442 [2022-03-15 22:23:40,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10873 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6649, Invalid=24151, Unknown=0, NotChecked=0, Total=30800 [2022-03-15 22:23:40,123 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 400 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:40,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 0 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:23:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36442 states. [2022-03-15 22:23:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36442 to 15203. [2022-03-15 22:23:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15203 states, 15202 states have (on average 4.8358110774898035) internal successors, (73514), 15202 states have internal predecessors, (73514), 0 states have call successors, (0), 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:23:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15203 states to 15203 states and 73514 transitions. [2022-03-15 22:23:40,814 INFO L78 Accepts]: Start accepts. Automaton has 15203 states and 73514 transitions. Word has length 18 [2022-03-15 22:23:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:40,814 INFO L470 AbstractCegarLoop]: Abstraction has 15203 states and 73514 transitions. [2022-03-15 22:23:40,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 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:23:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15203 states and 73514 transitions. [2022-03-15 22:23:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:40,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:40,845 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:40,860 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:23:41,045 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:23:41,045 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:23:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1458635950, now seen corresponding path program 31 times [2022-03-15 22:23:41,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:41,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184874676] [2022-03-15 22:23:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:41,098 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:23:41,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:41,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184874676] [2022-03-15 22:23:41,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184874676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:41,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129579268] [2022-03-15 22:23:41,098 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:41,099 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:23:41,101 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:23:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:41,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:41,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:41,230 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:23:41,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:41,338 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:23:41,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129579268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:41,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:41,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:23:41,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547834380] [2022-03-15 22:23:41,339 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:41,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:41,345 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 22:23:41,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:42,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [715451#(or (<= N i) (< (+ i 1) N)), 715464#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 715454#(or (<= N i) (< (+ i 1) N) (<= M j)), 715463#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 715467#(or (< i N) (<= (+ N M) (+ 2 k j))), 715468#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 715469#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 715452#(or (<= N (+ i 1)) (< (+ 2 i) N)), 715450#(< i N), 715461#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 715470#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 715465#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 715466#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ k j 1))), 715459#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 715455#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 715462#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 715456#(< k N), 715453#(or (< i N) (<= M j)), 715458#(or (<= N i) (< (+ i 1) N) (< k N)), 715460#(or (<= (+ N M) (+ k j 1)) (< i N)), 715457#(or (< k N) (< i N))] [2022-03-15 22:23:42,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:23:42,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:23:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1738, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:23:42,242 INFO L87 Difference]: Start difference. First operand 15203 states and 73514 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 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:23:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:48,182 INFO L93 Difference]: Finished difference Result 36386 states and 163788 transitions. [2022-03-15 22:23:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-03-15 22:23:48,182 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 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:23:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:48,314 INFO L225 Difference]: With dead ends: 36386 [2022-03-15 22:23:48,314 INFO L226 Difference]: Without dead ends: 36378 [2022-03-15 22:23:48,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24362 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=11293, Invalid=48487, Unknown=0, NotChecked=0, Total=59780 [2022-03-15 22:23:48,318 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 610 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:48,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [610 Valid, 0 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:23:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36378 states. [2022-03-15 22:23:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36378 to 15245. [2022-03-15 22:23:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15245 states, 15244 states have (on average 4.83862503279979) internal successors, (73760), 15244 states have internal predecessors, (73760), 0 states have call successors, (0), 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:23:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15245 states to 15245 states and 73760 transitions. [2022-03-15 22:23:48,998 INFO L78 Accepts]: Start accepts. Automaton has 15245 states and 73760 transitions. Word has length 18 [2022-03-15 22:23:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:48,998 INFO L470 AbstractCegarLoop]: Abstraction has 15245 states and 73760 transitions. [2022-03-15 22:23:48,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 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:23:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15245 states and 73760 transitions. [2022-03-15 22:23:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:49,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:49,030 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:49,045 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:23:49,230 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:23:49,230 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:23:49,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash 243652314, now seen corresponding path program 32 times [2022-03-15 22:23:49,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:49,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406373325] [2022-03-15 22:23:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:49,284 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:23:49,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:49,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406373325] [2022-03-15 22:23:49,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406373325] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:49,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240427664] [2022-03-15 22:23:49,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:49,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:49,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:49,286 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:23:49,287 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:23:49,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:49,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:49,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:23:49,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:49,404 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:23:49,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:49,505 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:23:49,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240427664] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:49,506 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:49,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 22:23:49,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384722216] [2022-03-15 22:23:49,506 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:49,507 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:49,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 147 transitions. [2022-03-15 22:23:49,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:50,394 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [782892#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 782893#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 782878#(or (<= N i) (< (+ i 1) N) (<= M (+ j 1))), 782880#(< k N), 782896#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))), 782885#(or (< k N) (< i N) (<= M j)), 782875#(or (<= N i) (< (+ i 1) N) (<= M j)), 782887#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= M j)), 782874#(or (< i N) (<= M j)), 782884#(or (< k N) (<= M j)), 782873#(or (<= N (+ i 1)) (< (+ 2 i) N)), 782879#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 782886#(or (<= N i) (< (+ i 1) N) (< k N) (<= M j)), 782883#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 782889#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 782888#(or (< i N) (<= (+ N M) (+ 2 k j))), 782871#(< i N), 782890#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 782872#(or (<= N i) (< (+ i 1) N)), 782891#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 782894#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (<= M j)), 782881#(or (< k N) (< i N)), 782877#(or (<= M (+ j 1)) (< i N)), 782876#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 782895#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M (+ j 1))), 782882#(or (<= N i) (< (+ i 1) N) (< k N))] [2022-03-15 22:23:50,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:23:50,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:23:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2005, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:23:50,395 INFO L87 Difference]: Start difference. First operand 15245 states and 73760 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 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 22:23:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:56,286 INFO L93 Difference]: Finished difference Result 35006 states and 158822 transitions. [2022-03-15 22:23:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-03-15 22:23:56,286 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 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) Word has length 18 [2022-03-15 22:23:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:56,497 INFO L225 Difference]: With dead ends: 35006 [2022-03-15 22:23:56,497 INFO L226 Difference]: Without dead ends: 34920 [2022-03-15 22:23:56,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22198 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=11547, Invalid=44385, Unknown=0, NotChecked=0, Total=55932 [2022-03-15 22:23:56,499 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 617 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:56,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 0 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:23:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34920 states. [2022-03-15 22:23:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34920 to 15486. [2022-03-15 22:23:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15486 states, 15485 states have (on average 4.83680981595092) internal successors, (74898), 15485 states have internal predecessors, (74898), 0 states have call successors, (0), 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:23:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 74898 transitions. [2022-03-15 22:23:57,169 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 74898 transitions. Word has length 18 [2022-03-15 22:23:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:57,170 INFO L470 AbstractCegarLoop]: Abstraction has 15486 states and 74898 transitions. [2022-03-15 22:23:57,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 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 22:23:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 74898 transitions. [2022-03-15 22:23:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:23:57,207 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:57,207 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:57,225 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:23:57,408 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:23:57,408 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:23:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1406890632, now seen corresponding path program 33 times [2022-03-15 22:23:57,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:57,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570999897] [2022-03-15 22:23:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:57,475 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 22:23:57,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:57,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570999897] [2022-03-15 22:23:57,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570999897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:57,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653236655] [2022-03-15 22:23:57,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:23:57,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:57,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:57,476 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:23:57,477 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:23:57,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:23:57,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:57,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:23:57,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:57,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:23:57,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653236655] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:57,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:57,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-03-15 22:23:57,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66384040] [2022-03-15 22:23:57,634 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:57,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:57,641 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 164 transitions. [2022-03-15 22:23:57,641 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:58,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [849377#(or (< (+ 2 j) M) (<= M (+ j 1))), 849379#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 849384#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 849385#(or (<= (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 849373#(or (< j M) (< i N)), 849376#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 849375#(or (< j M) (<= (+ 2 i) N)), 849378#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 849380#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 849382#(or (<= M (+ 2 j)) (< (+ 3 j) M) (<= (+ 2 i) N)), 849371#(< j M), 849383#(or (<= (+ 3 i) N) (< j M)), 849381#(or (<= M (+ 2 j)) (< (+ 3 j) M) (< i N)), 849372#(or (< (+ j 1) M) (<= M j)), 849386#(or (<= (+ 3 i) N) (<= M (+ 2 j)) (< (+ 3 j) M)), 849374#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:23:58,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:23:58,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:58,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:23:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:23:58,672 INFO L87 Difference]: Start difference. First operand 15486 states and 74898 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 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 22:23:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:59,646 INFO L93 Difference]: Finished difference Result 27451 states and 130378 transitions. [2022-03-15 22:23:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:23:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 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 18 [2022-03-15 22:23:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:59,749 INFO L225 Difference]: With dead ends: 27451 [2022-03-15 22:23:59,749 INFO L226 Difference]: Without dead ends: 27418 [2022-03-15 22:23:59,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=978, Invalid=2804, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:23:59,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:59,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:23:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27418 states. [2022-03-15 22:24:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27418 to 17637. [2022-03-15 22:24:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17637 states, 17636 states have (on average 4.866919936493536) internal successors, (85833), 17636 states have internal predecessors, (85833), 0 states have call successors, (0), 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:24:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17637 states to 17637 states and 85833 transitions. [2022-03-15 22:24:00,288 INFO L78 Accepts]: Start accepts. Automaton has 17637 states and 85833 transitions. Word has length 18 [2022-03-15 22:24:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:00,288 INFO L470 AbstractCegarLoop]: Abstraction has 17637 states and 85833 transitions. [2022-03-15 22:24:00,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 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 22:24:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17637 states and 85833 transitions. [2022-03-15 22:24:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:24:00,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:00,326 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:00,341 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:24:00,527 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:24:00,528 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:24:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash -982311390, now seen corresponding path program 12 times [2022-03-15 22:24:00,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:00,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741120149] [2022-03-15 22:24:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:00,767 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:24:00,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:00,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741120149] [2022-03-15 22:24:00,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741120149] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:00,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639709967] [2022-03-15 22:24:00,768 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:24:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:00,769 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:24:00,771 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:24:00,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:24:00,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:00,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 22:24:00,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:01,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-03-15 22:24:01,051 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:24:01,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:01,378 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 22:24:01,379 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 41 treesize of output 166 [2022-03-15 22:24:01,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:01,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:01,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:01,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:01,854 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:24:01,925 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:24:01,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639709967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:01,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:01,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2022-03-15 22:24:01,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [428135992] [2022-03-15 22:24:01,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:01,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:01,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 238 transitions. [2022-03-15 22:24:01,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:09,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 60 new interpolants: [912325#(and (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (<= sum1 (+ sum2 (select A k) (select A (+ (- 1) N)))) (< i N)) (or (< (+ 2 k) N) (<= (+ sum2 (select A k) (select A (+ (- 1) N))) sum1) (< i N))), 912311#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 912339#(and (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N)) (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N))), 912343#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 912347#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 912316#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 912326#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N)))), 912321#(and (or (< (+ i 4) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 912324#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 912342#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 912354#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 912318#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 912360#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 912368#(and (or (< (+ i 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))) (< j M) (not (< (+ 3 i) N)) (<= (+ k 4) N)) (or (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)) (<= (+ k 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)))), 912330#(and (or (< (+ 3 k) N) (< i N) (<= (+ (select A (+ k 1)) sum2 (select A k) (select A (+ (- 1) N))) sum1)) (or (< (+ 3 k) N) (< i N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k) (select A (+ (- 1) N))))) (or (<= (+ 3 k) N) (< i N))), 912332#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N))), 912356#(and (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 912319#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 912357#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M))), 912362#(and (or (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912358#(and (or (<= (+ (select A (+ (- 1) i)) (select A k) (select A (+ (- 2) i))) sum1) (< j M) (< 3 i)) (or (<= sum1 (+ (select A (+ (- 1) i)) (select A k) (select A (+ (- 2) i)))) (< j M) (< 3 i)) (or (= sum2 0) (< j M) (< 3 i)) (or (< j M) (= k 0)) (or (<= 3 i) (< j M))), 912359#(and (or (< 2 i) (< j M) (<= (+ (select A (+ (- 1) i)) (select A k)) sum1)) (or (< 2 i) (<= sum1 (+ (select A (+ (- 1) i)) (select A k))) (< j M)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (<= 2 i) (< j M))), 912333#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912320#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 912327#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 912322#(and (or (< (+ i 4) N) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 912366#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 912315#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 912355#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 912351#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 912336#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N))), 912341#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 912348#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 912353#(and (or (< (+ i 4) N) (< j M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 912345#(and (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N) (< i N)) (or (<= (+ 3 k) N) (< j M) (< i N)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N) (< i N))), 912344#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (< i N))), 912317#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 912361#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912363#(and (or (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))))), 912338#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 912313#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 912367#(and (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 912310#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 912365#(and (or (< (+ i 4) N) (< j M) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 912335#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 912337#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 912369#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0))), 912312#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 912350#(and (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (not (< i N))) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ k 4) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)))) (or (< (+ i 1) N) (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1)) (not (< i N)) (<= (+ k 4) N))), 912352#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 912334#(and (or (< (+ i 4) N) (not (< (+ 3 i) N)) (<= (+ k 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)))) (or (<= (+ 3 k) N) (< (+ i 4) N) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))) (not (< (+ 3 i) N)) (<= (+ k 4) N))), 912329#(and (or (<= (+ 3 k) N) (< (+ i 4) N) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N)))), 912349#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (< j M) (not (< i N)))), 912364#(and (or (< j M) (<= (select A k) sum1)) (or (= sum2 0) (< j M)) (or (< j M) (<= 1 i)) (or (< j M) (= k 0)) (or (< j M) (<= sum1 (select A k)))), 912340#(and (or (< 4 N) (< j M) (<= sum1 (+ (select A (+ (- 2) N)) (select A k) (select A (+ N (- 3))) (select A (+ (- 1) N))))) (or (< j M) (= k 0)) (or (< 4 N) (< j M) (<= (+ (select A (+ (- 2) N)) (select A k) (select A (+ N (- 3))) (select A (+ (- 1) N))) sum1)) (or (= sum2 0) (< 4 N) (< j M)) (or (< j M) (<= 4 N))), 912314#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 912346#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 912328#(and (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N))), 912331#(and (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) (+ (select A i) sum1)) (not (< i N)) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (<= (+ k 4) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))))), 912323#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)))] [2022-03-15 22:24:09,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 22:24:09,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 22:24:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=7105, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 22:24:09,447 INFO L87 Difference]: Start difference. First operand 17637 states and 85833 transitions. Second operand has 73 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 72 states have internal predecessors, (194), 0 states have call successors, (0), 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:24:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:55,110 INFO L93 Difference]: Finished difference Result 19976 states and 94219 transitions. [2022-03-15 22:24:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2022-03-15 22:24:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 72 states have internal predecessors, (194), 0 states have call successors, (0), 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:24:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:55,185 INFO L225 Difference]: With dead ends: 19976 [2022-03-15 22:24:55,185 INFO L226 Difference]: Without dead ends: 19916 [2022-03-15 22:24:55,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54918 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=18548, Invalid=120954, Unknown=0, NotChecked=0, Total=139502 [2022-03-15 22:24:55,190 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1322 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 3913 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 3913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:55,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1322 Valid, 0 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 3913 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 22:24:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2022-03-15 22:24:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 17825. [2022-03-15 22:24:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17824 states have (on average 4.8598518850987436) internal successors, (86622), 17824 states have internal predecessors, (86622), 0 states have call successors, (0), 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:24:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 86622 transitions. [2022-03-15 22:24:55,668 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 86622 transitions. Word has length 19 [2022-03-15 22:24:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:55,668 INFO L470 AbstractCegarLoop]: Abstraction has 17825 states and 86622 transitions. [2022-03-15 22:24:55,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.6944444444444446) internal successors, (194), 72 states have internal predecessors, (194), 0 states have call successors, (0), 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:24:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 86622 transitions. [2022-03-15 22:24:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:24:55,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:55,709 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:55,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-03-15 22:24:55,909 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:24:55,909 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:24:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 373167012, now seen corresponding path program 13 times [2022-03-15 22:24:55,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:55,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945876679] [2022-03-15 22:24:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:55,984 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:24:55,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:55,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945876679] [2022-03-15 22:24:55,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945876679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:55,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492787145] [2022-03-15 22:24:55,985 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:24:55,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:55,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:55,986 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:24:55,987 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:24:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:56,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:24:56,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:56,070 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:24:56,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:56,120 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:24:56,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492787145] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:56,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:56,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-03-15 22:24:56,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514010659] [2022-03-15 22:24:56,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:56,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:56,130 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 233 transitions. [2022-03-15 22:24:56,131 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:58,122 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [968721#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 968728#(or (< j M) (<= N (+ 3 i))), 968700#(or (<= N i) (< k N)), 968709#(or (<= N (+ i 1)) (< k N)), 968730#(or (< j M) (<= k (+ 2 i))), 968708#(or (< j M) (<= (+ N 1) i) (<= N (+ 2 k)) (< (+ 3 k) N)), 968725#(or (<= N (+ 2 i)) (< j M) (<= N k) (< (+ k 1) N)), 968735#(or (< j M) (<= k (+ i 1))), 968715#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 968732#(or (<= N (+ i 1)) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 968690#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 968724#(or (<= N (+ 2 i)) (< j M) (< k N)), 968731#(or (<= N (+ i 1)) (<= N (+ 2 k)) (< (+ 3 k) N)), 968714#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 968734#(or (<= N (+ 2 i)) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 968729#(or (<= k (+ 3 i)) (< j M)), 968689#(or (<= N (+ k 1)) (< (+ 2 k) N)), 968716#(or (<= N (+ i 1)) (< j M)), 968699#(or (<= (+ N 1) i) (<= N (+ 2 k)) (< (+ 3 k) N)), 968695#(or (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 968711#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 968712#(or (<= N i) (< j M)), 968701#(or (<= N i) (<= N k) (< (+ k 1) N)), 968723#(or (<= N (+ 2 i)) (< j M)), 968698#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 968705#(or (< j M) (<= (+ N 1) i) (< k N)), 968697#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 968733#(or (<= N (+ 2 i)) (<= N (+ 2 k)) (< (+ 3 k) N)), 968710#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 968706#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 968693#(or (< j M) (<= N k) (< (+ k 1) N)), 968720#(or (<= N (+ 2 i)) (< k N)), 968707#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 968717#(or (<= N (+ i 1)) (< j M) (< k N)), 968694#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 968702#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 968722#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N)), 968719#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 968718#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 968691#(< j M), 968692#(or (< j M) (< k N)), 968688#(or (<= N k) (< (+ k 1) N)), 968696#(or (<= (+ N 1) i) (< k N)), 968704#(or (< j M) (<= (+ N 1) i)), 968736#(and (or (< j M) (= (+ sum2 (* (- 1) i)) 0)) (or (<= k sum2) (< j M))), 968703#(or (<= N i) (<= N (+ 2 k)) (< (+ 3 k) N)), 968687#(< k N), 968713#(or (<= N i) (< j M) (< k N)), 968726#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< j M) (< (+ 2 k) N)), 968727#(or (<= N i) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N))] [2022-03-15 22:24:58,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 22:24:58,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:58,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 22:24:58,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=3603, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:24:58,123 INFO L87 Difference]: Start difference. First operand 17825 states and 86622 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:25:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:03,525 INFO L93 Difference]: Finished difference Result 20078 states and 95596 transitions. [2022-03-15 22:25:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-03-15 22:25:03,526 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:25:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:03,598 INFO L225 Difference]: With dead ends: 20078 [2022-03-15 22:25:03,598 INFO L226 Difference]: Without dead ends: 20048 [2022-03-15 22:25:03,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12001 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8138, Invalid=32062, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 22:25:03,601 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 709 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:03,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 0 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:25:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20048 states. [2022-03-15 22:25:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20048 to 18146. [2022-03-15 22:25:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18146 states, 18145 states have (on average 4.854670708184073) internal successors, (88088), 18145 states have internal predecessors, (88088), 0 states have call successors, (0), 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:25:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18146 states to 18146 states and 88088 transitions. [2022-03-15 22:25:04,139 INFO L78 Accepts]: Start accepts. Automaton has 18146 states and 88088 transitions. Word has length 19 [2022-03-15 22:25:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:04,139 INFO L470 AbstractCegarLoop]: Abstraction has 18146 states and 88088 transitions. [2022-03-15 22:25:04,139 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:25:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18146 states and 88088 transitions. [2022-03-15 22:25:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:25:04,179 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:04,179 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:04,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 22:25:04,379 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:25:04,379 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:25:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash -980181330, now seen corresponding path program 34 times [2022-03-15 22:25:04,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:04,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342508233] [2022-03-15 22:25:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:04,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:04,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342508233] [2022-03-15 22:25:04,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342508233] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:04,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221434771] [2022-03-15 22:25:04,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:25:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:04,559 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:25:04,559 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:25:04,580 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:25:04,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:04,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 22:25:04,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:04,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:04,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:04,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:04,864 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 23 [2022-03-15 22:25:04,880 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:25:04,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:05,269 INFO L353 Elim1Store]: treesize reduction 114, result has 61.4 percent of original size [2022-03-15 22:25:05,270 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 39 treesize of output 194 [2022-03-15 22:25:11,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:11,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:25:11,935 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 40 treesize of output 99 [2022-03-15 22:25:12,346 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:25:12,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221434771] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:25:12,347 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:25:12,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 22:25:12,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597700682] [2022-03-15 22:25:12,347 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:25:12,348 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:25:12,360 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 233 transitions. [2022-03-15 22:25:12,360 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:25:19,238 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 52 new interpolants: [1025529#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 1025534#(and (or (< (+ i 4) N) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 1025562#(and (or (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (< j M) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025565#(and (or (< (+ i 4) N) (< j M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1025543#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)) (< k N)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 1025542#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1025564#(and (or (< (+ j 1) M) (<= k i) (not (< j M))) (or (< (+ j 1) M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (not (< j M)) (<= sum1 (+ (select A j) sum2))) (or (< (+ j 1) M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (not (< j M)) (<= (+ (select A j) sum2) sum1))), 1025527#(and (or (<= (+ 2 k) N) (<= (+ sum2 (select A k)) sum1) (< i N)) (or (<= (+ 2 k) N) (<= sum1 (+ sum2 (select A k))) (< i N))), 1025532#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025559#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025540#(and (or (<= sum1 sum2) (< j M) (< k N) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N) (< i N))), 1025551#(and (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 1025556#(and (or (< (+ j 1) M) (not (< j M)) (< (+ 2 k) i) (<= sum1 (+ (select A j) (select A (+ (- 1) i)) sum2 (select A k)))) (or (< (+ j 1) M) (<= (+ (select A j) (select A (+ (- 1) i)) sum2 (select A k)) sum1) (not (< j M)) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< (+ j 1) M) (not (< j M)))), 1025563#(and (or (<= sum1 sum2) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0))) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= sum2 sum1)) (or (<= k i) (< j M))), 1025547#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 1025526#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1))), 1025569#(and (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 1025552#(and (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (<= (+ k 4) N)) (or (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (<= (+ k 4) N))), 1025533#(and (or (< (+ i 4) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1025567#(and (or (<= (+ 3 k) N) (< (+ i 4) N) (not (< (+ 3 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (<= (+ 3 k) N) (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 3 i) N)))), 1025568#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (< j M) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 1025535#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ 2 k) N) (not (< (+ 3 i) N)) (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)))))), 1025538#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N))), 1025545#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 1025549#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M) (< i N))), 1025560#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1025518#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 1025537#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N)))), 1025546#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< k N))), 1025554#(and (or (<= (+ 2 k) i) (< j M) (<= sum1 (+ sum2 (select A k)))) (or (<= (+ 2 k) i) (< j M) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= (+ k 1) i))), 1025548#(and (or (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (<= (+ 3 k) N) (< j M)) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 1025561#(and (or (<= (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1025536#(and (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (<= sum1 (+ sum2 (select A k) (select A (+ (- 1) N)))) (< i N)) (or (< (+ 2 k) N) (<= (+ sum2 (select A k) (select A (+ (- 1) N))) sum1) (< i N))), 1025541#(and (or (<= (+ 2 k) N) (< j M) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum2 (select A k)) sum1) (< i N))), 1025530#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1025558#(and (or (<= (+ 3 k) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum2 (select A k))) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)))) (< (+ 3 i) N))), 1025522#(and (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)) (< k N)) (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2) (< k N))), 1025555#(and (or (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k)) sum1) (not (< j M)) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) (select A (+ 2 k)) sum2 (select A k))) (not (< j M)) (<= (+ k 4) N))), 1025531#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1025553#(and (or (< j M) (<= (+ (select A (+ (- 1) i)) sum2 (select A k)) sum1) (< (+ 2 k) i)) (or (<= sum1 (+ (select A (+ (- 1) i)) sum2 (select A k))) (< j M) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< j M))), 1025566#(and (or (< (+ i 4) N) (< j M) (< k N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (< k N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N)))), 1025519#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 1025524#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 1025523#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)) (< k N)) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N))), 1025544#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1))) (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (< j M) (not (< i N)))), 1025550#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum2 (select A k))) (not (< i N))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) sum2 (select A k)) (+ (select A i) sum1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1025539#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 1025528#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 1025521#(and (or (< sum2 (+ sum1 1)) (< k N) (< i N)) (or (<= sum1 sum2) (< k N) (< i N))), 1025557#(and (or (<= (+ 2 k) i) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (<= (+ 2 k) i) (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)))), 1025520#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 1025525#(and (or (<= sum1 sum2) (< j M) (< k N)) (or (< sum2 (+ sum1 1)) (< j M) (< k N)))] [2022-03-15 22:25:19,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 22:25:19,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:25:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 22:25:19,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=6133, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 22:25:19,239 INFO L87 Difference]: Start difference. First operand 18146 states and 88088 transitions. Second operand has 65 states, 64 states have (on average 2.765625) internal successors, (177), 64 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:26:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:26:56,891 INFO L93 Difference]: Finished difference Result 26782 states and 115059 transitions. [2022-03-15 22:26:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 536 states. [2022-03-15 22:26:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.765625) internal successors, (177), 64 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:26:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:26:56,972 INFO L225 Difference]: With dead ends: 26782 [2022-03-15 22:26:56,972 INFO L226 Difference]: Without dead ends: 26556 [2022-03-15 22:26:56,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 40 SyntacticMatches, 16 SemanticMatches, 588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141821 ImplicationChecksByTransitivity, 95.2s TimeCoverageRelationStatistics Valid=43154, Invalid=304356, Unknown=0, NotChecked=0, Total=347510 [2022-03-15 22:26:56,985 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1811 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 6560 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1811 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 6560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:26:56,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1811 Valid, 0 Invalid, 7013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 6560 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 22:26:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2022-03-15 22:26:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 18554. [2022-03-15 22:26:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18554 states, 18553 states have (on average 4.848488115129629) internal successors, (89954), 18553 states have internal predecessors, (89954), 0 states have call successors, (0), 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:26:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18554 states to 18554 states and 89954 transitions. [2022-03-15 22:26:57,675 INFO L78 Accepts]: Start accepts. Automaton has 18554 states and 89954 transitions. Word has length 19 [2022-03-15 22:26:57,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:26:57,675 INFO L470 AbstractCegarLoop]: Abstraction has 18554 states and 89954 transitions. [2022-03-15 22:26:57,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.765625) internal successors, (177), 64 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:26:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 18554 states and 89954 transitions. [2022-03-15 22:26:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:26:57,720 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:26:57,720 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:26:57,736 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:26:57,921 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:26:57,921 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:26:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:26:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash -163838756, now seen corresponding path program 35 times [2022-03-15 22:26:57,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:26:57,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318143273] [2022-03-15 22:26:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:26:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:26:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:26:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:58,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:26:58,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318143273] [2022-03-15 22:26:58,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318143273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:26:58,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99336210] [2022-03-15 22:26:58,101 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:26:58,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:26:58,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:26:58,102 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:26:58,102 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:26:58,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:26:58,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:26:58,126 WARN L261 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 22:26:58,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:26:58,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:58,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:58,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:58,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:58,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:26:58,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:58,401 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-03-15 22:26:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:26:58,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:26:58,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:26:58,809 INFO L353 Elim1Store]: treesize reduction 96, result has 66.3 percent of original size [2022-03-15 22:26:58,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 39 treesize of output 202 [2022-03-15 22:27:08,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:27:08,297 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:27:08,297 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 40 treesize of output 99 [2022-03-15 22:27:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:27:08,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99336210] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:27:08,733 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:27:08,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 22:27:08,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607422221] [2022-03-15 22:27:08,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:27:08,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:27:08,746 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 228 transitions. [2022-03-15 22:27:08,746 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:27:13,881 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [1090615#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (not (< (+ 2 i) N)) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1090623#(and (or (< j M) (<= N k) (<= sum1 (+ sum2 (select A k)))) (or (< (+ sum2 (select A k)) (+ sum1 1)) (< j M) (<= N k))), 1090619#(and (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1)))), 1090634#(and (or (< j M) (<= (+ 2 i) k) (<= (+ (select A i) sum1) sum2)) (or (< j M) (<= (+ 2 i) k) (<= sum2 (+ (select A i) sum1))) (or (<= (+ i 1) k) (< j M))), 1090629#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (< j M) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N)) (or (< j M) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1090641#(and (or (< (+ i 4) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1090645#(and (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M) (<= (+ (select A j) (select A (+ j 1)) sum2) sum1)) (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M) (<= sum1 (+ (select A j) (select A (+ j 1)) sum2))) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (< i (+ k 1)))), 1090621#(and (or (<= N k) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (<= N k) (<= (+ sum2 (select A k)) sum1) (< i N))), 1090617#(and (or (<= sum1 sum2) (< j M) (< i N)) (or (< sum2 (+ sum1 1)) (< j M) (< i N))), 1090633#(and (or (<= sum1 sum2) (<= (+ i 1) k) (< j M)) (or (<= (+ i 1) k) (< j M) (<= sum2 sum1)) (or (< j M) (< i (+ k 1)))), 1090639#(and (or (< (+ j 1) M) (not (< j M)) (<= i k) (<= (+ (select A j) sum2 (select A k)) sum1)) (or (< (+ j 1) M) (not (< j M)) (<= i (+ k 1))) (or (< (+ j 1) M) (<= sum1 (+ (select A j) sum2 (select A k))) (not (< j M)) (<= i k))), 1090632#(and (or (< j M) (<= i k) (<= (+ sum2 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum2 (select A k))) (<= i k)) (or (< j M) (<= i (+ k 1)))), 1090625#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (< j M) (not (< i N)) (<= N k)) (or (< (+ i 1) N) (< j M) (not (< i N)) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 1090636#(and (or (< (+ j 1) M) (not (< j M)) (<= i (+ 2 k))) (or (< i (+ 2 k)) (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) sum2 (select A k))) (not (< j M))) (or (< i (+ 2 k)) (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) sum2 (select A k)) sum1) (not (< j M)))), 1090642#(and (or (< (+ i 4) N) (< j M) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) sum2) (not (< (+ 3 i) N)))), 1090624#(and (or (< j M) (<= N k) (<= sum1 (+ sum2 (select A k))) (< i N)) (or (< j M) (<= N k) (<= (+ sum2 (select A k)) sum1) (< i N))), 1090637#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= N (+ 2 k))) (or (<= N (+ k 1)) (not (< (+ j 1) M)) (< (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k)) (+ sum1 1)) (< (+ 2 j) M)) (or (<= N (+ k 1)) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= sum1 (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k))))), 1090613#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (not (< i N)))), 1090628#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= N k) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))))), 1090640#(and (or (<= sum1 (+ (select A j) (select A (+ j 1)) sum2 (select A k))) (not (< (+ j 1) M)) (<= i k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2 (select A k)) sum1) (<= i k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= i (+ k 1)))), 1090635#(and (or (<= N (+ k 1)) (< (+ j 1) M) (not (< j M)) (< (+ (select A j) (select A (+ k 1)) sum2 (select A k)) (+ sum1 1))) (or (<= N (+ k 1)) (< (+ j 1) M) (<= sum1 (+ (select A j) (select A (+ k 1)) sum2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= N (+ 2 k)))), 1090643#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)) (<= (+ (select A j) sum2) sum1)) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)) (<= sum1 (+ (select A j) sum2)))), 1090627#(and (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) (+ sum2 (select A k))) (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N)) (or (not (< (+ 2 i) N)) (<= N k) (< (+ 3 i) N) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1)))), 1090630#(and (or (< j M) (<= N (+ 2 k))) (or (<= N (+ k 1)) (< j M) (< (+ (select A (+ k 1)) sum2 (select A k)) (+ sum1 1))) (or (<= N (+ k 1)) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M))), 1090622#(and (or (< (+ i 1) N) (<= (+ (select A i) sum1) (+ sum2 (select A k))) (not (< i N)) (<= N k)) (or (< (+ i 1) N) (not (< i N)) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1)))), 1090648#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (< j M) (<= N k) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (< j M) (<= N k) (not (< (+ 3 i) N)) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)))), 1090644#(and (or (<= (+ (select A i) sum1) (+ (select A j) sum2)) (< (+ j 1) M) (<= (+ 2 i) k) (not (< j M))) (or (< (+ j 1) M) (<= (+ (select A j) sum2) (+ (select A i) sum1)) (<= (+ 2 i) k) (not (< j M))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)))), 1090612#(and (or (< sum2 (+ sum1 1)) (< i N)) (or (<= sum1 sum2) (< i N))), 1090631#(and (or (< i (+ 2 k)) (<= sum1 (+ (select A (+ k 1)) sum2 (select A k))) (< j M)) (or (< i (+ 2 k)) (<= (+ (select A (+ k 1)) sum2 (select A k)) sum1) (< j M)) (or (< j M) (<= i (+ 2 k)))), 1090647#(and (or (< (+ i 4) N) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1))) (+ sum2 (select A k))) (<= N k) (not (< (+ 3 i) N))) (or (< (+ i 4) N) (<= N k) (not (< (+ 3 i) N)) (< (+ sum2 (select A k)) (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ 3 i)) (select A (+ i 1)) 1)))), 1090614#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< sum2 (+ (select A i) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) sum1 (select A (+ i 1))) sum2) (not (< (+ i 1) N)) (< (+ 2 i) N))), 1090620#(and (or (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< sum2 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1)) 1))) (or (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum2) (< j M) (not (< (+ 2 i) N)) (< (+ 3 i) N))), 1090618#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (<= (+ (select A i) sum1) sum2)) (or (< sum2 (+ (select A i) sum1 1)) (< (+ i 1) N) (< j M) (not (< i N)))), 1090616#(and (or (<= sum1 sum2) (< j M)) (or (< sum2 (+ sum1 1)) (< j M))), 1090646#(and (or (not (< (+ j 1) M)) (<= (+ i 1) k) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select A j) (select A (+ j 1)) sum2) (+ (select A i) sum1)) (<= (+ 2 i) k) (< (+ 2 j) M)) (or (<= (+ (select A i) sum1) (+ (select A j) (select A (+ j 1)) sum2)) (not (< (+ j 1) M)) (<= (+ 2 i) k) (< (+ 2 j) M))), 1090626#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N k) (<= (+ sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N k) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum2 (select A k))))), 1090638#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= i (+ 2 k))) (or (< i (+ 2 k)) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k)) sum1)) (or (< i (+ 2 k)) (not (< (+ j 1) M)) (< (+ 2 j) M) (<= sum1 (+ (select A j) (select A (+ k 1)) (select A (+ j 1)) sum2 (select A k)))))] [2022-03-15 22:27:13,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 22:27:13,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:27:13,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 22:27:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=4012, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:27:13,883 INFO L87 Difference]: Start difference. First operand 18554 states and 89954 transitions. Second operand has 49 states, 48 states have (on average 3.125) internal successors, (150), 48 states have internal predecessors, (150), 0 states have call successors, (0), 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:29:55,361 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:29:55,361 WARN L244 SmtUtils]: Removed 7 from assertion stack [2022-03-15 22:29:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 676 states. [2022-03-15 22:29:55,361 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:29:55,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243219 ImplicationChecksByTransitivity, 158.6s TimeCoverageRelationStatistics Valid=64241, Invalid=456321, Unknown=0, NotChecked=0, Total=520562 [2022-03-15 22:29:55,378 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 973 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 4856 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 4856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:29:55,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [973 Valid, 0 Invalid, 5597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 4856 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 22:29:55,379 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:29:55,394 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:29:55,594 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:29:55,594 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 676 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 66 for 51ms.. [2022-03-15 22:29:55,595 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:29:55,596 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:29:55,596 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:29:55,597 INFO L732 BasicCegarLoop]: Path program histogram: [35, 13, 1, 1, 1] [2022-03-15 22:29:55,598 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:29:55,598 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:29:55,600 INFO L202 PluginConnector]: Adding new model sum-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:29:55 BasicIcfg [2022-03-15 22:29:55,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:29:55,601 INFO L158 Benchmark]: Toolchain (without parser) took 747761.14ms. Allocated memory was 177.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 135.6MB in the beginning and 616.7MB in the end (delta: -481.0MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-15 22:29:55,601 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 177.2MB. Free memory was 136.8MB in the beginning and 136.7MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:29:55,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.56ms. Allocated memory is still 177.2MB. Free memory was 135.5MB in the beginning and 133.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:29:55,601 INFO L158 Benchmark]: Boogie Preprocessor took 16.28ms. Allocated memory is still 177.2MB. Free memory was 133.9MB in the beginning and 133.1MB in the end (delta: 854.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:29:55,601 INFO L158 Benchmark]: RCFGBuilder took 223.42ms. Allocated memory is still 177.2MB. Free memory was 132.9MB in the beginning and 123.8MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:29:55,601 INFO L158 Benchmark]: TraceAbstraction took 747488.85ms. Allocated memory was 177.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 123.1MB in the beginning and 616.7MB in the end (delta: -493.5MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-15 22:29:55,601 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 177.2MB. Free memory was 136.8MB in the beginning and 136.7MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.56ms. Allocated memory is still 177.2MB. Free memory was 135.5MB in the beginning and 133.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.28ms. Allocated memory is still 177.2MB. Free memory was 133.9MB in the beginning and 133.1MB in the end (delta: 854.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.42ms. Allocated memory is still 177.2MB. Free memory was 132.9MB in the beginning and 123.8MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 747488.85ms. Allocated memory was 177.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 123.1MB in the beginning and 616.7MB in the end (delta: -493.5MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , 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: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (18554states) and FLOYD_HOARE automaton (currently 676 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 66 for 51ms.. - TimeoutResultAtElement [Line: 58]: 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 (18554states) and FLOYD_HOARE automaton (currently 676 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 66 for 51ms.. - TimeoutResultAtElement [Line: 59]: 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 (18554states) and FLOYD_HOARE automaton (currently 676 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 66 for 51ms.. - TimeoutResultAtElement [Line: 58]: 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 (18554states) and FLOYD_HOARE automaton (currently 676 states, 49 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 66 for 51ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 747.4s, OverallIterations: 51, TraceHistogramMax: 5, PathProgramHistogramMax: 35, EmptinessCheckTime: 0.7s, AutomataDifference: 597.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27068 SdHoareTripleChecker+Valid, 48.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27068 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 41.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20349 mSDsCounter, 13017 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87512 IncrementalHoareTripleChecker+Invalid, 100529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13017 mSolverCounterUnsat, 0 mSDtfsCounter, 87512 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11498 GetRequests, 2423 SyntacticMatches, 256 SemanticMatches, 8818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070552 ImplicationChecksByTransitivity, 569.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18554occurred in iteration=50, InterpolantAutomatonStates: 6890, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 50 MinimizatonAttempts, 225467 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 49.6s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 2306 ConstructedInterpolants, 27 QuantifiedInterpolants, 26906 SizeOfPredicates, 165 NumberOfNonLiveVariables, 3406 ConjunctsInSsa, 743 ConjunctsInUnsatCore, 147 InterpolantComputations, 3 PerfectInterpolantSequences, 490/1499 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