/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/dot-product.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:00:57,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:00:57,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:00:57,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:00:57,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:00:57,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:00:57,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:00:57,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:00:57,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:00:57,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:00:57,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:00:57,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:00:57,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:00:57,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:00:57,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:00:57,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:00:57,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:00:57,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:00:57,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:00:57,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:00:57,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:00:57,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:00:57,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:00:57,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:00:57,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:00:57,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:00:57,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:00:57,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:00:57,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:00:57,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:00:57,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:00:57,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:00:57,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:00:57,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:00:57,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:00:57,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:00:57,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:00:57,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:00:57,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:00:57,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:00:57,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:00:57,205 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:00:57,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:00:57,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:00:57,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:00:57,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:00:57,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:00:57,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:00:57,228 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:00:57,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:00:57,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:00:57,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:00:57,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:00:57,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:00:57,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:00:57,230 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:00:57,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:00:57,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:00:57,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:00:57,440 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:00:57,441 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:00:57,442 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/dot-product.wvr.bpl [2022-03-15 22:00:57,442 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product.wvr.bpl' [2022-03-15 22:00:57,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:00:57,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:00:57,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:00:57,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:00:57,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:00:57,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,497 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:00:57,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:00:57,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:00:57,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:00:57,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:00:57,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:00:57,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:00:57,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:00:57,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:00:57,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/1) ... [2022-03-15 22:00:57,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:00:57,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:57,535 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:00:57,537 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:00:57,560 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:00:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:00:57,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:00:57,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:00:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:00:57,561 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:00:57,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:00:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:00:57,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:00:57,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:00:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:00:57,561 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:00:57,562 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:00:57,602 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:00:57,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:00:57,668 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:00:57,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:00:57,678 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:00:57,679 INFO L202 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:00:57 BoogieIcfgContainer [2022-03-15 22:00:57,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:00:57,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:00:57,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:00:57,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:00:57,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:00:57" (1/2) ... [2022-03-15 22:00:57,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea5b1ed and model type dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:00:57, skipping insertion in model container [2022-03-15 22:00:57,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:00:57" (2/2) ... [2022-03-15 22:00:57,693 INFO L111 eAbstractionObserver]: Analyzing ICFG dot-product.wvr.bpl [2022-03-15 22:00:57,696 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:00:57,696 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:00:57,696 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:00:57,696 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:00:57,735 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:00:57,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:00:57,776 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:00:57,776 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:00:57,783 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:00:57,790 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:00:57,792 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:00:57,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:00:57,821 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:00:57,821 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:00:57,824 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:00:57,825 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:00:58,032 INFO L131 LiptonReduction]: Checked pairs total: 116 [2022-03-15 22:00:58,032 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:00:58,055 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:00:58,067 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:00:58,069 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:00:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:00:58,072 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:58,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:58,073 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:00:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 728886645, now seen corresponding path program 1 times [2022-03-15 22:00:58,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:58,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633955311] [2022-03-15 22:00:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:58,196 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:00:58,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:58,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633955311] [2022-03-15 22:00:58,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633955311] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:00:58,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:00:58,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:00:58,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1209887935] [2022-03-15 22:00:58,199 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:58,205 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:58,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:00:58,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:58,460 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:00:58,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:00:58,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:00:58,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:00:58,476 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:00:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:58,506 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:00:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:00:58,508 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:00:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:58,513 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:00:58,513 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:00:58,513 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:00:58,516 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:00:58,516 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:00:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:00:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:00:58,537 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:00:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:00:58,539 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:00:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:58,539 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:00:58,540 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:00:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:00:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:00:58,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:58,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:58,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:00:58,541 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:00:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash -792257197, now seen corresponding path program 1 times [2022-03-15 22:00:58,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:58,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198218098] [2022-03-15 22:00:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:58,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:58,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198218098] [2022-03-15 22:00:58,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198218098] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:00:58,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:00:58,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:00:58,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812288251] [2022-03-15 22:00:58,579 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:58,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:58,582 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:00:58,582 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:58,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:00:58,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:00:58,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:00:58,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:00:58,733 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:00:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:58,758 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:00:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:00:58,759 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:00:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:58,760 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:00:58,760 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:00:58,761 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:00:58,762 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:00:58,762 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:00:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:00:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:00:58,766 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:00:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:00:58,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:00:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:58,767 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:00:58,767 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:00:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:00:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:00:58,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:58,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:58,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:00:58,768 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:00:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1020296991, now seen corresponding path program 1 times [2022-03-15 22:00:58,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:58,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171601900] [2022-03-15 22:00:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:58,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:58,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:58,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171601900] [2022-03-15 22:00:58,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171601900] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:58,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903724469] [2022-03-15 22:00:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:58,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:58,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:58,809 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:00:58,817 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:00:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:58,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:00:58,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:58,918 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:00:58,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 22:00:58,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903724469] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:00:58,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 22:00:58,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-03-15 22:00:58,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614695610] [2022-03-15 22:00:58,919 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:58,920 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:58,922 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:00:58,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:59,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:00:59,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:00:59,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:00:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 22:00:59,034 INFO L87 Difference]: Start difference. First operand 31 states and 80 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:00:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:59,051 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:00:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:00:59,051 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:00:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:59,051 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:00:59,052 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:00:59,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 22:00:59,053 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 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:00:59,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 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:00:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:00:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:00:59,056 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:00:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:00:59,056 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:00:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:00:59,057 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:00:59,057 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:00:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:00:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:00:59,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:00:59,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:59,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:00:59,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:59,258 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:00:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:00:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1109478145, now seen corresponding path program 1 times [2022-03-15 22:00:59,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:00:59,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537756719] [2022-03-15 22:00:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:00:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:59,421 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:00:59,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:00:59,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537756719] [2022-03-15 22:00:59,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537756719] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:00:59,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57115296] [2022-03-15 22:00:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:00:59,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:00:59,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:00:59,423 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:00:59,428 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:00:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:00:59,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:00:59,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:00:59,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:00:59,566 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 76 [2022-03-15 22:00:59,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:00:59,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 56 [2022-03-15 22:00:59,586 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:00:59,586 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 16 treesize of output 21 [2022-03-15 22:00:59,680 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:00:59,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:00:59,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:00:59,771 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 24 treesize of output 29 [2022-03-15 22:00:59,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:00:59,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-03-15 22:00:59,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:00:59,792 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 15 treesize of output 20 [2022-03-15 22:00:59,831 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 23 treesize of output 19 [2022-03-15 22:00:59,843 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 22:00:59,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 22:00:59,867 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:00:59,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57115296] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:59,867 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:59,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:00:59,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450336821] [2022-03-15 22:00:59,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:59,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:59,873 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:00:59,873 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:00,753 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [570#(and (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))), 572#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (select (select mult (select A k)) (select B k))) (<= k M)) (or (< 0 (+ k 1)) (= res2 0)) (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (select (select mult (select A k)) (select B k))) (< 0 (+ k 1))) (or (<= k M) (<= (select (select mult (select A k)) (select B k)) (+ res1 (select (select mult (select A i)) (select B i))))) (or (= j 0) (<= (select (select mult (select A k)) (select B k)) (+ res1 (select (select mult (select A i)) (select B i))))) (or (= res2 0) (not (= k 0))) (or (<= k M) (= res2 0)) (or (<= (select (select mult (select A k)) (select B k)) (+ res1 (select (select mult (select A i)) (select B i)))) (not (= k 0))) (or (= j 0) (= res2 0)) (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (= j 0)) (or (< 0 (+ k 1)) (<= (select (select mult (select A k)) (select B k)) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (select (select mult (select A k)) (select B k))) (not (= k 0)))), 569#(and (or (= j 0) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (= j 0) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 568#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))), 554#(or (< j M) (and (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 571#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)) 1))), 547#(or (< j M) (and (<= res1 res2) (< res2 (+ res1 1))))] [2022-03-15 22:01:00,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:01:00,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:01:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:01:00,754 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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:01:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:01,001 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:01:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:01:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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 13 [2022-03-15 22:01:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:01,003 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:01:01,003 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:01:01,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:01:01,003 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:01,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:01:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:01:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:01:01,008 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:01:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:01:01,009 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:01:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:01,009 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:01:01,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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:01:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:01:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:01:01,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:01,010 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:01,028 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:01:01,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 22:01:01,211 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:01:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash -420873377, now seen corresponding path program 2 times [2022-03-15 22:01:01,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:01,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466064010] [2022-03-15 22:01:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:01,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:01,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466064010] [2022-03-15 22:01:01,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466064010] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:01,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666482596] [2022-03-15 22:01:01,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:01:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:01,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:01,261 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:01:01,262 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:01:01,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:01:01,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:01,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:01:01,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:01,348 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:01:01,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:01,421 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:01:01,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666482596] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:01,422 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:01,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 22:01:01,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407563821] [2022-03-15 22:01:01,422 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:01,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:01,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:01:01,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:01,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [884#(<= N i), 888#(or (<= (+ k j 1) (+ N M)) (<= N i)), 892#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 896#(or (<= N k) (<= (+ j 1) M) (< (+ k 1) N)), 894#(or (<= N (+ i 1)) (<= (+ k j 1) (+ N M))), 882#(< k N), 889#(or (<= N i) (<= (+ 2 k j) (+ N M))), 887#(or (<= N i) (<= (+ j 1) M)), 895#(or (<= N (+ i 1)) (<= (+ 2 k j) (+ N M))), 890#(<= N (+ i 1)), 891#(or (<= N (+ i 1)) (< k N)), 885#(or (<= N i) (< k N)), 886#(or (<= N i) (<= N k) (< (+ k 1) N)), 883#(or (<= N k) (< (+ k 1) N)), 893#(or (<= N (+ i 1)) (< j M)), 860#(or (< k N) (<= (+ j 1) M))] [2022-03-15 22:01:01,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:01:01,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:01:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:01:01,972 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:01:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:03,101 INFO L93 Difference]: Finished difference Result 166 states and 479 transitions. [2022-03-15 22:01:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 22:01:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:01:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:03,103 INFO L225 Difference]: With dead ends: 166 [2022-03-15 22:01:03,103 INFO L226 Difference]: Without dead ends: 164 [2022-03-15 22:01:03,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1175, Invalid=4227, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 22:01:03,105 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:03,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:01:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-03-15 22:01:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 86. [2022-03-15 22:01:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 3.2705882352941176) internal successors, (278), 85 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 278 transitions. [2022-03-15 22:01:03,113 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 278 transitions. Word has length 14 [2022-03-15 22:01:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:03,113 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 278 transitions. [2022-03-15 22:01:03,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:01:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 278 transitions. [2022-03-15 22:01:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:01:03,114 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:03,114 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:03,135 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:01:03,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:03,336 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:01:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash -66268397, now seen corresponding path program 3 times [2022-03-15 22:01:03,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:03,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596983499] [2022-03-15 22:01:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:03,371 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:01:03,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:03,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596983499] [2022-03-15 22:01:03,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596983499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:03,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096008266] [2022-03-15 22:01:03,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:01:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:03,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:03,373 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:01:03,373 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:01:03,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:01:03,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:03,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:01:03,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:03,459 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:01:03,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:03,484 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:01:03,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096008266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:03,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:03,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2022-03-15 22:01:03,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1086870560] [2022-03-15 22:01:03,485 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:03,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:03,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:01:03,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:03,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1419#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 1416#(or (<= N i) (< k N) (<= (+ 2 i) N)), 1422#(or (<= N i) (<= i k)), 1414#(or (<= N i) (<= (+ 2 i) N)), 1411#(< k N), 1417#(or (<= N k) (< (+ k 1) N) (< i N)), 1418#(or (<= N i) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 1421#(or (<= (+ i 1) k) (<= N i)), 1415#(or (< k N) (< i N)), 1413#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1412#(or (<= N k) (< (+ k 1) N)), 1420#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N) (<= (+ 2 i) N))] [2022-03-15 22:01:03,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:01:03,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:01:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-03-15 22:01:03,916 INFO L87 Difference]: Start difference. First operand 86 states and 278 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:04,501 INFO L93 Difference]: Finished difference Result 256 states and 765 transitions. [2022-03-15 22:01:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 22:01:04,502 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:01:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:04,503 INFO L225 Difference]: With dead ends: 256 [2022-03-15 22:01:04,503 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 22:01:04,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=581, Invalid=1869, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 22:01:04,504 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:04,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:01:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 22:01:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-03-15 22:01:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.4390243902439024) internal successors, (564), 164 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 564 transitions. [2022-03-15 22:01:04,523 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 564 transitions. Word has length 14 [2022-03-15 22:01:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:04,523 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 564 transitions. [2022-03-15 22:01:04,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 564 transitions. [2022-03-15 22:01:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:01:04,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:04,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:04,543 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:01:04,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:04,732 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:01:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 730566742, now seen corresponding path program 1 times [2022-03-15 22:01:04,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:04,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244785553] [2022-03-15 22:01:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:04,756 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:01:04,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:04,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244785553] [2022-03-15 22:01:04,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244785553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:04,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774964236] [2022-03-15 22:01:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:04,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:04,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:04,760 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:01:04,761 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:01:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:01:04,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:04,836 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:01:04,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:04,879 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:01:04,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774964236] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:04,880 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:04,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:01:04,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449654973] [2022-03-15 22:01:04,880 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:04,881 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:04,884 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 22:01:04,884 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:05,036 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2154#(or (<= N i) (<= (+ M i 1) (+ N j))), 2153#(or (<= N i) (< (+ i 1) N)), 2152#(< i N)] [2022-03-15 22:01:05,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 22:01:05,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:05,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 22:01:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:01:05,037 INFO L87 Difference]: Start difference. First operand 165 states and 564 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:05,216 INFO L93 Difference]: Finished difference Result 312 states and 1007 transitions. [2022-03-15 22:01:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:01:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:01:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:05,219 INFO L225 Difference]: With dead ends: 312 [2022-03-15 22:01:05,220 INFO L226 Difference]: Without dead ends: 310 [2022-03-15 22:01:05,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:01:05,221 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:05,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:01:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-03-15 22:01:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 224. [2022-03-15 22:01:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.475336322869955) internal successors, (775), 223 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 775 transitions. [2022-03-15 22:01:05,238 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 775 transitions. Word has length 14 [2022-03-15 22:01:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:05,239 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 775 transitions. [2022-03-15 22:01:05,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 775 transitions. [2022-03-15 22:01:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:01:05,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:05,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:05,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:05,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:05,459 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:01:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash -262525323, now seen corresponding path program 4 times [2022-03-15 22:01:05,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:05,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944587580] [2022-03-15 22:01:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:05,709 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:01:05,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:05,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944587580] [2022-03-15 22:01:05,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944587580] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:05,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910044385] [2022-03-15 22:01:05,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:01:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:05,710 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:01:05,711 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:01:05,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:01:05,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:05,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:01:05,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:05,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:05,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:05,879 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:05,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 68 [2022-03-15 22:01:05,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:05,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 118 [2022-03-15 22:01:05,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:05,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:05,923 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:05,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 123 [2022-03-15 22:01:06,242 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:01:06,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:06,410 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:01:06,411 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 49 treesize of output 74 [2022-03-15 22:01:06,439 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:06,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 112 [2022-03-15 22:01:06,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:06,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:06,471 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:06,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 107 [2022-03-15 22:01:06,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:06,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:06,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:06,812 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 50 treesize of output 38 [2022-03-15 22:01:06,832 INFO L353 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-03-15 22:01:06,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2022-03-15 22:01:06,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:06,835 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 17 treesize of output 11 [2022-03-15 22:01:06,859 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:01:06,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910044385] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:06,860 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:06,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:01:06,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672327809] [2022-03-15 22:01:06,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:06,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:06,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:01:06,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:09,393 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [3051#(and (or (<= 1 M) (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (= j 0) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (= j 0) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= 1 M) (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 3044#(and (or (<= N i) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 3046#(and (or (not (< (+ k 1) N)) (<= N i) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (<= N i) (< (+ 2 k) N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 3052#(and (or (<= N i) (< j M) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (= j 0) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (= j 0) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< j M) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 3047#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 3053#(and (or (<= N i) (<= (+ 2 k) N) (= j 0)) (or (<= 1 M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N)) (or (<= 1 M) (<= N i) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 3061#(and (or (<= N (+ i 1)) (< (+ 2 k) (+ N M)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)))) (not (= k 0))) (or (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (< (+ 2 k) (+ N M)) (not (= k 0))) (or (<= N (+ i 1)) (<= k 0) (<= k M)) (or (<= N (+ i 1)) (< 0 (+ k 1))) (or (<= N (+ i 1)) (= res2 0) (not (= k 0))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= (+ 2 k) (+ N M)) (not (= k 0)))), 3040#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 3048#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 3041#(and (or (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 3011#(or (< j M) (and (<= res1 res2) (< res2 (+ res1 1)))), 3043#(and (or (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 3054#(and (or (<= N (+ i 1)) (= j 0) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (= j 0) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 3055#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (= j 0) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (= j 0) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 3042#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)))), 3045#(and (or (not (< k N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (< (+ k 1) N)) (or (not (< k N)) (<= N i) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N))), 3059#(and (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)))), 3056#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= 1 M) (<= (+ 2 k) N)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= 1 M) (<= (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 k) N) (= j 0))), 3060#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)))) (<= N i) (< (+ 2 k) (+ N M)) (not (= k 0))) (or (<= N i) (= res2 0) (not (= k 0))) (or (<= N i) (= j 0)) (or (<= N i) (<= k 0) (<= k M)) (or (<= N i) (<= (+ 2 k) (+ N M)) (not (= k 0))) (or (<= N i) (< 0 (+ k 1))) (or (<= N i) (< (+ 2 k) (+ N M)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k))) (+ res1 (select (select mult (select A i)) (select B i)))) (not (= k 0)))), 3050#(and (or (<= N (+ i 1)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (not (< (+ k 1) N)) (< (+ 2 k) N)) (or (<= N (+ i 1)) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 3049#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (not (< k N)) (< (+ k 1) N)) (or (<= N (+ i 1)) (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N))), 3057#(and (or (< j M) (< k N) (< res2 (+ res1 1))) (or (<= res1 res2) (< j M) (< k N))), 3058#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))) (or (not (< k N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (< (+ k 1) N)))] [2022-03-15 22:01:09,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:01:09,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:09,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:01:09,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:01:09,394 INFO L87 Difference]: Start difference. First operand 224 states and 775 transitions. Second operand has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 31 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:01:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:27,897 INFO L93 Difference]: Finished difference Result 755 states and 2239 transitions. [2022-03-15 22:01:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 22:01:27,898 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 31 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:01:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:27,908 INFO L225 Difference]: With dead ends: 755 [2022-03-15 22:01:27,908 INFO L226 Difference]: Without dead ends: 736 [2022-03-15 22:01:27,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9037 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=4072, Invalid=22988, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 22:01:27,913 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 776 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:27,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 0 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:01:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-03-15 22:01:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 285. [2022-03-15 22:01:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.566901408450704) internal successors, (1013), 284 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1013 transitions. [2022-03-15 22:01:27,923 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1013 transitions. Word has length 15 [2022-03-15 22:01:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:27,923 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 1013 transitions. [2022-03-15 22:01:27,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 31 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:01:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1013 transitions. [2022-03-15 22:01:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:01:27,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:27,925 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:27,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:28,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:28,131 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:01:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 534309816, now seen corresponding path program 2 times [2022-03-15 22:01:28,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:28,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536230440] [2022-03-15 22:01:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:28,261 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:01:28,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:28,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536230440] [2022-03-15 22:01:28,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536230440] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:28,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039698462] [2022-03-15 22:01:28,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:01:28,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:28,263 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:01:28,267 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:01:28,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:01:28,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:28,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:01:28,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:28,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:28,560 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 43 treesize of output 35 [2022-03-15 22:01:28,574 INFO L353 Elim1Store]: treesize reduction 25, result has 44.4 percent of original size [2022-03-15 22:01:28,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 30 [2022-03-15 22:01:28,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:28,580 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 25 treesize of output 21 [2022-03-15 22:01:28,605 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:01:28,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:28,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:28,748 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 45 treesize of output 72 [2022-03-15 22:01:28,776 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:28,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 106 [2022-03-15 22:01:28,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:28,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:28,796 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:28,796 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 97 treesize of output 103 [2022-03-15 22:01:30,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:30,438 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 45 treesize of output 35 [2022-03-15 22:01:30,457 INFO L353 Elim1Store]: treesize reduction 67, result has 26.4 percent of original size [2022-03-15 22:01:30,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 [2022-03-15 22:01:30,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:30,460 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 15 treesize of output 11 [2022-03-15 22:01:30,493 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:01:30,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039698462] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:30,493 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:30,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 22:01:30,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924932181] [2022-03-15 22:01:30,493 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:30,494 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:30,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:01:30,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:31,788 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4747#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 4744#(and (or (not (< i N)) (< k N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ 2 i) N)) (or (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (< k N) (<= (+ 2 i) N))), 4743#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 4738#(and (or (<= (+ res2 (select (select mult (select A j)) (select B j))) res1) (< k N)) (or (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (< k N))), 4739#(and (or (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< i N))), 4742#(and (or (< k N) (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (< i N))), 4749#(and (or (<= (+ 2 k) N) (not (< i N)) (<= (+ 2 i) N) (= res2 0)) (or (<= (+ 2 k) N) (not (< i N)) (<= (+ 2 i) N) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 2 k) N) (not (< i N)) (<= (+ 2 i) N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j)))))), 4737#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 4740#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (< (+ i 1) N) (not (< i N)) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 4750#(and (or (not (< k N)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) res1) (< (+ k 1) N)) (or (not (< k N)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (< (+ k 1) N))), 4751#(and (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ 2 k) N) (= res2 0)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j)))))), 4745#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 4746#(and (or (<= (+ 3 i) N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))))), 4741#(and (or (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= (+ 2 i) N)) (or (not (< i N)) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ 2 i) N))), 4748#(and (or (<= (+ 3 i) N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (not (< (+ i 1) N)) (< k N)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (< k N)))] [2022-03-15 22:01:31,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:01:31,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:31,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:01:31,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:01:31,789 INFO L87 Difference]: Start difference. First operand 285 states and 1013 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:35,641 INFO L93 Difference]: Finished difference Result 713 states and 2122 transitions. [2022-03-15 22:01:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 22:01:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:01:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:35,645 INFO L225 Difference]: With dead ends: 713 [2022-03-15 22:01:35,645 INFO L226 Difference]: Without dead ends: 690 [2022-03-15 22:01:35,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=942, Invalid=5220, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 22:01:35,647 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 454 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:35,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 0 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:01:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-03-15 22:01:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 298. [2022-03-15 22:01:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.538720538720539) internal successors, (1051), 297 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1051 transitions. [2022-03-15 22:01:35,657 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1051 transitions. Word has length 15 [2022-03-15 22:01:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:35,657 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 1051 transitions. [2022-03-15 22:01:35,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1051 transitions. [2022-03-15 22:01:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:01:35,658 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:35,658 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:35,681 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:01:35,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:35,875 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:01:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 219123068, now seen corresponding path program 3 times [2022-03-15 22:01:35,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:35,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073438732] [2022-03-15 22:01:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:36,034 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:01:36,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:36,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073438732] [2022-03-15 22:01:36,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073438732] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:36,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765688741] [2022-03-15 22:01:36,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:01:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:36,048 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:01:36,049 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:01:36,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:01:36,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:36,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:01:36,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:36,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:36,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:36,253 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 45 treesize of output 37 [2022-03-15 22:01:36,266 INFO L353 Elim1Store]: treesize reduction 25, result has 44.4 percent of original size [2022-03-15 22:01:36,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 32 [2022-03-15 22:01:36,269 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 25 treesize of output 21 [2022-03-15 22:01:36,293 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:01:36,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:36,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:36,426 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:36,427 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 45 treesize of output 80 [2022-03-15 22:01:36,461 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:36,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 106 [2022-03-15 22:01:36,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:36,486 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:36,486 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 97 treesize of output 111 [2022-03-15 22:01:37,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:37,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:37,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:37,198 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 45 treesize of output 72 [2022-03-15 22:01:37,238 INFO L353 Elim1Store]: treesize reduction 32, result has 67.0 percent of original size [2022-03-15 22:01:37,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 74 [2022-03-15 22:01:37,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:37,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:37,258 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:37,258 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 65 treesize of output 81 [2022-03-15 22:01:37,510 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:01:37,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765688741] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:37,510 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:37,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-03-15 22:01:37,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244435466] [2022-03-15 22:01:37,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:37,511 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:37,515 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:01:37,516 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:39,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [6256#(and (or (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< i N))), 6261#(and (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N))), 6260#(and (or (not (< k N)) (< (+ k 1) N) (< i N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))) (or (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (< (+ k 1) N) (< i N))), 6267#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 2 i) N) (< (+ k 1) N))), 6254#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 6264#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 6269#(and (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j)))) (<= M 0)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= M 0)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (= res2 0)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (= j 0))), 6268#(and (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (not (< (+ i 1) N)) (< (+ 2 i) N)) (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (not (< (+ i 1) N)) (< (+ 2 i) N))), 6258#(and (or (< k N) (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (< i N))), 6259#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 6257#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (< (+ i 1) N) (not (< i N)) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 6262#(and (or (< i N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) res1) (< i N))), 6255#(and (or (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 6265#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ i 1) N) (not (< i N)))), 6263#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 6266#(and (or (not (< i N)) (<= (+ 2 i) N) (= res2 0)) (or (not (< i N)) (= j 0) (<= (+ 2 i) N)) (or (not (< i N)) (<= M 0) (<= (+ 2 i) N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (not (< i N)) (<= M 0) (<= (+ 2 i) N) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i))))))] [2022-03-15 22:01:39,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:01:39,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:01:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:01:39,259 INFO L87 Difference]: Start difference. First operand 298 states and 1051 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 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:01:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:43,575 INFO L93 Difference]: Finished difference Result 779 states and 2324 transitions. [2022-03-15 22:01:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 22:01:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 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:01:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:43,579 INFO L225 Difference]: With dead ends: 779 [2022-03-15 22:01:43,579 INFO L226 Difference]: Without dead ends: 766 [2022-03-15 22:01:43,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1052, Invalid=5590, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 22:01:43,580 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:43,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:01:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-03-15 22:01:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 313. [2022-03-15 22:01:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 3.5416666666666665) internal successors, (1105), 312 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 1105 transitions. [2022-03-15 22:01:43,589 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 1105 transitions. Word has length 15 [2022-03-15 22:01:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:43,590 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 1105 transitions. [2022-03-15 22:01:43,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 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:01:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 1105 transitions. [2022-03-15 22:01:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:01:43,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:43,591 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:43,607 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:01:43,803 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,SelfDestructingSolverStorable9 [2022-03-15 22:01:43,803 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:01:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1662096063, now seen corresponding path program 5 times [2022-03-15 22:01:43,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:43,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977602469] [2022-03-15 22:01:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:43,840 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:01:43,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:43,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977602469] [2022-03-15 22:01:43,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977602469] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:43,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029393957] [2022-03-15 22:01:43,841 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:01:43,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:43,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:43,842 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:01:43,843 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:01:43,864 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:01:43,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:43,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:01:43,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:43,931 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:01:43,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:43,965 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:01:43,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029393957] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:43,965 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:43,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 22:01:43,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926564553] [2022-03-15 22:01:43,966 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:43,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:43,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:01:43,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:44,286 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [7874#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 7871#(< i N), 7875#(or (<= N k) (< i N)), 7873#(or (<= N i) (< (+ i 1) N)), 7872#(or (<= (+ N 1) k) (< i N)), 7876#(or (<= N i) (< (+ i 1) N) (<= N k)), 7877#(or (<= N i) (<= i k))] [2022-03-15 22:01:44,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:01:44,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:44,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:01:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:01:44,287 INFO L87 Difference]: Start difference. First operand 313 states and 1105 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:44,582 INFO L93 Difference]: Finished difference Result 509 states and 1751 transitions. [2022-03-15 22:01:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:01:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 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:01:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:44,585 INFO L225 Difference]: With dead ends: 509 [2022-03-15 22:01:44,585 INFO L226 Difference]: Without dead ends: 489 [2022-03-15 22:01:44,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:01:44,586 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:44,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:01:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-03-15 22:01:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 369. [2022-03-15 22:01:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.6114130434782608) internal successors, (1329), 368 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1329 transitions. [2022-03-15 22:01:44,595 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1329 transitions. Word has length 15 [2022-03-15 22:01:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:44,595 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 1329 transitions. [2022-03-15 22:01:44,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1329 transitions. [2022-03-15 22:01:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:01:44,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:44,596 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:44,617 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:01:44,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:44,806 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:01:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1254687594, now seen corresponding path program 4 times [2022-03-15 22:01:44,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:44,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716345012] [2022-03-15 22:01:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:44,879 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:01:44,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:44,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716345012] [2022-03-15 22:01:44,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716345012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:44,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556792356] [2022-03-15 22:01:44,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:01:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:44,881 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:01:44,883 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:01:44,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:01:44,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:44,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:01:44,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:44,989 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:01:44,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:45,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556792356] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:45,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:45,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:01:45,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11600050] [2022-03-15 22:01:45,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:45,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:45,089 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:01:45,089 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:45,875 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [9274#(< k N), 9276#(or (< k N) (<= (+ j 1) M)), 9286#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9272#(or (<= N i) (< (+ i 1) N)), 9291#(or (<= (+ 2 j) M) (<= N k) (< (+ k 1) N)), 9288#(or (<= N (+ i 1)) (<= (+ 2 k j) (+ N M))), 9295#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9277#(or (< j M) (< k N) (< i N)), 9293#(or (<= N (+ 2 i)) (<= (+ 2 j) M)), 9284#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9280#(or (<= (+ 2 j) M) (<= N i)), 9285#(or (<= N (+ i 1)) (<= (+ 2 j) M)), 9292#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9279#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9281#(or (<= N i) (<= (+ 2 k j) (+ N M))), 9282#(or (<= N (+ i 1)) (< (+ 2 i) N)), 9283#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9244#(or (<= (+ 2 j) M) (< k N)), 9273#(or (<= N i) (< (+ i 1) N) (< j M)), 9294#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9287#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9289#(or (<= (+ 3 k j) (+ N M)) (<= N i)), 9290#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1))), 9296#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M))), 9270#(< i N), 9297#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i))), 9278#(or (<= N i) (< (+ i 1) N) (< k N)), 9271#(or (<= (+ j 1) M) (< i N)), 9275#(or (< k N) (< i N))] [2022-03-15 22:01:45,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:01:45,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:01:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:01:45,877 INFO L87 Difference]: Start difference. First operand 369 states and 1329 transitions. Second operand has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 37 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:51,663 INFO L93 Difference]: Finished difference Result 1626 states and 4740 transitions. [2022-03-15 22:01:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-03-15 22:01:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 37 states have internal predecessors, (94), 0 states have call successors, (0), 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:01:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:51,669 INFO L225 Difference]: With dead ends: 1626 [2022-03-15 22:01:51,669 INFO L226 Difference]: Without dead ends: 1624 [2022-03-15 22:01:51,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21699 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=10089, Invalid=50673, Unknown=0, NotChecked=0, Total=60762 [2022-03-15 22:01:51,675 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 886 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:51,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 0 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:01:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-03-15 22:01:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 537. [2022-03-15 22:01:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 3.8470149253731343) internal successors, (2062), 536 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 2062 transitions. [2022-03-15 22:01:51,694 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 2062 transitions. Word has length 16 [2022-03-15 22:01:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:51,694 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 2062 transitions. [2022-03-15 22:01:51,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 37 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 2062 transitions. [2022-03-15 22:01:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:01:51,696 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:51,696 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:51,716 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:01:51,911 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,SelfDestructingSolverStorable11 [2022-03-15 22:01:51,913 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:01:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1487766502, now seen corresponding path program 5 times [2022-03-15 22:01:51,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:51,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546356595] [2022-03-15 22:01:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:51,966 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:01:51,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:51,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546356595] [2022-03-15 22:01:51,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546356595] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:51,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843502765] [2022-03-15 22:01:51,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:01:51,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:51,972 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:01:51,974 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:01:52,001 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:01:52,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:01:52,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:52,085 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:01:52,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:52,176 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:01:52,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843502765] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:52,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:52,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:01:52,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945764795] [2022-03-15 22:01:52,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:52,178 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:52,183 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:01:52,183 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:53,125 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [12529#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 12530#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 12517#(or (< j M) (< i N)), 12507#(< i N), 12516#(< j M), 12525#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 12523#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 12520#(or (< j M) (< k N) (< i N)), 12518#(or (<= N i) (< (+ i 1) N) (< j M)), 12534#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1))), 12522#(or (<= (+ 2 k j) (+ N M)) (< i N)), 12513#(or (<= (+ 2 k) N) (< i N)), 12514#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 12519#(or (<= (+ k 1) N) (< j M)), 12527#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 12510#(or (< k N) (< i N)), 12526#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 12524#(or (<= (+ 3 k j) (+ N M)) (<= N i)), 12533#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 12528#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 12531#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 12535#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i))), 12509#(or (<= N (+ i 1)) (< (+ 2 i) N)), 12512#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 12515#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 12508#(or (<= N i) (< (+ i 1) N)), 12511#(or (<= N i) (< (+ i 1) N) (< k N)), 12521#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 12532#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N))] [2022-03-15 22:01:53,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:01:53,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:01:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1928, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 22:01:53,126 INFO L87 Difference]: Start difference. First operand 537 states and 2062 transitions. Second operand has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:59,413 INFO L93 Difference]: Finished difference Result 1673 states and 5115 transitions. [2022-03-15 22:01:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2022-03-15 22:01:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:01:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:59,420 INFO L225 Difference]: With dead ends: 1673 [2022-03-15 22:01:59,420 INFO L226 Difference]: Without dead ends: 1669 [2022-03-15 22:01:59,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24847 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10801, Invalid=52451, Unknown=0, NotChecked=0, Total=63252 [2022-03-15 22:01:59,424 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 695 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:59,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [695 Valid, 0 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:01:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-03-15 22:01:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 568. [2022-03-15 22:01:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.798941798941799) internal successors, (2154), 567 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 2154 transitions. [2022-03-15 22:01:59,443 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 2154 transitions. Word has length 16 [2022-03-15 22:01:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:59,443 INFO L470 AbstractCegarLoop]: Abstraction has 568 states and 2154 transitions. [2022-03-15 22:01:59,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 37 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 2154 transitions. [2022-03-15 22:01:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:01:59,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:59,444 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:59,465 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:01:59,660 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,SelfDestructingSolverStorable12 [2022-03-15 22:01:59,660 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:01:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash 351297055, now seen corresponding path program 6 times [2022-03-15 22:01:59,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:59,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040108284] [2022-03-15 22:01:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:59,694 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:01:59,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:59,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040108284] [2022-03-15 22:01:59,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040108284] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:59,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813262749] [2022-03-15 22:01:59,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:01:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:59,695 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:01:59,696 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:01:59,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:01:59,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:59,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:01:59,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:59,786 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:01:59,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:59,815 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:01:59,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813262749] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:59,815 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:59,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-03-15 22:01:59,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124710100] [2022-03-15 22:01:59,816 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:59,816 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:59,822 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:01:59,822 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:00,634 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [15859#(or (<= N (+ k 1)) (< (+ 2 k) N)), 15856#(< k N), 15866#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 15861#(or (< k N) (< i N)), 15871#(or (<= N (+ i 1)) (<= (+ 3 i) N) (<= N k) (< (+ k 1) N)), 15865#(or (<= N i) (< k N) (<= (+ 2 i) N)), 15867#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< k N)), 15873#(or (<= N (+ i 1)) (<= (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 15864#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 15857#(or (<= N k) (< (+ k 1) N)), 15863#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 15877#(or (<= N (+ i 1)) (<= (+ 2 i) k)), 15876#(or (<= N i) (<= i (+ k 1))), 15878#(or (<= N (+ i 1)) (<= (+ i 1) k)), 15858#(or (<= N i) (<= (+ 2 i) N)), 15870#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 15868#(or (<= N i) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 15874#(or (<= (+ i 1) k) (<= N i)), 15872#(or (<= N (+ k 1)) (<= N (+ i 1)) (<= (+ 3 i) N) (< (+ 2 k) N)), 15869#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N) (<= (+ 2 i) N)), 15862#(or (<= N k) (< (+ k 1) N) (< i N)), 15875#(or (<= N i) (<= i k)), 15879#(or (<= N (+ i 1)) (<= i k)), 15860#(or (<= N (+ 2 k)) (< (+ 3 k) N))] [2022-03-15 22:02:00,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:02:00,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:02:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:02:00,635 INFO L87 Difference]: Start difference. First operand 568 states and 2154 transitions. Second operand has 31 states, 31 states have (on average 3.225806451612903) 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:02:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:02,005 INFO L93 Difference]: Finished difference Result 1415 states and 4910 transitions. [2022-03-15 22:02:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 22:02:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.225806451612903) 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 16 [2022-03-15 22:02:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:02,011 INFO L225 Difference]: With dead ends: 1415 [2022-03-15 22:02:02,011 INFO L226 Difference]: Without dead ends: 1415 [2022-03-15 22:02:02,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1529, Invalid=4951, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 22:02:02,012 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 526 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:02,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 0 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:02:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-03-15 22:02:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 798. [2022-03-15 22:02:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 3.8607277289836888) internal successors, (3077), 797 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3077 transitions. [2022-03-15 22:02:02,030 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3077 transitions. Word has length 16 [2022-03-15 22:02:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:02,030 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 3077 transitions. [2022-03-15 22:02:02,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.225806451612903) 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:02:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3077 transitions. [2022-03-15 22:02:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:02,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:02,032 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:02,059 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:02:02,250 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,SelfDestructingSolverStorable13 [2022-03-15 22:02:02,250 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:02:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1148132194, now seen corresponding path program 6 times [2022-03-15 22:02:02,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:02,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253626271] [2022-03-15 22:02:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:02,279 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:02:02,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:02,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253626271] [2022-03-15 22:02:02,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253626271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:02,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990235766] [2022-03-15 22:02:02,280 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:02:02,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:02,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:02,281 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:02:02,282 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:02:02,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:02:02,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:02,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:02:02,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:02,375 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:02:02,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:02,445 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:02:02,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990235766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:02,445 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:02,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-03-15 22:02:02,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273754794] [2022-03-15 22:02:02,446 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:02,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:02,451 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:02:02,451 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:02,912 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [19089#(< i N), 19092#(or (<= N i) (< (+ i 1) N) (< k N)), 19090#(or (<= N i) (< (+ i 1) N)), 19087#(or (<= N k) (< (+ k 1) N) (<= M j)), 19095#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 19098#(or (<= N i) (<= (+ M i) (+ k j 1))), 19086#(or (< k N) (<= M j)), 19100#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 19091#(or (< k N) (< i N)), 19094#(or (<= N (+ i 1)) (< (+ 2 i) N)), 19088#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= M j)), 19097#(or (<= N i) (<= (+ M i) (+ k j))), 19099#(or (<= N (+ i 1)) (<= (+ M i 1) (+ k j))), 19096#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 19085#(< k N), 19093#(or (<= N i) (<= (+ M i 1) (+ N j)))] [2022-03-15 22:02:02,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:02:02,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:02:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:02:02,913 INFO L87 Difference]: Start difference. First operand 798 states and 3077 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:06,141 INFO L93 Difference]: Finished difference Result 2216 states and 7812 transitions. [2022-03-15 22:02:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 22:02:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:06,150 INFO L225 Difference]: With dead ends: 2216 [2022-03-15 22:02:06,151 INFO L226 Difference]: Without dead ends: 2205 [2022-03-15 22:02:06,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6432 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3694, Invalid=15212, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 22:02:06,152 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 482 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:06,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 0 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:02:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2022-03-15 22:02:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1034. [2022-03-15 22:02:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 4.0726040658276865) internal successors, (4207), 1033 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 4207 transitions. [2022-03-15 22:02:06,187 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 4207 transitions. Word has length 16 [2022-03-15 22:02:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:06,187 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 4207 transitions. [2022-03-15 22:02:06,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 4207 transitions. [2022-03-15 22:02:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:06,190 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:06,190 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:06,209 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:02:06,406 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,SelfDestructingSolverStorable14 [2022-03-15 22:02:06,407 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:02:06,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash -612423023, now seen corresponding path program 7 times [2022-03-15 22:02:06,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:06,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455592450] [2022-03-15 22:02:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:06,444 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:02:06,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:06,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455592450] [2022-03-15 22:02:06,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455592450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:06,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159607071] [2022-03-15 22:02:06,444 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:02:06,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:06,445 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:02:06,467 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:02:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:06,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:02:06,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:06,541 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:02:06,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:06,606 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:02:06,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159607071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:06,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:06,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 22:02:06,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [716091846] [2022-03-15 22:02:06,607 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:06,608 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:06,612 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 112 transitions. [2022-03-15 22:02:06,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:06,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [23704#(or (<= N i) (< (+ i 1) N) (<= M j)), 23703#(or (< i N) (<= M j)), 23701#(or (<= N i) (< (+ i 1) N)), 23702#(or (<= N (+ i 1)) (< (+ 2 i) N)), 23707#(or (<= N (+ i 1)) (<= (+ M i 1) (+ N j))), 23706#(or (<= N i) (<= (+ M i) (+ N j))), 23705#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 23700#(< i N)] [2022-03-15 22:02:06,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:02:06,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:02:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:02:06,967 INFO L87 Difference]: Start difference. First operand 1034 states and 4207 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:07,369 INFO L93 Difference]: Finished difference Result 2491 states and 9815 transitions. [2022-03-15 22:02:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 22:02:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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:02:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:07,380 INFO L225 Difference]: With dead ends: 2491 [2022-03-15 22:02:07,380 INFO L226 Difference]: Without dead ends: 2487 [2022-03-15 22:02:07,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=477, Invalid=1245, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:02:07,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:07,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2022-03-15 22:02:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 1174. [2022-03-15 22:02:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 4.131287297527707) internal successors, (4846), 1173 states have internal predecessors, (4846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4846 transitions. [2022-03-15 22:02:07,414 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4846 transitions. Word has length 16 [2022-03-15 22:02:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:07,414 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 4846 transitions. [2022-03-15 22:02:07,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4846 transitions. [2022-03-15 22:02:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:07,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:07,417 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:07,449 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:02:07,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:07,651 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:02:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash 832945446, now seen corresponding path program 8 times [2022-03-15 22:02:07,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:07,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388356120] [2022-03-15 22:02:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:07,701 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:02:07,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:07,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388356120] [2022-03-15 22:02:07,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388356120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:07,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817552514] [2022-03-15 22:02:07,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:07,703 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:02:07,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:07,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:07,731 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:02:07,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:02:07,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:07,798 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:02:07,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:07,866 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:02:07,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817552514] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:07,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:07,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-03-15 22:02:07,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519485941] [2022-03-15 22:02:07,867 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:07,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:07,872 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:02:07,872 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:08,364 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [28703#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 28713#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 28699#(or (< k N) (< i N)), 28710#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 28705#(or (<= N k) (<= (+ N M) (+ 2 k j))), 28712#(or (<= N (+ i 1)) (<= (+ M i 1) (+ k j))), 28706#(or (<= N i) (<= (+ M i) (+ k j))), 28701#(or (<= N k) (< (+ k 1) N) (< i N)), 28702#(or (<= N k) (< i N)), 28696#(or (<= N i) (< (+ i 1) N)), 28709#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 28700#(or (<= N i) (< (+ i 1) N) (< k N)), 28704#(or (<= N i) (< (+ i 1) N) (<= N k)), 28711#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 28697#(< k N), 28698#(or (<= N k) (< (+ k 1) N)), 28707#(or (<= N i) (<= (+ M i) (+ k j 1))), 28708#(or (<= N (+ i 1)) (< (+ 2 i) N)), 28695#(< i N)] [2022-03-15 22:02:08,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:02:08,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:08,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:02:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:02:08,365 INFO L87 Difference]: Start difference. First operand 1174 states and 4846 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 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:02:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:09,896 INFO L93 Difference]: Finished difference Result 2370 states and 8652 transitions. [2022-03-15 22:02:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:02:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 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 16 [2022-03-15 22:02:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:09,906 INFO L225 Difference]: With dead ends: 2370 [2022-03-15 22:02:09,907 INFO L226 Difference]: Without dead ends: 2318 [2022-03-15 22:02:09,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1863, Invalid=6879, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:02:09,908 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 467 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:09,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 0 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:02:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-03-15 22:02:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1342. [2022-03-15 22:02:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1341 states have (on average 4.12751677852349) internal successors, (5535), 1341 states have internal predecessors, (5535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 5535 transitions. [2022-03-15 22:02:09,943 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 5535 transitions. Word has length 16 [2022-03-15 22:02:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:09,943 INFO L470 AbstractCegarLoop]: Abstraction has 1342 states and 5535 transitions. [2022-03-15 22:02:09,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 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:02:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 5535 transitions. [2022-03-15 22:02:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:09,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:09,946 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:09,972 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:02:10,163 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,SelfDestructingSolverStorable16 [2022-03-15 22:02:10,163 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:02:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1855153526, now seen corresponding path program 9 times [2022-03-15 22:02:10,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:10,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003349771] [2022-03-15 22:02:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:10,200 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:02:10,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:10,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003349771] [2022-03-15 22:02:10,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003349771] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:10,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510047949] [2022-03-15 22:02:10,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:02:10,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:10,202 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:02:10,202 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:02:10,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:02:10,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:10,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:02:10,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:10,290 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:02:10,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:10,358 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:02:10,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510047949] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:10,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:10,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:02:10,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002526342] [2022-03-15 22:02:10,359 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:10,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:10,365 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:02:10,365 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:11,098 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [34014#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 34010#(or (<= N (+ k 1)) (< i N)), 33993#(< i N), 33994#(or (<= N i) (< (+ i 1) N)), 33998#(or (<= N k) (< (+ k 1) N) (< i N)), 34003#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 34009#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 34004#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 34013#(or (<= N i) (<= (+ M i) (+ k j 1))), 34000#(or (<= N i) (< (+ i 1) N) (< k N)), 34001#(or (<= N (+ i 1)) (< (+ 2 i) N)), 34007#(or (<= N k) (< i N)), 34011#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 33992#(< k N), 34012#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 33999#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 34006#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N)), 33995#(or (<= N k) (< (+ k 1) N)), 34002#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 34008#(or (<= N i) (< (+ i 1) N) (<= N k)), 34005#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 33997#(or (< k N) (< i N)), 33996#(or (<= N (+ k 1)) (< (+ 2 k) N))] [2022-03-15 22:02:11,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:02:11,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:11,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:02:11,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1305, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:02:11,100 INFO L87 Difference]: Start difference. First operand 1342 states and 5535 transitions. Second operand has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 30 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:02:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:13,073 INFO L93 Difference]: Finished difference Result 3257 states and 12479 transitions. [2022-03-15 22:02:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 22:02:13,073 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 30 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 16 [2022-03-15 22:02:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:13,085 INFO L225 Difference]: With dead ends: 3257 [2022-03-15 22:02:13,085 INFO L226 Difference]: Without dead ends: 3223 [2022-03-15 22:02:13,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4166 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2977, Invalid=10595, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 22:02:13,087 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:13,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:02:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2022-03-15 22:02:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 1511. [2022-03-15 22:02:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 4.203311258278146) internal successors, (6347), 1510 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 6347 transitions. [2022-03-15 22:02:13,140 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 6347 transitions. Word has length 16 [2022-03-15 22:02:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:13,140 INFO L470 AbstractCegarLoop]: Abstraction has 1511 states and 6347 transitions. [2022-03-15 22:02:13,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 30 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:02:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 6347 transitions. [2022-03-15 22:02:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:13,143 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:13,143 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:13,169 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:02:13,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:02:13,359 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:02:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1517294429, now seen corresponding path program 7 times [2022-03-15 22:02:13,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:13,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756866710] [2022-03-15 22:02:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:13,401 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:02:13,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:13,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756866710] [2022-03-15 22:02:13,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756866710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:13,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743840216] [2022-03-15 22:02:13,401 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:02:13,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:13,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:13,402 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:02:13,403 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:02:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:13,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:02:13,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:13,462 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:02:13,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:13,500 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:02:13,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743840216] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:13,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:13,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:02:13,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268078470] [2022-03-15 22:02:13,501 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:13,502 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:13,507 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:02:13,507 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:14,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [40560#(or (<= (+ 3 k) N) (< j M)), 40566#(<= N (+ i 1)), 40553#(or (<= N i) (< j M)), 40578#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)), 40575#(or (<= N (+ 2 i)) (<= (+ 2 k) N)), 40577#(or (<= N (+ 2 i)) (< j M) (< k N)), 40563#(or (<= N i) (< j M) (< k N)), 40565#(or (<= (+ 2 k) i) (< j M)), 40574#(or (<= N (+ 2 i)) (< k N)), 40568#(or (<= N (+ i 1)) (< j M)), 40573#(<= N (+ 2 i)), 40569#(or (<= N (+ i 1)) (< j M) (< k N)), 40559#(or (<= (+ 2 k) N) (< j M)), 40564#(or (<= N i) (<= (+ 2 k) N) (< j M)), 40554#(or (<= (+ 2 k) N) (<= N k)), 40562#(or (<= N i) (<= (+ 2 k) N)), 40570#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 40552#(< j M), 40555#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 40567#(or (<= N (+ i 1)) (< k N)), 40576#(or (<= N (+ 2 i)) (< j M)), 40551#(<= N i), 40572#(or (< j M) (<= (+ k 1) i)), 40557#(or (<= (+ 2 k) N) (< j M) (<= N k)), 40558#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 40571#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 40556#(or (<= (+ k 1) N) (< j M)), 40561#(or (<= (+ k 1) N) (<= N i))] [2022-03-15 22:02:14,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:02:14,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:02:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:02:14,295 INFO L87 Difference]: Start difference. First operand 1511 states and 6347 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:15,456 INFO L93 Difference]: Finished difference Result 1944 states and 7672 transitions. [2022-03-15 22:02:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 22:02:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:15,462 INFO L225 Difference]: With dead ends: 1944 [2022-03-15 22:02:15,462 INFO L226 Difference]: Without dead ends: 1932 [2022-03-15 22:02:15,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1828, Invalid=5828, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 22:02:15,464 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 208 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:15,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 0 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:02:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2022-03-15 22:02:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1534. [2022-03-15 22:02:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 4.217221135029354) internal successors, (6465), 1533 states have internal predecessors, (6465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 6465 transitions. [2022-03-15 22:02:15,494 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 6465 transitions. Word has length 16 [2022-03-15 22:02:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:15,494 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 6465 transitions. [2022-03-15 22:02:15,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 6465 transitions. [2022-03-15 22:02:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:02:15,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:15,498 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:15,514 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:02:15,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:15,714 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:02:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 726952193, now seen corresponding path program 8 times [2022-03-15 22:02:15,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:15,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796187404] [2022-03-15 22:02:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:16,006 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:02:16,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:16,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796187404] [2022-03-15 22:02:16,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796187404] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:16,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058450424] [2022-03-15 22:02:16,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:16,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:16,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:16,008 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:02:16,009 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:02:16,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:16,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:16,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:02:16,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:16,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:16,248 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 73 treesize of output 115 [2022-03-15 22:02:16,330 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:16,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 57 treesize of output 277 [2022-03-15 22:02:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:16,371 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:16,371 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 331 treesize of output 309 [2022-03-15 22:02:18,163 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:02:18,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:18,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,407 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:18,407 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 76 treesize of output 121 [2022-03-15 22:02:18,480 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:18,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 278 [2022-03-15 22:02:18,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:18,518 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:18,519 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 266 treesize of output 230 [2022-03-15 22:03:32,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:32,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:32,372 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 75 treesize of output 55 [2022-03-15 22:03:32,416 INFO L353 Elim1Store]: treesize reduction 191, result has 25.7 percent of original size [2022-03-15 22:03:32,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 77 [2022-03-15 22:03:32,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:32,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:03:32,421 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 54 treesize of output 34 [2022-03-15 22:03:32,452 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:03:32,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058450424] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:32,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:32,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:03:32,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960395653] [2022-03-15 22:03:32,452 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:32,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:32,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:03:32,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:37,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [45827#(and (or (<= (+ 3 k) N) (<= 1 M) (<= N i) (<= (+ 2 k) (+ N M))) (or (<= (+ 3 k) N) (<= 1 M) (<= N i) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (= j 0)) (or (<= (+ 3 k) N) (<= 1 M) (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)))), 45818#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)))), 45817#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (not (< k N)) (< (+ k 1) N)) (or (<= N (+ i 1)) (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N))), 45847#(and (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)))), 45815#(and (or (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 45810#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 45841#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ 2 i)) (= j 0))), 45839#(and (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 45821#(and (or (<= N i) (= j 0)) (or (<= N i) (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 45836#(and (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 45844#(and (or (<= N (+ 2 i)) (< j M) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= N (+ 2 i)) (= j 0)) (or (<= (+ 3 k) N) (<= 1 M) (<= N (+ 2 i)) (<= (+ 2 k) (+ N M))) (or (<= N (+ 2 i)) (< j M) (< (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 45830#(and (or (< j M) (< k N) (< res2 (+ res1 1))) (or (<= res1 res2) (< j M) (< k N))), 45840#(and (or (not (< (+ 2 k) N)) (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= N (+ 2 i)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 3 k) N))), 45819#(and (or (not (< (+ k 1) N)) (<= N i) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (<= N i) (< (+ 2 k) N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 45837#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 45834#(and (or (<= N (+ i 1)) (not (< (+ 2 k) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (< (+ 3 k) N)) (or (<= N (+ i 1)) (not (< (+ 2 k) N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 3 k) N))), 45825#(and (or (<= N (+ i 1)) (<= 1 M) (<= (+ k 1) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= 1 M) (<= (+ k 1) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 45835#(and (or (<= N (+ i 1)) (< 0 (+ k 1))) (or (<= N (+ i 1)) (<= (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N (+ i 1)) (<= k 0) (<= k M) (< (+ 3 k) (+ N M))) (or (<= N (+ i 1)) (= j 0)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N (+ i 1)) (= res2 0) (< (+ 3 k) (+ N M)) (not (= k 0)))), 45812#(and (or (<= N i) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 45848#(and (or (not (< (+ 2 k) N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< j M) (< (+ 3 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 45846#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))) (or (not (< k N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (< (+ k 1) N))), 45828#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= 1 M) (<= (+ 2 k) (+ N M))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= 1 M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= 1 M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ i 1)) (= j 0))), 45824#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (= j 0))), 45842#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N)) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 45838#(and (or (not (< k N)) (<= N (+ 2 i)) (< (+ k 1) N) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< k N)) (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ k 1) N))), 45811#(and (or (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 45829#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 45831#(and (or (not (< (+ 2 k) N)) (< (+ 3 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ 2 k) N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)) (< (+ 3 k) N))), 45826#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= 1 M) (<= (+ 2 k) N)) (or (<= N (+ i 1)) (= j 0)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= 1 M) (<= (+ 2 k) N))), 45814#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 45822#(and (or (<= 1 M) (<= (+ k 1) N) (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (= j 0)) (or (<= 1 M) (<= (+ k 1) N) (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 45820#(and (or (<= N (+ i 1)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (not (< (+ k 1) N)) (< (+ 2 k) N)) (or (<= N (+ i 1)) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 45823#(and (or (<= 1 M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N)) (or (<= 1 M) (<= N i) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (= j 0))), 45833#(and (or (<= N i) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ res1 (select (select mult (select A i)) (select B i)))) (< (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N i) (<= (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N i) (<= k 0) (<= k M) (< (+ 3 k) (+ N M))) (or (<= N i) (= j 0)) (or (<= N i) (< 0 (+ k 1))) (or (<= N i) (= res2 0) (< (+ 3 k) (+ N M)) (not (= k 0)))), 45843#(and (or (<= N (+ 2 i)) (= j 0)) (or (<= 1 M) (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2))) (or (<= 1 M) (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 45832#(and (or (not (< (+ 2 k) N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (<= N i) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= N i) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 3 k) N))), 45845#(and (or (<= N (+ 2 i)) (< 0 (+ k 1))) (or (<= N (+ 2 i)) (<= k 0) (<= k M) (< (+ 3 k) (+ N M))) (or (<= N (+ 2 i)) (= j 0)) (or (<= N (+ 2 i)) (<= (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N (+ 2 i)) (= res2 0) (< (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< (+ 3 k) (+ N M)) (not (= k 0))) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 3 k) (+ N M)) (not (= k 0)))), 45816#(and (or (not (< k N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (< (+ k 1) N)) (or (not (< k N)) (<= N i) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N))), 45813#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))))] [2022-03-15 22:03:37,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 22:03:37,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:37,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 22:03:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3748, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:03:37,243 INFO L87 Difference]: Start difference. First operand 1534 states and 6465 transitions. Second operand has 50 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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:04:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:59,051 INFO L93 Difference]: Finished difference Result 3019 states and 10834 transitions. [2022-03-15 22:04:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 290 states. [2022-03-15 22:04:59,052 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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:04:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:59,059 INFO L225 Difference]: With dead ends: 3019 [2022-03-15 22:04:59,059 INFO L226 Difference]: Without dead ends: 2960 [2022-03-15 22:04:59,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44321 ImplicationChecksByTransitivity, 81.5s TimeCoverageRelationStatistics Valid=16984, Invalid=102386, Unknown=0, NotChecked=0, Total=119370 [2022-03-15 22:04:59,064 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1308 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:59,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1308 Valid, 0 Invalid, 3531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 3245 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:04:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2022-03-15 22:04:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1646. [2022-03-15 22:04:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1645 states have (on average 4.196352583586626) internal successors, (6903), 1645 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have 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:04:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 6903 transitions. [2022-03-15 22:04:59,106 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 6903 transitions. Word has length 17 [2022-03-15 22:04:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:59,106 INFO L470 AbstractCegarLoop]: Abstraction has 1646 states and 6903 transitions. [2022-03-15 22:04:59,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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:04:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 6903 transitions. [2022-03-15 22:04:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:04:59,109 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:59,109 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:59,135 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:04:59,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:59,323 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:04:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1523787332, now seen corresponding path program 10 times [2022-03-15 22:04:59,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:59,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701763320] [2022-03-15 22:04:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:59,476 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:04:59,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:59,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701763320] [2022-03-15 22:04:59,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701763320] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:59,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884539772] [2022-03-15 22:04:59,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:04:59,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:59,477 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:04:59,478 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:04:59,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:04:59,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:59,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:04:59,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:13,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:05:13,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:05:13,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:13,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:05:13,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:13,257 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 68 treesize of output 54 [2022-03-15 22:05:13,297 INFO L353 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2022-03-15 22:05:13,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 72 [2022-03-15 22:05:13,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:05:13,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:13,302 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 75 treesize of output 61 [2022-03-15 22:05:13,338 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:05:13,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:50,370 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:05:50,371 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 23 treesize of output 28 [2022-03-15 22:05:50,376 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:05:50,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-03-15 22:05:50,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:05:50,382 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 15 treesize of output 20 [2022-03-15 22:05:50,405 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 23 treesize of output 19 [2022-03-15 22:05:50,410 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 22:05:50,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 22:05:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:50,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884539772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:50,436 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:50,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-03-15 22:05:50,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075443515] [2022-03-15 22:05:50,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:50,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:50,443 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 119 transitions. [2022-03-15 22:05:50,444 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:54,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [52852#(and (or (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= (+ 2 i) N)) (or (not (< i N)) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ 2 i) N))), 52850#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 52856#(and (or (<= (+ 3 i) N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (not (< (+ i 1) N)) (< k N)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (< k N))), 52862#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (= res2 0)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 52855#(and (or (<= (+ 3 i) N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (not (< (+ i 1) N))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))))), 52865#(and (or (not (< k N)) (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ k 1) N) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (not (< k N)) (<= (+ i 4) N) (not (< (+ 2 i) N)) (< (+ k 1) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))))), 52860#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))) res1)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j)))))), 52857#(and (or (<= (+ 3 i) N) (not (< k N)) (not (< (+ i 1) N)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (< (+ k 1) N)) (or (<= (+ 3 i) N) (not (< k N)) (not (< (+ i 1) N)) (< (+ k 1) N) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 52853#(and (or (not (< i N)) (< k N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ 2 i) N)) (or (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (< k N) (<= (+ 2 i) N))), 52863#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j))))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 52843#(and (or (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< i N))), 52858#(and (or (<= (+ res2 (select (select mult (select A j)) (select B j))) res1) (< k N)) (or (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (< k N))), 52864#(and (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< k N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j))))) (or (<= (+ i 4) N) (not (< (+ 2 i) N)) (< k N) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 52848#(and (or (< k N) (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (< i N))), 52846#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 52851#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 52861#(and (or (<= (+ 3 k) N) (not (< i N)) (<= i k) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (not (< i N)) (<= i k) (= res2 0)) (or (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (not (< i N)) (<= i k))), 52847#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 52859#(and (or (not (< k N)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) res1) (< (+ k 1) N)) (or (not (< k N)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (< (+ k 1) N))), 52866#(and (or (<= (+ i 4) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j)))) (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N)) (or (<= (+ i 4) N) (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 k) N)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ 2 i) k) (= res2 0))), 52849#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 52854#(and (or (<= (+ i 1) k) (<= (+ 2 k) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (or (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ i 1) k) (<= (+ 2 k) N) (not (< i N)))), 52844#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (< (+ i 1) N) (not (< i N)) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 52845#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)))] [2022-03-15 22:05:54,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:05:54,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:54,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:05:54,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1969, Unknown=32, NotChecked=0, Total=2162 [2022-03-15 22:05:54,290 INFO L87 Difference]: Start difference. First operand 1646 states and 6903 transitions. Second operand has 35 states, 34 states have (on average 2.6176470588235294) 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:06:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:17,237 INFO L93 Difference]: Finished difference Result 2603 states and 9624 transitions. [2022-03-15 22:06:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 22:06:17,238 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6176470588235294) 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 17 [2022-03-15 22:06:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:17,245 INFO L225 Difference]: With dead ends: 2603 [2022-03-15 22:06:17,245 INFO L226 Difference]: Without dead ends: 2566 [2022-03-15 22:06:17,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4906 ImplicationChecksByTransitivity, 73.9s TimeCoverageRelationStatistics Valid=1876, Invalid=15118, Unknown=36, NotChecked=0, Total=17030 [2022-03-15 22:06:17,246 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 765 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:17,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 0 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:06:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-03-15 22:06:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1718. [2022-03-15 22:06:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 4.199184624344787) internal successors, (7210), 1717 states have internal predecessors, (7210), 0 states have call successors, (0), 0 states have 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:06:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 7210 transitions. [2022-03-15 22:06:17,285 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 7210 transitions. Word has length 17 [2022-03-15 22:06:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:17,285 INFO L470 AbstractCegarLoop]: Abstraction has 1718 states and 7210 transitions. [2022-03-15 22:06:17,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6176470588235294) 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:06:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 7210 transitions. [2022-03-15 22:06:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:06:17,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:17,289 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:17,316 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:06:17,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:17,507 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:06:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash -236767885, now seen corresponding path program 11 times [2022-03-15 22:06:17,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:17,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706712119] [2022-03-15 22:06:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:17,707 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:06:17,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:17,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706712119] [2022-03-15 22:06:17,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706712119] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:17,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500985073] [2022-03-15 22:06:17,707 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:06:17,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:17,708 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:06:17,709 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:06:17,734 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:06:17,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:17,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:06:17,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:19,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:19,406 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:06:19,407 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 61 treesize of output 65 [2022-03-15 22:06:19,438 INFO L353 Elim1Store]: treesize reduction 41, result has 55.9 percent of original size [2022-03-15 22:06:19,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 64 [2022-03-15 22:06:19,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:06:19,468 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 67 [2022-03-15 22:06:19,567 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:06:19,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:22,633 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:06:22,634 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 49 treesize of output 74 [2022-03-15 22:06:22,661 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:06:22,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 112 [2022-03-15 22:06:22,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:22,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:22,682 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:06:22,682 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 103 treesize of output 107 [2022-03-15 22:06:22,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:22,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:22,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:22,991 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 50 treesize of output 38 [2022-03-15 22:06:23,009 INFO L353 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-03-15 22:06:23,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2022-03-15 22:06:23,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:23,013 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 17 treesize of output 11 [2022-03-15 22:06:23,040 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:06:23,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500985073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:23,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:23,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-03-15 22:06:23,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2025496049] [2022-03-15 22:06:23,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:23,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:23,048 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 22:06:23,048 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:26,707 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [59218#(and (or (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= M (+ j 1))) (or (not (< (+ 2 i) N)) (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 3 i) N) (<= M (+ j 1))) (or (not (< (+ 2 i) N)) (<= (+ M i 1) (+ N j)))), 59203#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 59210#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (< k N) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< k N) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (<= M j))), 59217#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< k N) (<= M (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (< k N) (<= M (+ j 1))) (or (not (< (+ i 1) N)) (<= (+ M i) (+ N j)))), 59223#(and (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ 2 k) N) (= res2 0) (< (+ M i) (+ N j))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (< (+ M i) (+ N j))) (or (not (< (+ i 1) N)) (<= (+ M i) (+ N j))) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ M i) (+ N j)))), 59212#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 59207#(and (or (< (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= M j)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= M j))), 59222#(and (or (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (< (+ M i) (+ N j 1)) (<= (+ 2 k) N) (not (< i N)) (<= (+ 2 i) N)) (or (<= (+ M i) (+ N j 1)) (not (< i N))) (or (< (+ M i) (+ N j 1)) (<= (+ 2 k) N) (not (< i N)) (<= (+ 2 i) N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))))) (or (< (+ M i) (+ N j 1)) (<= (+ 2 k) N) (not (< i N)) (<= (+ 2 i) N) (= res2 0))), 59224#(and (or (<= (+ i 4) N) (< (+ M i 1) (+ N j)) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (= res2 0)) (or (<= (+ i 4) N) (< (+ M i 1) (+ N j)) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ i 4) N) (< (+ M i 1) (+ N j)) (<= (+ 2 k) N) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))))) (or (not (< (+ 2 i) N)) (<= (+ M i 1) (+ N j)))), 59221#(and (or (not (< k N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ res1 1)) (< (+ k 1) N) (<= M (+ j 1))) (or (not (< k N)) (<= M (+ 2 j)) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= M (+ j 1)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))))), 59208#(and (or (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 1)) (< k N) (<= M j)) (or (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (< k N) (<= M j))), 59198#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 59219#(and (or (not (< (+ 2 i) N)) (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 3 i) N) (< k N) (<= M (+ j 1))) (or (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= M (+ j 1))) (or (not (< (+ 2 i) N)) (<= (+ M i 1) (+ N j)))), 59211#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (< k N) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (<= M j))), 59215#(and (or (<= (+ M i) (+ N j 1)) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< k N) (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (<= M (+ j 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (<= M (+ j 1)))), 59197#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (< (+ i 1) N) (not (< i N)) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 59200#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 59205#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (<= M j))), 59214#(and (or (<= (+ M i) (+ N j 1)) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (<= M (+ j 1))) (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (<= M (+ j 1)))), 59196#(and (or (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< i N))), 59209#(and (or (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 1)) (< k N) (< i N) (<= M j)) (or (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (< k N) (< i N) (<= M j))), 59204#(and (or (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 1)) (< i N) (<= M j)) (or (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (< i N) (<= M j))), 59202#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 59206#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= M j))), 59213#(and (or (< (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= M j)) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= M j))), 59199#(and (or (< k N) (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (< i N))), 59201#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 59220#(and (or (<= M (+ 2 j)) (< k N)) (or (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ res1 1)) (< k N) (<= M (+ j 1))) (or (< k N) (<= M (+ j 1)) (<= res1 (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))))), 59216#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (<= M (+ j 1))) (or (not (< (+ i 1) N)) (<= (+ M i) (+ N j))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (<= M (+ j 1))))] [2022-03-15 22:06:26,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:06:26,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:06:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2741, Unknown=3, NotChecked=0, Total=2970 [2022-03-15 22:06:26,709 INFO L87 Difference]: Start difference. First operand 1718 states and 7210 transitions. Second operand has 40 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:56,099 INFO L93 Difference]: Finished difference Result 5937 states and 21209 transitions. [2022-03-15 22:07:56,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-03-15 22:07:56,099 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:07:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:56,112 INFO L225 Difference]: With dead ends: 5937 [2022-03-15 22:07:56,112 INFO L226 Difference]: Without dead ends: 5887 [2022-03-15 22:07:56,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28013 ImplicationChecksByTransitivity, 92.6s TimeCoverageRelationStatistics Valid=14385, Invalid=59868, Unknown=3, NotChecked=0, Total=74256 [2022-03-15 22:07:56,117 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1694 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:56,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1694 Valid, 0 Invalid, 2970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [612 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 22:07:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5887 states. [2022-03-15 22:07:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5887 to 2060. [2022-03-15 22:07:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2059 states have (on average 4.218552695483244) internal successors, (8686), 2059 states have internal predecessors, (8686), 0 states have call successors, (0), 0 states have 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:07:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 8686 transitions. [2022-03-15 22:07:56,193 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 8686 transitions. Word has length 17 [2022-03-15 22:07:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:56,193 INFO L470 AbstractCegarLoop]: Abstraction has 2060 states and 8686 transitions. [2022-03-15 22:07:56,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 8686 transitions. [2022-03-15 22:07:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:07:56,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:56,197 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:56,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:07:56,415 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,SelfDestructingSolverStorable21 [2022-03-15 22:07:56,415 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:07:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1208600584, now seen corresponding path program 12 times [2022-03-15 22:07:56,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:56,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723455123] [2022-03-15 22:07:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:56,578 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:07:56,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:56,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723455123] [2022-03-15 22:07:56,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723455123] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:56,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537002756] [2022-03-15 22:07:56,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:07:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:56,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:56,579 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:07:56,580 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:07:56,605 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:07:56,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:56,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:07:56,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:56,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,819 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:56,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 77 [2022-03-15 22:07:56,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:56,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 181 [2022-03-15 22:07:56,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:56,883 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:56,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 211 [2022-03-15 22:07:57,915 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:07:57,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:58,252 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:07:58,252 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 72 treesize of output 157 [2022-03-15 22:07:58,336 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:58,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 268 [2022-03-15 22:07:58,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:07:58,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:07:58,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:07:58,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:07:58,402 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:58,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 256 treesize of output 274 [2022-03-15 22:08:19,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,589 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:08:19,589 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 71 treesize of output 114 [2022-03-15 22:08:19,666 INFO L353 Elim1Store]: treesize reduction 153, result has 40.2 percent of original size [2022-03-15 22:08:19,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 114 [2022-03-15 22:08:19,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:19,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:08:19,697 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 103 treesize of output 127 [2022-03-15 22:08:20,263 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:08:20,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537002756] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:20,263 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:20,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:08:20,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1898806003] [2022-03-15 22:08:20,264 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:20,265 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:20,270 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 121 transitions. [2022-03-15 22:08:20,271 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:22,838 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [69843#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 69845#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 69850#(and (or (<= (+ i 1) k) (<= (+ 2 k) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (or (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ i 1) k) (<= (+ 2 k) N) (not (< i N)))), 69841#(and (or (<= (+ 2 k) N) (<= N k) (< i N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))) (or (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) res1) (<= N k) (< i N))), 69844#(and (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N))), 69846#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 69840#(and (or (< k N) (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (< i N))), 69854#(and (or (not (< (+ i 1) N)) (<= (+ 2 k) N) (<= (+ 2 i) k) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (not (< (+ i 1) N)) (<= (+ 2 k) N) (<= (+ 2 i) k) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))))), 69852#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 2 i) N) (< (+ k 1) N))), 69853#(and (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< k N)) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ 3 i) N) (< (+ k 1) N))), 69842#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (< (+ i 1) N) (not (< i N)) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 69847#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 69839#(and (or (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< i N))), 69855#(and (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (<= (+ 3 i) k) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 2 k) N) (not (< (+ 2 i) N)) (<= (+ 3 i) k) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))))), 69856#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (= res2 0)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 69849#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))) res1))), 69857#(and (or (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j)))) (not (< (+ 2 i) N)) (<= (+ 2 i) k)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= (+ 2 i) k)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ 2 i) k) (= res2 0))), 69848#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 69851#(and (or (<= (+ 3 k) N) (not (< i N)) (<= i k) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (not (< i N)) (<= i k) (= res2 0)) (or (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (not (< i N)) (<= i k)))] [2022-03-15 22:08:22,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 22:08:22,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:22,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 22:08:22,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1763, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:08:22,839 INFO L87 Difference]: Start difference. First operand 2060 states and 8686 transitions. Second operand has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 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:08:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:35,356 INFO L93 Difference]: Finished difference Result 3181 states and 11989 transitions. [2022-03-15 22:08:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 22:08:35,357 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:08:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:35,363 INFO L225 Difference]: With dead ends: 3181 [2022-03-15 22:08:35,363 INFO L226 Difference]: Without dead ends: 3148 [2022-03-15 22:08:35,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1216, Invalid=8486, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:08:35,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 507 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:35,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 0 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:08:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2022-03-15 22:08:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2160. [2022-03-15 22:08:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2159 states have (on average 4.209356183418249) internal successors, (9088), 2159 states have internal predecessors, (9088), 0 states have call successors, (0), 0 states have 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:08:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 9088 transitions. [2022-03-15 22:08:35,408 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 9088 transitions. Word has length 17 [2022-03-15 22:08:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:35,408 INFO L470 AbstractCegarLoop]: Abstraction has 2160 states and 9088 transitions. [2022-03-15 22:08:35,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 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:08:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 9088 transitions. [2022-03-15 22:08:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:08:35,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:35,412 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:35,428 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:08:35,624 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,SelfDestructingSolverStorable22 [2022-03-15 22:08:35,624 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:08:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1479498388, now seen corresponding path program 13 times [2022-03-15 22:08:35,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:35,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535398420] [2022-03-15 22:08:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:35,785 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:08:35,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:35,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535398420] [2022-03-15 22:08:35,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535398420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:35,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814527445] [2022-03-15 22:08:35,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:08:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:35,787 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:08:35,787 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:08:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:35,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:08:35,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:40,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:40,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:40,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,242 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 69 treesize of output 57 [2022-03-15 22:08:40,282 INFO L353 Elim1Store]: treesize reduction 98, result has 35.9 percent of original size [2022-03-15 22:08:40,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 75 [2022-03-15 22:08:40,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:40,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:40,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:40,290 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 68 treesize of output 56 [2022-03-15 22:08:40,324 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:08:40,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:45,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:45,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:45,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:45,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:08:45,774 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 128 treesize of output 205 [2022-03-15 22:08:45,871 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:08:45,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 100 treesize of output 260 [2022-03-15 22:08:45,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:45,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:45,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:45,944 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:08:45,944 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 236 treesize of output 270 [2022-03-15 22:10:10,024 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:10:10,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814527445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:10:10,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:10:10,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:10:10,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586150776] [2022-03-15 22:10:10,024 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:10:10,025 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:10:10,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:10:10,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:10:13,530 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [77599#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 77602#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 77601#(and (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N))), 77595#(and (or (not (< k N)) (< (+ i 1) N) (not (< i N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ i 1) N) (not (< i N)) (< (+ k 1) N))), 77604#(and (or (not (< k N)) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (+ k 1) N) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< k N)) (not (< (+ 2 i) N)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< (+ 3 i) N) (< (+ k 1) N))), 77608#(and (or (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j)))) (not (< (+ 2 i) N)) (<= (+ 2 i) k)) (or (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (not (< (+ 2 i) N)) (<= (+ 2 i) k)) (or (<= (+ 3 k) N) (not (< (+ 2 i) N)) (<= (+ 2 i) k) (= res2 0))), 77603#(and (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 77600#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (not (< k N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ i 1) N)) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)) (< (+ 2 i) N) (< (+ k 1) N))), 77591#(and (or (< k N) (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (< i N))), 77607#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (= res2 0)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ i 1) k) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 77605#(and (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ k 1) N)) (not (< (+ 2 i) N)) (< (+ 2 k) N) (< (+ 3 i) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 77594#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ i 1) N) (not (< i N)) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 77590#(and (or (< i N) (< res2 (+ res1 1))) (or (<= res1 res2) (< i N))), 77592#(and (or (<= (+ 2 k) N) (<= N k) (< i N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))) (or (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) res1) (<= N k) (< i N))), 77598#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 77606#(and (or (<= (+ 3 k) N) (not (< i N)) (<= i k) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (not (< i N)) (<= i k) (= res2 0)) (or (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (not (< i N)) (<= i k))), 77597#(and (or (not (< (+ k 1) N)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 (select (select mult (select A i)) (select B i)) 1)) (not (< i N)) (< (+ 2 k) N))), 77596#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) res1) (< i N)) (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (< i N))), 77593#(and (or (< (+ i 1) N) (not (< i N)) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (< (+ i 1) N) (not (< i N)) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))))] [2022-03-15 22:10:13,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 22:10:13,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:10:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 22:10:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1734, Unknown=5, NotChecked=0, Total=1892 [2022-03-15 22:10:13,531 INFO L87 Difference]: Start difference. First operand 2160 states and 9088 transitions. Second operand has 30 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 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:10:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:26,366 INFO L93 Difference]: Finished difference Result 3278 states and 12370 transitions. [2022-03-15 22:10:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 22:10:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 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 17 [2022-03-15 22:10:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:26,373 INFO L225 Difference]: With dead ends: 3278 [2022-03-15 22:10:26,373 INFO L226 Difference]: Without dead ends: 3266 [2022-03-15 22:10:26,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2998 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=1433, Invalid=9692, Unknown=5, NotChecked=0, Total=11130 [2022-03-15 22:10:26,374 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 507 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:26,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 0 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:10:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-03-15 22:10:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2196. [2022-03-15 22:10:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2195 states have (on average 4.220956719817767) internal successors, (9265), 2195 states have internal predecessors, (9265), 0 states have call successors, (0), 0 states have 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:10:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 9265 transitions. [2022-03-15 22:10:26,423 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 9265 transitions. Word has length 17 [2022-03-15 22:10:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:26,423 INFO L470 AbstractCegarLoop]: Abstraction has 2196 states and 9265 transitions. [2022-03-15 22:10:26,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 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:10:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 9265 transitions. [2022-03-15 22:10:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:26,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:26,428 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:26,455 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:10:26,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:26,643 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:10:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1417622481, now seen corresponding path program 14 times [2022-03-15 22:10:26,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:26,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109999816] [2022-03-15 22:10:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:26,859 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:10:26,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:26,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109999816] [2022-03-15 22:10:26,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109999816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:26,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274760368] [2022-03-15 22:10:26,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:10:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:26,860 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:10:26,861 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:10:26,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:10:26,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:10:26,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:10:26,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:33,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:33,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:10:33,723 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 68 treesize of output 72 [2022-03-15 22:10:33,754 INFO L353 Elim1Store]: treesize reduction 41, result has 55.9 percent of original size [2022-03-15 22:10:33,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 71 [2022-03-15 22:10:33,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:33,766 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:10:33,766 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 63 treesize of output 67 [2022-03-15 22:10:33,852 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:10:33,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:48,095 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:10:48,095 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 136 treesize of output 221 [2022-03-15 22:10:48,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:10:48,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 104 treesize of output 270 [2022-03-15 22:10:48,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:48,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:48,263 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:10:48,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 246 treesize of output 286 [2022-03-15 22:12:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:45,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274760368] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:45,829 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:45,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 22:12:45,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651137094] [2022-03-15 22:12:45,830 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:45,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:45,837 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:12:45,837 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:51,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-03-15 22:12:51,295 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-03-15 22:12:51,310 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:12:51,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:51,496 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.mcr.SpWpInterpolantProvider.getPredicateWithAbstraction(SpWpInterpolantProvider.java:116) at de.uni_freiburg.informatik.ultimate.lib.mcr.SpWpInterpolantProvider.addInterpolants(SpWpInterpolantProvider.java:97) at de.uni_freiburg.informatik.ultimate.lib.mcr.McrAutomatonBuilder.buildInterpolantAutomaton(McrAutomatonBuilder.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpAbStrategyModuleMcr.buildInterpolantAutomaton(IpAbStrategyModuleMcr.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 37 more [2022-03-15 22:12:51,497 INFO L158 Benchmark]: Toolchain (without parser) took 714026.20ms. Allocated memory was 195.0MB in the beginning and 638.6MB in the end (delta: 443.5MB). Free memory was 156.0MB in the beginning and 294.8MB in the end (delta: -138.8MB). Peak memory consumption was 306.5MB. Max. memory is 8.0GB. [2022-03-15 22:12:51,498 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:12:51,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.24ms. Allocated memory is still 195.0MB. Free memory was 155.9MB in the beginning and 154.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:12:51,498 INFO L158 Benchmark]: Boogie Preprocessor took 14.14ms. Allocated memory is still 195.0MB. Free memory was 154.4MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:12:51,498 INFO L158 Benchmark]: RCFGBuilder took 166.02ms. Allocated memory is still 195.0MB. Free memory was 153.3MB in the beginning and 144.1MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:12:51,498 INFO L158 Benchmark]: TraceAbstraction took 713817.06ms. Allocated memory was 195.0MB in the beginning and 638.6MB in the end (delta: 443.5MB). Free memory was 143.5MB in the beginning and 294.8MB in the end (delta: -151.3MB). Peak memory consumption was 293.9MB. Max. memory is 8.0GB. [2022-03-15 22:12:51,498 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.10ms. Allocated memory is still 195.0MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.24ms. Allocated memory is still 195.0MB. Free memory was 155.9MB in the beginning and 154.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.14ms. Allocated memory is still 195.0MB. Free memory was 154.4MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 166.02ms. Allocated memory is still 195.0MB. Free memory was 153.3MB in the beginning and 144.1MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 713817.06ms. Allocated memory was 195.0MB in the beginning and 638.6MB in the end (delta: 443.5MB). Free memory was 143.5MB in the beginning and 294.8MB in the end (delta: -151.3MB). Peak memory consumption was 293.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 116, positive conditional: 0, positive unconditional: 116, 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: 68, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 116, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , 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 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... [2022-03-15 22:00:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:00:58,503 INFO L93 Difference]: Finished difference Result 108032 states and 535114 transitions. [2022-03-15 22:00:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2022-03-15 22:00:58,506 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 2.9651162790697674) internal successors, (255), 85 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 22:00:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:00:59,506 INFO L225 Difference]: With dead ends: 108032 [2022-03-15 22:00:59,507 INFO L226 Difference]: Without dead ends: 108028 [2022-03-15 22:00:59,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40176 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=12278, Invalid=94324, Unknown=0, NotChecked=0, Total=106602 [2022-03-15 22:00:59,510 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1056 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 5275 mSolverCounterSat, 1307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1307 IncrementalHoareTripleChecker+Valid, 5275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:00:59,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 0 Invalid, 6582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1307 Valid, 5275 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 22:00:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108028 states. [2022-03-15 22:01:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108028 to 86089. [2022-03-15 22:01:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86089 states, 86088 states have (on average 5.045871666202026) internal successors, (434389), 86088 states have internal predecessors, (434389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86089 states to 86089 states and 434389 transitions. [2022-03-15 22:01:03,290 INFO L78 Accepts]: Start accepts. Automaton has 86089 states and 434389 transitions. Word has length 22 [2022-03-15 22:01:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:03,290 INFO L470 AbstractCegarLoop]: Abstraction has 86089 states and 434389 transitions. [2022-03-15 22:01:03,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.9651162790697674) internal successors, (255), 85 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 86089 states and 434389 transitions. [2022-03-15 22:01:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:01:03,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:03,539 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:03,557 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:01:03,747 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:01:03,747 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:01:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:03,748 INFO L85 PathProgramCache]: Analyzing trace with hash 495019056, now seen corresponding path program 17 times [2022-03-15 22:01:03,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:03,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971330889] [2022-03-15 22:01:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:03,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:03,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971330889] [2022-03-15 22:01:03,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971330889] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:03,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052768343] [2022-03-15 22:01:03,939 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:01:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:03,940 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:01:03,942 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:01:03,969 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:01:03,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:03,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:01:03,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:04,218 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 22:01:04,218 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 11 [2022-03-15 22:01:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:04,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:04,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:04,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-03-15 22:01:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:04,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052768343] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:04,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:04,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2022-03-15 22:01:04,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817392686] [2022-03-15 22:01:04,554 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:04,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:04,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 343 transitions. [2022-03-15 22:01:04,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:08,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 59 new interpolants: [2438651#(or (< j1 M) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1)) (<= (+ 2 (select A i1)) i2)), 2438658#(or (< j1 M) (<= (select A i1) (+ i2 1)) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1))), 2438619#(or (<= (+ (select A i1) 1) i2) (< k2 (select A k1))), 2438654#(or (< j1 M) (< 2 (select A k1)) (<= (select A k1) 1)), 2438626#(or (< j1 M) (<= (select A i1) (+ i2 1)) (< k2 (select A k1))), 2438627#(and (or (< j1 M) (= (+ (* (- 1) i2) i1) 0)) (or (< j1 M) (<= (select A i1) (+ 2 i2)))), 2438613#(or (< 2 (select A k1)) (<= (select A k1) 1) (<= (+ 2 (select A i1)) i2)), 2438621#(or (< j1 M) (< k2 (select A k1))), 2438646#(or (<= (select A i1) (+ i2 1)) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1))), 2438620#(or (< k2 (select A k1)) (<= (select A i1) i2)), 2438661#(and (or (< j1 M) (= k1 i1)) (or (< j1 M) (= k2 i1)) (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (= i2 i1)) (or (< j1 M) (<= k1 0))), 2438629#(and (= i1 0) (<= (select A i1) (+ 2 i1))), 2438612#(or (< 2 (select A k1)) (<= (select A k1) 1)), 2438637#(or (<= (select A k1) k2) (< j1 M) (<= (+ (select A i1) 1) i2) (< (+ k2 1) (select A k1))), 2438631#(and (= i1 0) (< 0 (+ k1 1)) (<= k2 (+ 2 i1)) (<= k1 0)), 2438635#(or (<= (select A k1) k2) (< j1 M) (< (+ k2 1) (select A k1))), 2438644#(or (<= (+ (select A i1) 1) i2) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1))), 2438623#(or (< j1 M) (<= (+ (select A i1) 1) i2) (< k2 (select A k1))), 2438606#(< k2 (select A k1)), 2438652#(or (< j1 M) (<= (+ (select A i1) 1) i2) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1))), 2438656#(or (< j1 M) (<= (+ (select A i1) 1) i2) (< 2 (select A k1)) (<= (select A k1) 1)), 2438608#(or (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1))), 2438650#(or (< j1 M) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1))), 2438628#(and (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (= i2 i1)) (or (< j1 M) (= (select A k1) (select A i1))) (or (< j1 M) (<= k1 0)) (or (< j1 M) (<= k2 (+ 2 i1)))), 2438630#(and (or (<= (select A i1) (+ 2 i1)) (< j1 M)) (or (= i1 0) (< j1 M))), 2438622#(or (< j1 M) (< k2 (select A k1)) (<= (+ 2 (select A i1)) i2)), 2438663#(and (or (< j1 M) (= k1 i1)) (or (< j1 M) (= k2 i1)) (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (<= k1 0))), 2438640#(or (<= (select A k1) k2) (<= (select A i1) (+ i2 1)) (< (+ k2 1) (select A k1))), 2438633#(and (= i1 0) (< 0 (+ k1 1)) (<= k2 (+ i1 1)) (<= k1 0)), 2438660#(and (< 0 (+ k1 1)) (= k1 i1) (<= k1 0) (= i2 i1)), 2438647#(or (<= (+ (select A i1) 1) i2) (< 2 (select A k1)) (<= (select A k1) 1)), 2438659#(or (< j1 M) (<= (select A i1) (+ i2 1)) (< 2 (select A k1)) (<= (select A k1) 1)), 2438610#(or (<= (select A k1) k2) (< (+ k2 1) (select A k1)) (<= (+ 2 (select A i1)) i2)), 2438649#(or (<= (select A i1) (+ i2 1)) (< 2 (select A k1)) (<= (select A k1) 1)), 2438643#(and (or (< j1 M) (<= k2 (+ i1 1))) (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (<= k1 0)) (or (= i1 0) (< j1 M))), 2438657#(or (< j1 M) (< 2 (select A k1)) (<= (select A k1) 1) (<= (select A i1) i2)), 2438607#(or (<= (select A k1) k2) (< (+ k2 1) (select A k1))), 2438611#(or (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1)) (<= (+ 2 (select A i1)) i2)), 2438638#(or (<= (select A k1) k2) (< (+ k2 1) (select A k1)) (<= (select A i1) i2)), 2438632#(and (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (<= k1 0)) (or (< j1 M) (<= k2 (+ 2 i1))) (or (= i1 0) (< j1 M))), 2438636#(or (<= (select A k1) k2) (< j1 M) (< (+ k2 1) (select A k1)) (<= (+ 2 (select A i1)) i2)), 2438614#(< j1 M), 2438624#(or (< j1 M) (< k2 (select A k1)) (<= (select A i1) i2)), 2438609#(or (< k2 (select A k1)) (<= (+ 2 (select A i1)) i2)), 2438634#(or (<= (select A k1) k2) (<= (+ (select A i1) 1) i2) (< (+ k2 1) (select A k1))), 2438615#(or (< j1 M) (<= (+ 2 (select A i1)) i2)), 2438662#(and (or (< j1 M) (= k1 i1)) (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (= i2 i1)) (or (< j1 M) (<= k1 0))), 2438655#(or (< j1 M) (< 2 (select A k1)) (<= (select A k1) 1) (<= (+ 2 (select A i1)) i2)), 2438653#(or (< j1 M) (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1)) (<= (select A i1) i2)), 2438617#(or (< j1 M) (<= (select A i1) i2)), 2438639#(or (<= (select A k1) k2) (< j1 M) (< (+ k2 1) (select A k1)) (<= (select A i1) i2)), 2438645#(or (< (+ 2 k2) (select A k1)) (<= (select A k1) (+ k2 1)) (<= (select A i1) i2)), 2438664#(and (or (< j1 M) (= k1 i1)) (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (<= k1 0))), 2438625#(or (<= (select A i1) (+ i2 1)) (< k2 (select A k1))), 2438618#(or (< j1 M) (<= (select A i1) (+ i2 1))), 2438616#(or (< j1 M) (<= (+ (select A i1) 1) i2)), 2438648#(or (< 2 (select A k1)) (<= (select A k1) 1) (<= (select A i1) i2)), 2438641#(or (<= (select A k1) k2) (< j1 M) (<= (select A i1) (+ i2 1)) (< (+ k2 1) (select A k1))), 2438642#(and (or (< j1 M) (<= k2 (+ i1 1))) (or (< j1 M) (< 0 (+ k1 1))) (or (< j1 M) (= i2 i1)) (or (< j1 M) (= (select A k1) (select A i1))) (or (< j1 M) (<= k1 0)))] [2022-03-15 22:01:08,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 22:01:08,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 22:01:08,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=8397, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 22:01:08,339 INFO L87 Difference]: Start difference. First operand 86089 states and 434389 transitions. Second operand has 72 states, 72 states have (on average 3.1527777777777777) internal successors, (227), 71 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:14,869 INFO L93 Difference]: Finished difference Result 102389 states and 509623 transitions. [2022-03-15 22:01:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 22:01:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.1527777777777777) internal successors, (227), 71 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 22:01:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:15,884 INFO L225 Difference]: With dead ends: 102389 [2022-03-15 22:01:15,884 INFO L226 Difference]: Without dead ends: 102371 [2022-03-15 22:01:15,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7567 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2537, Invalid=24853, Unknown=0, NotChecked=0, Total=27390 [2022-03-15 22:01:15,886 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 545 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 4755 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 4755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:15,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 0 Invalid, 5080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 4755 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:01:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102371 states. [2022-03-15 22:01:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102371 to 86152. [2022-03-15 22:01:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86152 states, 86151 states have (on average 5.045246137595617) internal successors, (434653), 86151 states have internal predecessors, (434653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86152 states to 86152 states and 434653 transitions. [2022-03-15 22:01:19,677 INFO L78 Accepts]: Start accepts. Automaton has 86152 states and 434653 transitions. Word has length 22 [2022-03-15 22:01:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:19,677 INFO L470 AbstractCegarLoop]: Abstraction has 86152 states and 434653 transitions. [2022-03-15 22:01:19,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.1527777777777777) internal successors, (227), 71 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 86152 states and 434653 transitions. [2022-03-15 22:01:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:01:20,246 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:20,246 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:20,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 22:01:20,461 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:01:20,462 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:01:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -945110001, now seen corresponding path program 4 times [2022-03-15 22:01:20,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:20,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342516624] [2022-03-15 22:01:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:20,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:20,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342516624] [2022-03-15 22:01:20,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342516624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:20,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156755241] [2022-03-15 22:01:20,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:01:20,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:20,499 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:01:20,500 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:01:20,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:01:20,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:20,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:01:20,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:20,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:20,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156755241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:20,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:20,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-03-15 22:01:20,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072187618] [2022-03-15 22:01:20,615 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:20,616 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:20,636 INFO L252 McrAutomatonBuilder]: Finished intersection with 213 states and 507 transitions. [2022-03-15 22:01:20,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:24,686 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 65 new interpolants: [2713650#(or (<= N (+ i1 1)) (< k1 N)), 2713648#(< k1 N), 2713645#(or (< (+ j1 1) M) (<= M j1)), 2713674#(or (<= N k1) (< j1 M) (<= N i1) (< (+ k1 1) N)), 2713639#(< j1 M), 2713643#(or (< j1 M) (<= N (+ i1 1))), 2713690#(or (< (+ j1 1) M) (< k1 N) (<= N (+ 2 i1))), 2713697#(or (< (+ j1 1) M) (< (+ k1 1) N) (<= M j1) (<= N (+ 2 i1))), 2713694#(or (<= N k1) (< (+ j1 1) M) (< (+ k1 1) N) (<= N (+ 2 i1))), 2713692#(or (<= N k1) (< (+ k1 1) N) (<= N (+ 2 i1))), 2713657#(or (< (+ j1 1) M) (< k1 N)), 2713647#(or (< (+ j1 1) M) (<= N (+ i1 1)) (<= M j1)), 2713665#(or (<= N k1) (< (+ j1 1) M) (< (+ k1 1) N) (<= M j1)), 2713660#(or (< (+ j1 1) M) (< (+ k1 1) N)), 2713668#(or (< j1 M) (<= N i1) (< (+ k1 1) N)), 2713701#(or (<= N k1) (<= k1 (+ i1 1))), 2713698#(or (<= N k1) (< (+ j1 1) M) (< (+ k1 1) N) (<= M j1) (<= N (+ 2 i1))), 2713680#(or (< (+ j1 1) M) (<= N (+ i1 1)) (< k1 N)), 2713640#(or (< j1 M) (<= N i1)), 2713651#(or (< k1 N) (<= N (+ 2 i1))), 2713682#(or (<= N k1) (< (+ j1 1) M) (<= N (+ i1 1)) (< (+ k1 1) N)), 2713655#(or (< (+ k1 1) N) (<= N (+ 2 i1))), 2713670#(or (< j1 M) (<= N (+ 2 i1))), 2713662#(or (<= N k1) (< (+ k1 1) N)), 2713663#(or (<= N k1) (< j1 M) (< (+ k1 1) N)), 2713659#(or (< j1 M) (< (+ k1 1) N)), 2713700#(<= (+ j1 k1) (+ i1 M 1)), 2713679#(or (<= N k1) (< j1 M) (<= N (+ i1 1)) (< (+ k1 1) N)), 2713676#(or (< (+ j1 1) M) (<= N i1) (< (+ k1 1) N)), 2713652#(< (+ k1 1) N), 2713653#(or (<= N i1) (< (+ k1 1) N)), 2713667#(or (< j1 M) (<= N (+ i1 1)) (< k1 N)), 2713695#(or (< (+ j1 1) M) (<= M j1) (<= N (+ 2 i1))), 2713685#(or (<= N k1) (< (+ j1 1) M) (<= N i1) (< (+ k1 1) N) (<= M j1)), 2713649#(or (<= N i1) (< k1 N)), 2713677#(or (<= N k1) (< (+ j1 1) M) (<= N i1) (< (+ k1 1) N)), 2713646#(or (< (+ j1 1) M) (<= N i1) (<= M j1)), 2713672#(or (< j1 M) (< (+ k1 1) N) (<= N (+ 2 i1))), 2713641#(< (+ j1 1) M), 2713669#(or (< j1 M) (<= N (+ i1 1)) (< (+ k1 1) N)), 2713671#(or (< j1 M) (< k1 N) (<= N (+ 2 i1))), 2713678#(or (<= N k1) (<= N (+ i1 1)) (< (+ k1 1) N)), 2713689#(or (< (+ j1 1) M) (<= N (+ 2 i1))), 2713703#(and (or (<= N k1) (<= k1 M)) (or (<= N k1) (= (+ j1 (* (- 1) i1)) 0))), 2713644#(or (< (+ j1 1) M) (<= N (+ i1 1))), 2713675#(or (< (+ j1 1) M) (<= N i1) (< k1 N)), 2713686#(or (< (+ j1 1) M) (<= N (+ i1 1)) (<= M j1) (< k1 N)), 2713642#(or (< (+ j1 1) M) (<= N i1)), 2713684#(or (< (+ j1 1) M) (<= N i1) (< (+ k1 1) N) (<= M j1)), 2713693#(or (<= N k1) (< j1 M) (< (+ k1 1) N) (<= N (+ 2 i1))), 2713654#(or (<= N (+ i1 1)) (< (+ k1 1) N)), 2713688#(or (<= N k1) (< (+ j1 1) M) (<= N (+ i1 1)) (< (+ k1 1) N) (<= M j1)), 2713683#(or (< (+ j1 1) M) (<= N i1) (<= M j1) (< k1 N)), 2713691#(or (< (+ j1 1) M) (< (+ k1 1) N) (<= N (+ 2 i1))), 2713656#(or (< j1 M) (< k1 N)), 2713696#(or (< (+ j1 1) M) (<= M j1) (< k1 N) (<= N (+ 2 i1))), 2713673#(or (<= N k1) (<= N i1) (< (+ k1 1) N)), 2713666#(or (< j1 M) (<= N i1) (< k1 N)), 2713687#(or (< (+ j1 1) M) (<= N (+ i1 1)) (< (+ k1 1) N) (<= M j1)), 2713702#(or (<= N k1) (<= (+ j1 k1) (+ i1 M 1))), 2713699#(<= k1 (+ i1 1)), 2713658#(or (< (+ j1 1) M) (<= M j1) (< k1 N)), 2713661#(or (< (+ j1 1) M) (< (+ k1 1) N) (<= M j1)), 2713681#(or (< (+ j1 1) M) (<= N (+ i1 1)) (< (+ k1 1) N)), 2713664#(or (<= N k1) (< (+ j1 1) M) (< (+ k1 1) N))] [2022-03-15 22:01:24,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-15 22:01:24,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-15 22:01:24,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=5328, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 22:01:24,688 INFO L87 Difference]: Start difference. First operand 86152 states and 434653 transitions. Second operand has 74 states, 74 states have (on average 3.9594594594594597) internal successors, (293), 73 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:36,196 INFO L93 Difference]: Finished difference Result 150678 states and 730102 transitions. [2022-03-15 22:01:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2022-03-15 22:01:36,196 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 3.9594594594594597) internal successors, (293), 73 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 22:01:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:37,615 INFO L225 Difference]: With dead ends: 150678 [2022-03-15 22:01:37,616 INFO L226 Difference]: Without dead ends: 150604 [2022-03-15 22:01:37,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61547 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=26802, Invalid=134400, Unknown=0, NotChecked=0, Total=161202 [2022-03-15 22:01:37,625 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1900 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 3783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:37,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1900 Valid, 0 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 3783 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:01:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150604 states. [2022-03-15 22:01:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150604 to 130706. [2022-03-15 22:01:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130706 states, 130705 states have (on average 5.08012700355763) internal successors, (663998), 130705 states have internal predecessors, (663998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130706 states to 130706 states and 663998 transitions. [2022-03-15 22:01:44,382 INFO L78 Accepts]: Start accepts. Automaton has 130706 states and 663998 transitions. Word has length 22 [2022-03-15 22:01:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:44,382 INFO L470 AbstractCegarLoop]: Abstraction has 130706 states and 663998 transitions. [2022-03-15 22:01:44,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 3.9594594594594597) internal successors, (293), 73 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 130706 states and 663998 transitions. [2022-03-15 22:01:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:01:44,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:44,925 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:44,942 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:01:45,127 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:01:45,127 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:01:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2079010883, now seen corresponding path program 5 times [2022-03-15 22:01:45,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:45,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138558866] [2022-03-15 22:01:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:45,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:45,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138558866] [2022-03-15 22:01:45,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138558866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:45,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068980461] [2022-03-15 22:01:45,192 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:01:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:45,211 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:01:45,212 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:01:45,236 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:01:45,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:45,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:01:45,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:45,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:45,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068980461] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:45,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:45,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-03-15 22:01:45,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227538411] [2022-03-15 22:01:45,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:45,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:45,665 INFO L252 McrAutomatonBuilder]: Finished intersection with 252 states and 618 transitions. [2022-03-15 22:01:45,665 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:48,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [3126582#(or (< j1 M) (<= (+ 2 i1) N)), 3126553#(or (not (< j1 M)) (<= (+ 3 i1) N)), 3126557#(or (<= M (+ j1 1)) (<= (+ 3 i1) N)), 3126590#(or (<= M (+ j1 1)) (< i1 N) (< (+ 2 j1) M)), 3126584#(or (< (+ j1 1) M) (< (+ i1 1) N)), 3126578#(< (+ j1 1) M), 3126591#(or (<= M (+ j1 1)) (< (+ i1 1) N) (< (+ 2 j1) M)), 3126589#(or (< (+ j1 1) M) (<= M j1) (<= (+ 3 i1) N)), 3126588#(or (< (+ j1 1) M) (< (+ i1 1) N) (<= M j1)), 3126586#(or (< (+ j1 1) M) (<= (+ 3 i1) N)), 3126581#(or (< j1 M) (< i1 N)), 3126577#(< j1 M), 3126585#(or (< j1 M) (<= (+ 3 i1) N)), 3126587#(or (< (+ j1 1) M) (< i1 N) (<= M j1)), 3126583#(or (< (+ j1 1) M) (< i1 N)), 3126592#(or (<= M (+ j1 1)) (<= (+ 3 i1) N) (< (+ 2 j1) M)), 3126579#(or (< (+ j1 1) M) (<= M j1)), 3126580#(or (<= M (+ j1 1)) (< (+ 2 j1) M))] [2022-03-15 22:01:48,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:01:48,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:01:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:01:48,681 INFO L87 Difference]: Start difference. First operand 130706 states and 663998 transitions. Second operand has 25 states, 25 states have (on average 6.52) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:01:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:52,838 INFO L93 Difference]: Finished difference Result 246252 states and 1227278 transitions. [2022-03-15 22:01:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 22:01:52,838 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.52) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 22:01:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:55,244 INFO L225 Difference]: With dead ends: 246252 [2022-03-15 22:01:55,245 INFO L226 Difference]: Without dead ends: 246252 [2022-03-15 22:01:55,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 239 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1009, Invalid=3413, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:01:55,245 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 330 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:55,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 0 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]