/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/vector-add.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:21:41,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:21:41,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:21:41,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:21:41,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:21:41,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:21:41,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:21:41,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:21:41,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:21:41,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:21:41,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:21:41,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:21:41,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:21:41,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:21:41,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:21:41,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:21:41,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:21:41,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:21:41,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:21:41,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:21:41,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:21:41,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:21:41,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:21:41,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:21:41,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:21:41,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:21:41,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:21:41,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:21:41,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:21:41,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:21:41,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:21:41,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:21:41,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:21:41,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:21:41,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:21:41,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:21:41,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:21:41,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:21:41,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:21:41,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:21:41,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:21:41,865 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:21:41,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:21:41,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:21:41,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:21:41,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:21:41,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:21:41,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:21:41,892 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:21:41,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:21:41,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:21:41,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:21:41,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:21:41,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:21:41,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:21:41,894 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:21:41,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:21:41,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:21:41,895 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:21:42,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:21:42,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:21:42,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:21:42,115 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:21:42,116 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:21:42,117 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/vector-add.wvr.bpl [2022-03-15 22:21:42,117 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/vector-add.wvr.bpl' [2022-03-15 22:21:42,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:21:42,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:21:42,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:21:42,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:21:42,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:21:42,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,159 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:21:42,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:21:42,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:21:42,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:21:42,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:21:42,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:21:42,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:21:42,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:21:42,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:21:42,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/1) ... [2022-03-15 22:21:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:21:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:42,209 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:21:42,239 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:21:42,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:21:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:21:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:21:42,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:21:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:21:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:21:42,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:21:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:21:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:21:42,264 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:21:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:21:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:21:42,264 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:21:42,301 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:21:42,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:21:42,373 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:21:42,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:21:42,397 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:21:42,399 INFO L202 PluginConnector]: Adding new model vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:21:42 BoogieIcfgContainer [2022-03-15 22:21:42,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:21:42,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:21:42,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:21:42,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:21:42,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:21:42" (1/2) ... [2022-03-15 22:21:42,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c62dae9 and model type vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:21:42, skipping insertion in model container [2022-03-15 22:21:42,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:21:42" (2/2) ... [2022-03-15 22:21:42,405 INFO L111 eAbstractionObserver]: Analyzing ICFG vector-add.wvr.bpl [2022-03-15 22:21:42,408 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:21:42,409 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:21:42,409 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:21:42,409 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:21:42,432 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:21:42,467 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:21:42,472 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:21:42,472 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:21:42,483 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:21:42,490 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 84 flow [2022-03-15 22:21:42,492 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 84 flow [2022-03-15 22:21:42,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 84 flow [2022-03-15 22:21:42,529 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2022-03-15 22:21:42,529 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:21:42,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 3/27 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/23 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2022-03-15 22:21:42,532 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:21:42,792 INFO L131 LiptonReduction]: Checked pairs total: 124 [2022-03-15 22:21:42,793 INFO L133 LiptonReduction]: Total number of compositions: 13 [2022-03-15 22:21:42,798 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:21:42,809 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:21:42,810 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:21:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:21:42,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:42,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:42,814 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:21:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1025787960, now seen corresponding path program 1 times [2022-03-15 22:21:42,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:42,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698067114] [2022-03-15 22:21:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:42,964 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:21:42,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:42,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698067114] [2022-03-15 22:21:42,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698067114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:21:42,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:21:42,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:21:42,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [767482541] [2022-03-15 22:21:42,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:42,979 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:42,997 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:21:42,998 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:43,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:21:43,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:21:43,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:21:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:21:43,213 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:21:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:43,247 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:21:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:21:43,249 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:21:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:43,256 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:21:43,256 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:21:43,258 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:21:43,260 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:21:43,261 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:21:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:21:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:21:43,287 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:21:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:21:43,289 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:21:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:43,290 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:21:43,290 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:21:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:21:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:21:43,291 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:43,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:43,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:21:43,291 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:21:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 977383000, now seen corresponding path program 1 times [2022-03-15 22:21:43,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:43,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112830080] [2022-03-15 22:21:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:43,316 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:21:43,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:43,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112830080] [2022-03-15 22:21:43,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112830080] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:21:43,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:21:43,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:21:43,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1816339923] [2022-03-15 22:21:43,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:43,318 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:43,322 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 56 transitions. [2022-03-15 22:21:43,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:43,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:21:43,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:21:43,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:43,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:21:43,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:21:43,538 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:21:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:43,569 INFO L93 Difference]: Finished difference Result 37 states and 98 transitions. [2022-03-15 22:21:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:21:43,569 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:21:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:43,571 INFO L225 Difference]: With dead ends: 37 [2022-03-15 22:21:43,571 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 22:21:43,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 6 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:21:43,573 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:21:43,574 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:21:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 22:21:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-15 22:21:43,583 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:21:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:21:43,585 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:21:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:43,585 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:21:43,586 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:21:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:21:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:21:43,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:43,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:43,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:21:43,594 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:21:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -680089584, now seen corresponding path program 1 times [2022-03-15 22:21:43,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:43,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299414069] [2022-03-15 22:21:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:43,641 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:21:43,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:43,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299414069] [2022-03-15 22:21:43,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299414069] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:21:43,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:21:43,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:21:43,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1042686752] [2022-03-15 22:21:43,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:43,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:43,647 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:21:43,647 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:43,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:21:43,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:21:43,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:21:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:21:43,803 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:21:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:43,830 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:21:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:21:43,830 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:21:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:43,833 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:21:43,833 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:21:43,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 7 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:21:43,835 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:21:43,836 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:21:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:21:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:21:43,845 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:21:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:21:43,846 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:21:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:43,846 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:21:43,847 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:21:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:21:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:21:43,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:43,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:43,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:21:43,848 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:21:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 417201958, now seen corresponding path program 1 times [2022-03-15 22:21:43,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:43,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407009430] [2022-03-15 22:21:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:44,028 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:21:44,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:44,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407009430] [2022-03-15 22:21:44,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407009430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:44,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520196398] [2022-03-15 22:21:44,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:44,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:44,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:44,049 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:21:44,050 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:21:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:44,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:21:44,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:44,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:44,240 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 25 treesize of output 21 [2022-03-15 22:21:44,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:44,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-03-15 22:21:44,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:44,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-03-15 22:21:44,303 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:21:44,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:44,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:44,338 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 25 treesize of output 30 [2022-03-15 22:21:44,344 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:44,345 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 21 treesize of output 26 [2022-03-15 22:21:44,914 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:21:44,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520196398] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:44,914 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:44,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 22:21:44,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86590776] [2022-03-15 22:21:44,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:44,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:44,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:21:44,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:48,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [529#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N))), 533#(or (not (< k N)) (< (+ i 1) N) (not (< i N)) (= (store C1 i (+ (select A i) (select B i))) (store C2 k (+ (select A k) (select B k)))) (< (+ k 1) N)), 530#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N)) (< k N)), 526#(or (= C1 C2) (< k N)), 534#(or (not (< i N)) (= (store C1 i (+ (select A i) (select B i))) (store C2 k (+ (select A k) (select B k)))) (<= (+ 2 i) N)), 528#(or (= C1 C2) (< k N) (< i N)), 527#(or (= C1 C2) (< i N)), 532#(or (not (< k N)) (< (+ k 1) N) (= C1 (store C2 k (+ (select A k) (select B k)))) (< i N)), 531#(or (not (< k N)) (< (+ k 1) N) (= C1 (store C2 k (+ (select A k) (select B k)))))] [2022-03-15 22:21:48,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:21:48,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:21:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=290, Unknown=2, NotChecked=0, Total=380 [2022-03-15 22:21:48,382 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:49,080 INFO L93 Difference]: Finished difference Result 189 states and 500 transitions. [2022-03-15 22:21:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:21:49,080 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:21:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:49,081 INFO L225 Difference]: With dead ends: 189 [2022-03-15 22:21:49,081 INFO L226 Difference]: Without dead ends: 181 [2022-03-15 22:21:49,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=325, Invalid=1155, Unknown=2, NotChecked=0, Total=1482 [2022-03-15 22:21:49,083 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:49,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-03-15 22:21:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 74. [2022-03-15 22:21:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 3.0) internal successors, (219), 73 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 219 transitions. [2022-03-15 22:21:49,089 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 219 transitions. Word has length 13 [2022-03-15 22:21:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:49,089 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 219 transitions. [2022-03-15 22:21:49,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 219 transitions. [2022-03-15 22:21:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:21:49,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:49,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:49,110 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:21:49,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:49,302 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:21:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1588431798, now seen corresponding path program 1 times [2022-03-15 22:21:49,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:49,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037500819] [2022-03-15 22:21:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:49,338 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:21:49,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:49,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037500819] [2022-03-15 22:21:49,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037500819] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:49,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28932225] [2022-03-15 22:21:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:49,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:49,341 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:21:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:49,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:21:49,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:49,394 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:21:49,429 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:21:49,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:49,464 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:21:49,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28932225] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:49,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:49,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:21:49,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1071085574] [2022-03-15 22:21:49,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:49,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:49,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:21:49,469 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:49,698 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [999#(or (<= N i) (< (+ i 1) N) (<= M j)), 989#(or (< i N) (<= M j)), 997#(< i N), 998#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:21:49,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:21:49,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:21:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:21:49,700 INFO L87 Difference]: Start difference. First operand 74 states and 219 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:49,867 INFO L93 Difference]: Finished difference Result 126 states and 354 transitions. [2022-03-15 22:21:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 22:21:49,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:21:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:49,870 INFO L225 Difference]: With dead ends: 126 [2022-03-15 22:21:49,870 INFO L226 Difference]: Without dead ends: 124 [2022-03-15 22:21:49,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:21:49,871 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:49,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:21:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-15 22:21:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2022-03-15 22:21:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.0344827586206895) internal successors, (264), 87 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 264 transitions. [2022-03-15 22:21:49,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 264 transitions. Word has length 14 [2022-03-15 22:21:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:49,888 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 264 transitions. [2022-03-15 22:21:49,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 264 transitions. [2022-03-15 22:21:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:21:49,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:49,889 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:49,908 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:21:50,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:50,108 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:21:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash 73501392, now seen corresponding path program 2 times [2022-03-15 22:21:50,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:50,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035729749] [2022-03-15 22:21:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:50,150 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:21:50,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:50,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035729749] [2022-03-15 22:21:50,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035729749] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:50,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403905489] [2022-03-15 22:21:50,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:50,152 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:21:50,153 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:21:50,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:50,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:50,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:21:50,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:50,240 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:21:50,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:50,262 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:21:50,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403905489] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:50,262 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:50,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 22:21:50,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385680432] [2022-03-15 22:21:50,263 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:50,264 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:50,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:21:50,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:50,707 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1419#(or (<= N i) (< (+ i 1) N) (<= N k)), 1416#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 1414#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1411#(or (<= N i) (< (+ i 1) N)), 1408#(< i N), 1410#(or (<= N k) (< (+ k 1) N) (< i N)), 1417#(or (<= N k) (< i N)), 1418#(or (<= N (+ k 1)) (< i N)), 1407#(or (<= N k) (< (+ k 1) N)), 1415#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 1406#(< k N), 1413#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 1409#(or (< k N) (< i N)), 1412#(or (<= N i) (< (+ i 1) N) (< k N)), 1420#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N))] [2022-03-15 22:21:50,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:21:50,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:21:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:21:50,708 INFO L87 Difference]: Start difference. First operand 88 states and 264 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:51,075 INFO L93 Difference]: Finished difference Result 243 states and 741 transitions. [2022-03-15 22:21:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:21:51,076 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:21:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:51,077 INFO L225 Difference]: With dead ends: 243 [2022-03-15 22:21:51,077 INFO L226 Difference]: Without dead ends: 225 [2022-03-15 22:21:51,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1307, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:21:51,078 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:51,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:21:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-03-15 22:21:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 122. [2022-03-15 22:21:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 3.3636363636363638) internal successors, (407), 121 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 407 transitions. [2022-03-15 22:21:51,083 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 407 transitions. Word has length 14 [2022-03-15 22:21:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:51,083 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 407 transitions. [2022-03-15 22:21:51,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 407 transitions. [2022-03-15 22:21:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:21:51,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:51,085 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:51,121 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:21:51,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:51,300 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:21:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1746389246, now seen corresponding path program 3 times [2022-03-15 22:21:51,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:51,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639480797] [2022-03-15 22:21:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:51,344 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:21:51,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:51,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639480797] [2022-03-15 22:21:51,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639480797] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:51,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824608271] [2022-03-15 22:21:51,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:21:51,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:51,349 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:21:51,350 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:21:51,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:21:51,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:51,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:21:51,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:51,456 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:21:51,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:51,534 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:21:51,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824608271] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:51,534 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:51,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 22:21:51,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206891648] [2022-03-15 22:21:51,535 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:51,536 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:51,539 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:21:51,539 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:52,212 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [2046#(or (<= (+ j 1) M) (< i N)), 2036#(or (<= N k) (< (+ k 1) N)), 2044#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 2048#(or (<= (+ 2 k j) (+ N M)) (< i N)), 2050#(or (<= (+ k j 1) (+ N M)) (<= N i) (< (+ i 1) N)), 2047#(or (<= (+ k j 1) (+ N M)) (< i N)), 2039#(or (<= N k) (< (+ k 1) N) (< i N)), 2041#(or (<= N i) (< (+ i 1) N) (< k N)), 2035#(< k N), 2049#(or (<= N i) (< (+ i 1) N) (< j M)), 2052#(or (<= N (+ i 1)) (<= (+ k j 1) (+ N M)) (< (+ 2 i) N)), 2043#(or (<= N (+ i 1)) (< (+ 2 i) N)), 2051#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 2040#(or (<= N i) (< (+ i 1) N)), 2037#(< i N), 2042#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 2054#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 2038#(or (< k N) (< i N)), 2053#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 2045#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N))] [2022-03-15 22:21:52,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:21:52,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:21:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:21:52,213 INFO L87 Difference]: Start difference. First operand 122 states and 407 transitions. Second operand has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:54,772 INFO L93 Difference]: Finished difference Result 444 states and 1314 transitions. [2022-03-15 22:21:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 22:21:54,772 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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:21:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:54,775 INFO L225 Difference]: With dead ends: 444 [2022-03-15 22:21:54,775 INFO L226 Difference]: Without dead ends: 444 [2022-03-15 22:21:54,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4715 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2975, Invalid=12525, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 22:21:54,778 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 368 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:54,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 0 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:21:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-03-15 22:21:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 251. [2022-03-15 22:21:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.572) internal successors, (893), 250 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 893 transitions. [2022-03-15 22:21:54,788 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 893 transitions. Word has length 14 [2022-03-15 22:21:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:54,788 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 893 transitions. [2022-03-15 22:21:54,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 893 transitions. [2022-03-15 22:21:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:21:54,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:54,793 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:54,810 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:21:55,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:55,007 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:21:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -156435234, now seen corresponding path program 2 times [2022-03-15 22:21:55,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:55,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205284586] [2022-03-15 22:21:55,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:55,210 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:21:55,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:55,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205284586] [2022-03-15 22:21:55,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205284586] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:55,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699783336] [2022-03-15 22:21:55,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:21:55,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:55,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:55,213 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:21:55,214 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:21:55,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:21:55,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:55,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:21:55,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:55,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-03-15 22:21:55,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:55,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:55,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2022-03-15 22:21:55,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:55,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2022-03-15 22:21:55,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:55,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 22:21:55,573 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:21:55,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:55,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:55,689 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:55,689 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 49 treesize of output 84 [2022-03-15 22:21:55,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:55,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:21:55,720 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 39 treesize of output 74 [2022-03-15 22:22:33,111 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:22:33,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699783336] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:33,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:33,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 22:22:33,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157554278] [2022-03-15 22:22:33,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:33,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:33,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:22:33,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:36,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [3284#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N))), 3281#(or (= C1 C2) (< k N)), 3290#(or (<= N (+ i 1)) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) C2) (< (+ 2 i) N) (< k N)), 3286#(or (not (< k N)) (< (+ k 1) N) (= C1 (store C2 k (+ (select A k) (select B k))))), 3285#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N)) (< k N)), 3291#(or (<= N (+ i 1)) (< (+ 2 i) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store C2 k (+ (select A k) (select B k)))) (<= N k) (< (+ k 1) N)), 3289#(or (<= N (+ i 1)) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) C2) (< (+ 2 i) N)), 3296#(or (<= N (+ i 1)) (< (+ 2 i) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store (store C2 j (+ (select A j) (select B j))) k (+ (select A k) (select B k)))) (<= M j)), 3294#(or (<= N (+ i 1)) (< (+ 2 i) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store C2 k (+ (select A k) (select B k))))), 3292#(or (= C1 (store C2 k (+ (select A k) (select B k)))) (< i N)), 3295#(or (<= N i) (< (+ i 1) N) (= (store C1 i (+ (select A i) (select B i))) (store (store C2 j (+ (select A j) (select B j))) k (+ (select A k) (select B k)))) (<= M j)), 3293#(or (< (+ i 1) N) (not (< i N)) (= (store C1 i (+ (select A i) (select B i))) (store C2 k (+ (select A k) (select B k))))), 3288#(or (not (< k N)) (< (+ i 1) N) (not (< i N)) (= (store C1 i (+ (select A i) (select B i))) (store C2 k (+ (select A k) (select B k)))) (< (+ k 1) N)), 3282#(or (= C1 C2) (< i N)), 3283#(or (= C1 C2) (< k N) (< i N)), 3287#(or (not (< k N)) (< (+ k 1) N) (= C1 (store C2 k (+ (select A k) (select B k)))) (< i N))] [2022-03-15 22:22:36,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:22:36,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:22:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=859, Unknown=3, NotChecked=0, Total=992 [2022-03-15 22:22:36,407 INFO L87 Difference]: Start difference. First operand 251 states and 893 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:22:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:45,983 INFO L93 Difference]: Finished difference Result 1047 states and 3061 transitions. [2022-03-15 22:22:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-03-15 22:22:45,984 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:22:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:45,988 INFO L225 Difference]: With dead ends: 1047 [2022-03-15 22:22:45,988 INFO L226 Difference]: Without dead ends: 1003 [2022-03-15 22:22:45,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10731 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=4199, Invalid=24528, Unknown=3, NotChecked=0, Total=28730 [2022-03-15 22:22:45,993 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 457 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:45,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 0 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:22:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-03-15 22:22:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 316. [2022-03-15 22:22:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.676190476190476) internal successors, (1158), 315 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1158 transitions. [2022-03-15 22:22:46,012 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1158 transitions. Word has length 15 [2022-03-15 22:22:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:46,013 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 1158 transitions. [2022-03-15 22:22:46,013 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:22:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1158 transitions. [2022-03-15 22:22:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:22:46,014 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:46,014 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:46,032 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:22:46,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:46,228 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:22:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1556849036, now seen corresponding path program 3 times [2022-03-15 22:22:46,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:46,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096347495] [2022-03-15 22:22:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:46,446 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:22:46,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:46,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096347495] [2022-03-15 22:22:46,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096347495] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:46,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284978087] [2022-03-15 22:22:46,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:22:46,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:46,448 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:22:46,449 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:22:46,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:22:46,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:46,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:22:46,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:46,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:46,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2022-03-15 22:22:46,713 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:22:46,714 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 46 treesize of output 54 [2022-03-15 22:22:46,726 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:22:46,726 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 49 treesize of output 57 [2022-03-15 22:22:46,737 INFO L353 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-03-15 22:22:46,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2022-03-15 22:22:46,849 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:22:46,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:47,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:22:47,023 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 49 treesize of output 76 [2022-03-15 22:22:47,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:22:47,041 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 39 treesize of output 66 [2022-03-15 22:23:03,201 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:23:03,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284978087] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:03,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:03,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-03-15 22:23:03,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119296578] [2022-03-15 22:23:03,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:03,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:03,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:23:03,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:03,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [5361#(or (<= N (+ i 1)) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) C2) (< (+ 2 i) N)), 5364#(or (<= N i) (< (+ i 1) N) (= (store C1 i (+ (select A i) (select B i))) (store C2 j (+ (select A j) (select B j)))) (<= M j)), 5324#(or (= C1 C2) (< k N)), 5359#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N))), 5360#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N)) (< k N)), 5362#(or (<= N (+ i 1)) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) C2) (< (+ 2 i) N) (< k N)), 5357#(or (= C1 C2) (< i N)), 5365#(or (<= N (+ i 1)) (< (+ 2 i) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store C2 j (+ (select A j) (select B j)))) (<= M j)), 5366#(and (or (not (< i N)) (= (store C1 i (+ (select A i) (select B i))) (store (store C2 k (+ (select A k) (select B k))) j (+ (select A j) (select B j)))) (<= (+ 2 i) N) (<= M j)) (or (not (< i N)) (<= (+ 2 i) N) (not (<= k j)) (<= M j))), 5367#(and (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (not (<= k j)) (<= M j)) (or (<= (+ 3 i) N) (not (< (+ i 1) N)) (= (store (store C2 k (+ (select A k) (select B k))) j (+ (select A j) (select B j))) (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1))))) (<= M j))), 5358#(or (= C1 C2) (< k N) (< i N)), 5363#(or (= C1 (store C2 j (+ (select A j) (select B j)))) (< i N) (<= M j))] [2022-03-15 22:23:03,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:23:03,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:23:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:23:03,999 INFO L87 Difference]: Start difference. First operand 316 states and 1158 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 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:23:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:12,080 INFO L93 Difference]: Finished difference Result 983 states and 3041 transitions. [2022-03-15 22:23:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 22:23:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:23:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:12,084 INFO L225 Difference]: With dead ends: 983 [2022-03-15 22:23:12,084 INFO L226 Difference]: Without dead ends: 965 [2022-03-15 22:23:12,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3808 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2118, Invalid=10538, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 22:23:12,087 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 347 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:12,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 0 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:23:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-03-15 22:23:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 355. [2022-03-15 22:23:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.7401129943502824) internal successors, (1324), 354 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1324 transitions. [2022-03-15 22:23:12,099 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1324 transitions. Word has length 15 [2022-03-15 22:23:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:12,100 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 1324 transitions. [2022-03-15 22:23:12,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 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:23:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1324 transitions. [2022-03-15 22:23:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:23:12,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:12,101 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:12,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:23:12,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:12,320 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:23:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1671365640, now seen corresponding path program 4 times [2022-03-15 22:23:12,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:12,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516745132] [2022-03-15 22:23:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:12,479 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:23:12,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:12,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516745132] [2022-03-15 22:23:12,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516745132] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:12,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165136478] [2022-03-15 22:23:12,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:23:12,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:12,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:12,481 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:23:12,496 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:23:12,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:23:12,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:12,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:23:12,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:12,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2022-03-15 22:23:12,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:12,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,665 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 52 treesize of output 42 [2022-03-15 22:23:12,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:12,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,669 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 38 treesize of output 18 [2022-03-15 22:23:12,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:23:12,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 22:23:12,725 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:23:12,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:12,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:23:12,903 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 55 treesize of output 74 [2022-03-15 22:23:12,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:23:12,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:23:12,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 43 treesize of output 62 [2022-03-15 22:23:19,916 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:23:19,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165136478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:19,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:19,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-03-15 22:23:19,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677980322] [2022-03-15 22:23:19,917 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:19,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:19,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:23:19,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:25,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [7332#(or (= (store C1 i (+ (select A i) (select B i))) C2) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N))), 7337#(or (<= N (+ k 1)) (<= (+ 3 k) N) (= (store (store C2 k (+ (select A k) (select B k))) (+ k 1) (+ (select A (+ k 1)) (select B (+ k 1)))) C1) (< i N)), 7327#(or (= C1 C2) (< i N)), 7328#(or (= C1 C2) (<= (+ k 1) N) (< i N)), 7338#(or (<= N (+ k 1)) (<= (+ 3 k) N) (<= N i) (< (+ i 1) N) (= (store C1 i (+ (select A i) (select B i))) (store (store C2 k (+ (select A k) (select B k))) (+ k 1) (+ (select A (+ k 1)) (select B (+ k 1)))))), 7331#(or (<= N (+ k 1)) (<= (+ 3 k) N) (= (store (store C2 k (+ (select A k) (select B k))) (+ k 1) (+ (select A (+ k 1)) (select B (+ k 1)))) C1)), 7336#(or (<= N (+ i 1)) (not (< k N)) (< (+ 2 i) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store C2 k (+ (select A k) (select B k)))) (< (+ k 1) N)), 7329#(or (<= (+ 2 k) N) (<= N k) (= C1 (store C2 k (+ (select A k) (select B k)))) (< i N)), 7335#(or (<= N (+ i 1)) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) C2) (< (+ 2 i) N) (< k N)), 7330#(or (= (store C1 i (+ (select A i) (select B i))) C2) (< (+ i 1) N) (not (< i N))), 7334#(or (<= N (+ i 1)) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) C2) (< (+ 2 i) N)), 7333#(or (not (< k N)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (store C1 i (+ (select A i) (select B i))) (store C2 k (+ (select A k) (select B k))))), 7340#(or (<= N (+ k 1)) (= C1 (store (store C2 k (+ (select A k) (select B k))) (+ (- 1) N) (+ (select B (+ (- 1) N)) (select A (+ (- 1) N))))) (< i N)), 7341#(or (<= N (+ k 1)) (= (store C1 i (+ (select A i) (select B i))) (store (store C2 k (+ (select A k) (select B k))) (+ (- 1) N) (+ (select B (+ (- 1) N)) (select A (+ (- 1) N))))) (< (+ i 1) N) (not (< i N))), 7339#(or (<= N (+ k 1)) (<= N (+ i 1)) (<= (+ 3 k) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store (store C2 k (+ (select A k) (select B k))) (+ k 1) (+ (select A (+ k 1)) (select B (+ k 1))))) (< (+ 2 i) N)), 7342#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (= (store (store C1 i (+ (select A i) (select B i))) (+ i 1) (+ (select B (+ i 1)) (select A (+ i 1)))) (store (store C2 k (+ (select A k) (select B k))) (+ (- 1) N) (+ (select B (+ (- 1) N)) (select A (+ (- 1) N))))))] [2022-03-15 22:23:25,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:23:25,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:23:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1072, Unknown=3, NotChecked=0, Total=1260 [2022-03-15 22:23:25,364 INFO L87 Difference]: Start difference. First operand 355 states and 1324 transitions. Second operand has 25 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:29,652 INFO L93 Difference]: Finished difference Result 943 states and 3110 transitions. [2022-03-15 22:23:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 22:23:29,652 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 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:23:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:29,657 INFO L225 Difference]: With dead ends: 943 [2022-03-15 22:23:29,657 INFO L226 Difference]: Without dead ends: 920 [2022-03-15 22:23:29,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1363, Invalid=6116, Unknown=3, NotChecked=0, Total=7482 [2022-03-15 22:23:29,658 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:29,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:23:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-03-15 22:23:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 446. [2022-03-15 22:23:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.7932584269662923) internal successors, (1688), 445 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1688 transitions. [2022-03-15 22:23:29,672 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1688 transitions. Word has length 15 [2022-03-15 22:23:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:29,672 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1688 transitions. [2022-03-15 22:23:29,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1688 transitions. [2022-03-15 22:23:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:23:29,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:29,673 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:29,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 22:23:29,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:29,890 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:23:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 306749742, now seen corresponding path program 5 times [2022-03-15 22:23:29,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:29,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430583662] [2022-03-15 22:23:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:29,939 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:23:29,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:29,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430583662] [2022-03-15 22:23:29,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430583662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:29,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666695173] [2022-03-15 22:23:29,939 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:23:29,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:29,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:29,950 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:23:29,951 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:23:29,984 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:23:29,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:29,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:23:29,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:30,095 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:23:30,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:30,195 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:23:30,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666695173] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:30,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:30,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2022-03-15 22:23:30,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [522109130] [2022-03-15 22:23:30,196 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:30,196 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:30,200 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:23:30,200 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:31,003 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [9385#(< k N), 9391#(or (<= N k) (< (+ k 1) N) (< i N)), 9393#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 9397#(or (<= N k) (<= (+ k j 1) (+ M i))), 9398#(or (<= (+ 2 j) M) (< i N)), 9387#(or (<= N i) (< (+ i 1) N) (< k N)), 9392#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 9395#(or (<= (+ 3 k j) (+ N M)) (<= N k)), 9399#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 9389#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9381#(< i N), 9382#(or (<= N i) (< (+ i 1) N)), 9384#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9383#(or (<= N (+ i 1)) (< (+ 2 i) N)), 9396#(or (<= (+ 2 k j) (+ M i)) (<= N k)), 9400#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 9386#(or (< k N) (< i N)), 9401#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 9390#(or (<= N k) (< (+ k 1) N)), 9394#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)), 9388#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N))] [2022-03-15 22:23:31,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:23:31,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:31,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:23:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:23:31,004 INFO L87 Difference]: Start difference. First operand 446 states and 1688 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:37,048 INFO L93 Difference]: Finished difference Result 1597 states and 4860 transitions. [2022-03-15 22:23:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-03-15 22:23:37,048 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 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:23:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:37,054 INFO L225 Difference]: With dead ends: 1597 [2022-03-15 22:23:37,054 INFO L226 Difference]: Without dead ends: 1597 [2022-03-15 22:23:37,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18882 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7828, Invalid=42124, Unknown=0, NotChecked=0, Total=49952 [2022-03-15 22:23:37,057 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 731 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:37,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 0 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:23:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-03-15 22:23:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 676. [2022-03-15 22:23:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 3.854814814814815) internal successors, (2602), 675 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2602 transitions. [2022-03-15 22:23:37,080 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 2602 transitions. Word has length 15 [2022-03-15 22:23:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:37,081 INFO L470 AbstractCegarLoop]: Abstraction has 676 states and 2602 transitions. [2022-03-15 22:23:37,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 2602 transitions. [2022-03-15 22:23:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:37,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:37,083 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:37,099 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:23:37,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 22:23:37,299 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:23:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 985548030, now seen corresponding path program 4 times [2022-03-15 22:23:37,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:37,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133930701] [2022-03-15 22:23:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:37,349 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:23:37,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:37,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133930701] [2022-03-15 22:23:37,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133930701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:37,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615298] [2022-03-15 22:23:37,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:23:37,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:37,350 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:23:37,351 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:23:37,375 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:23:37,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:37,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:23:37,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:37,416 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:23:37,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:37,457 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:23:37,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615298] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:37,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:37,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 22:23:37,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1688186522] [2022-03-15 22:23:37,458 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:37,458 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:37,463 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:23:37,463 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:37,902 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [12828#(or (<= N i) (< (+ i 1) N)), 12814#(or (<= M (+ j 1)) (< i N)), 12827#(or (< i N) (<= M j)), 12831#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 12832#(or (<= N i) (< (+ i 1) N) (<= M (+ j 1))), 12830#(or (<= N (+ i 1)) (< (+ 2 i) N)), 12826#(< i N), 12829#(or (<= N i) (< (+ i 1) N) (<= M j)), 12833#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1)))] [2022-03-15 22:23:37,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:23:37,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:37,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:23:37,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:23:37,903 INFO L87 Difference]: Start difference. First operand 676 states and 2602 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:38,324 INFO L93 Difference]: Finished difference Result 1381 states and 5036 transitions. [2022-03-15 22:23:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:23:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:23:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:38,331 INFO L225 Difference]: With dead ends: 1381 [2022-03-15 22:23:38,331 INFO L226 Difference]: Without dead ends: 1367 [2022-03-15 22:23:38,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=440, Invalid=1120, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:23:38,331 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:38,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:23:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-03-15 22:23:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 775. [2022-03-15 22:23:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 3.9573643410852712) internal successors, (3063), 774 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3063 transitions. [2022-03-15 22:23:38,352 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3063 transitions. Word has length 16 [2022-03-15 22:23:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:38,352 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 3063 transitions. [2022-03-15 22:23:38,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3063 transitions. [2022-03-15 22:23:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:38,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:38,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:38,371 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:23:38,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:38,563 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:23:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -529382376, now seen corresponding path program 5 times [2022-03-15 22:23:38,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:38,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782914494] [2022-03-15 22:23:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:38,613 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:23:38,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:38,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782914494] [2022-03-15 22:23:38,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782914494] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:38,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421675722] [2022-03-15 22:23:38,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:23:38,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:38,615 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:23:38,618 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:23:38,643 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:23:38,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:38,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:23:38,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:38,714 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:23:38,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:38,788 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:23:38,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421675722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:38,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:38,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:23:38,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973242508] [2022-03-15 22:23:38,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:38,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:38,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:23:38,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:39,710 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [15890#(or (<= N (+ k 1)) (not (< j M))), 15925#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N)), 15913#(or (<= N i) (< (+ i 1) N) (< k N)), 15934#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 15928#(or (<= N (+ k 1)) (not (< j M)) (< i N)), 15917#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 15916#(or (<= N k) (< i N)), 15918#(or (<= N i) (< (+ i 1) N) (<= N k)), 15910#(< k N), 15927#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 15935#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 15911#(or (< k N) (< i N)), 15922#(or (<= N (+ i 1)) (< (+ 2 i) N)), 15909#(< i N), 15912#(or (<= N i) (< (+ i 1) N)), 15915#(or (<= N k) (< (+ k 1) N) (< i N)), 15914#(or (<= N k) (< (+ k 1) N)), 15920#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 15933#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 15919#(or (<= N (+ k 1)) (< (+ 2 k) N)), 15932#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (<= M j)), 15926#(or (<= N (+ k 1)) (< i N)), 15924#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 15923#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 15929#(or (< i N) (<= (+ N M) (+ 2 k j))), 15931#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 15921#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 15930#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k))] [2022-03-15 22:23:39,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:23:39,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:39,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:23:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1567, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:23:39,711 INFO L87 Difference]: Start difference. First operand 775 states and 3063 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:41,930 INFO L93 Difference]: Finished difference Result 2116 states and 7641 transitions. [2022-03-15 22:23:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-15 22:23:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:23:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:41,947 INFO L225 Difference]: With dead ends: 2116 [2022-03-15 22:23:41,947 INFO L226 Difference]: Without dead ends: 2072 [2022-03-15 22:23:41,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5905 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3922, Invalid=14438, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 22:23:41,958 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 502 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:41,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 0 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:23:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-03-15 22:23:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1005. [2022-03-15 22:23:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 1004 states have (on average 4.134462151394422) internal successors, (4151), 1004 states have internal predecessors, (4151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 4151 transitions. [2022-03-15 22:23:41,997 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 4151 transitions. Word has length 16 [2022-03-15 22:23:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:41,997 INFO L470 AbstractCegarLoop]: Abstraction has 1005 states and 4151 transitions. [2022-03-15 22:23:41,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 4151 transitions. [2022-03-15 22:23:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:41,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:41,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:42,015 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:23:42,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:23:42,215 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:23:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -992537278, now seen corresponding path program 6 times [2022-03-15 22:23:42,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:42,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562890417] [2022-03-15 22:23:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:42,262 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:23:42,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:42,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562890417] [2022-03-15 22:23:42,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562890417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:42,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58960182] [2022-03-15 22:23:42,262 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:42,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:42,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:42,263 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:23:42,265 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:23:42,290 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:23:42,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:42,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:23:42,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:42,366 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:23:42,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:42,447 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:23:42,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58960182] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:42,447 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:42,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:23:42,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774532676] [2022-03-15 22:23:42,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:42,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:42,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:23:42,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:43,023 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [20363#(or (< i N) (<= (+ N M) (+ 2 k j))), 20366#(or (<= N i) (< (+ i 1) N) (< k N)), 20371#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 20373#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 20360#(or (<= N k) (< (+ k 1) N) (< i N)), 20372#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 20370#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 20362#(or (<= (+ N M) (+ k j 1)) (< i N)), 20368#(or (<= N i) (< (+ i 1) N) (<= N k)), 20357#(< i N), 20364#(or (<= N i) (< (+ i 1) N)), 20361#(or (<= N k) (< i N)), 20367#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 20374#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 20358#(or (< k N) (< i N)), 20359#(or (<= N k) (< (+ k 1) N)), 20365#(or (<= N (+ i 1)) (< (+ 2 i) N)), 20356#(< k N), 20369#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 20375#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j)))] [2022-03-15 22:23:43,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:23:43,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:23:43,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:23:43,024 INFO L87 Difference]: Start difference. First operand 1005 states and 4151 transitions. Second operand has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:44,683 INFO L93 Difference]: Finished difference Result 2281 states and 8494 transitions. [2022-03-15 22:23:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 22:23:44,684 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:23:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:44,703 INFO L225 Difference]: With dead ends: 2281 [2022-03-15 22:23:44,703 INFO L226 Difference]: Without dead ends: 2266 [2022-03-15 22:23:44,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2579, Invalid=9631, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 22:23:44,704 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 530 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:44,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 0 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:23:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-03-15 22:23:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1086. [2022-03-15 22:23:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 4.209216589861751) internal successors, (4567), 1085 states have internal predecessors, (4567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 4567 transitions. [2022-03-15 22:23:44,740 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 4567 transitions. Word has length 16 [2022-03-15 22:23:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:44,741 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 4567 transitions. [2022-03-15 22:23:44,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 4567 transitions. [2022-03-15 22:23:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:44,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:44,745 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:44,768 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:23:44,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:23:44,961 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:23:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash -133068102, now seen corresponding path program 7 times [2022-03-15 22:23:44,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:44,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111189077] [2022-03-15 22:23:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:44,996 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:23:44,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:44,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111189077] [2022-03-15 22:23:44,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111189077] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:44,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120622768] [2022-03-15 22:23:44,996 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:23:44,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:44,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:44,997 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:23:44,998 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:23:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:45,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:23:45,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:45,131 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:23:45,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:45,225 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:23:45,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120622768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:45,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:45,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:23:45,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99175377] [2022-03-15 22:23:45,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:45,227 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:45,231 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:23:45,231 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:45,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [25086#(or (< k N) (< i N)), 25085#(< k N), 25098#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 25096#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 25084#(or (< i N) (<= M j)), 25093#(or (<= N i) (< (+ i 1) N) (< k N)), 25090#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 25089#(or (<= N i) (< (+ i 1) N) (<= M j)), 25094#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 25088#(or (<= N (+ i 1)) (< (+ 2 i) N)), 25092#(or (< i N) (<= (+ N M) (+ 2 k j))), 25083#(< i N), 25091#(or (<= (+ N M) (+ k j 1)) (< i N)), 25095#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 25087#(or (<= N i) (< (+ i 1) N)), 25097#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1)))] [2022-03-15 22:23:45,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:23:45,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:23:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:23:45,807 INFO L87 Difference]: Start difference. First operand 1086 states and 4567 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:47,809 INFO L93 Difference]: Finished difference Result 2398 states and 8900 transitions. [2022-03-15 22:23:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 22:23:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:23:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:47,827 INFO L225 Difference]: With dead ends: 2398 [2022-03-15 22:23:47,827 INFO L226 Difference]: Without dead ends: 2374 [2022-03-15 22:23:47,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3099, Invalid=11421, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 22:23:47,829 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 392 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:47,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 0 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:23:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2022-03-15 22:23:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1140. [2022-03-15 22:23:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 4.223880597014926) internal successors, (4811), 1139 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 4811 transitions. [2022-03-15 22:23:47,882 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 4811 transitions. Word has length 16 [2022-03-15 22:23:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:47,883 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 4811 transitions. [2022-03-15 22:23:47,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 4811 transitions. [2022-03-15 22:23:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:47,885 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:47,885 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:47,903 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:23:48,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:23:48,103 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:23:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash -247584706, now seen corresponding path program 6 times [2022-03-15 22:23:48,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:48,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709874965] [2022-03-15 22:23:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:48,140 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:23:48,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:48,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709874965] [2022-03-15 22:23:48,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709874965] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:48,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217781445] [2022-03-15 22:23:48,140 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:23:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:48,141 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:23:48,142 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:23:48,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:23:48,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:48,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:23:48,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:48,254 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:23:48,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:48,283 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:23:48,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217781445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:48,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:48,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 22:23:48,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840819250] [2022-03-15 22:23:48,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:48,284 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:48,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:23:48,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:49,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [30070#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< (+ 2 k) N)), 30074#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 30056#(or (<= N k) (< (+ k 1) N)), 30078#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 30057#(or (<= N (+ k 1)) (< (+ 2 k) N)), 30061#(or (<= N k) (< (+ k 1) N) (< i N)), 30069#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 30067#(or (<= N i) (< (+ i 1) N)), 30058#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 30077#(or (<= N i) (< (+ i 1) N) (<= N k)), 30081#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 30072#(or (<= N (+ i 1)) (< (+ 2 i) N)), 30063#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 30079#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k))), 30068#(or (<= N i) (< (+ i 1) N) (< k N)), 30075#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N)), 30062#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 30082#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 30064#(or (<= N k) (< i N)), 30071#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 k)) (< (+ 3 k) N)), 30055#(< k N), 30059#(< i N), 30066#(or (<= N (+ 2 k)) (< i N)), 30065#(or (<= N (+ k 1)) (< i N)), 30073#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 30060#(or (< k N) (< i N)), 30080#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 30076#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k)) (< (+ 3 k) N))] [2022-03-15 22:23:49,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 22:23:49,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 22:23:49,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1433, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:23:49,270 INFO L87 Difference]: Start difference. First operand 1140 states and 4811 transitions. Second operand has 36 states, 36 states have (on average 3.0) internal successors, (108), 35 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:23:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:50,201 INFO L93 Difference]: Finished difference Result 3225 states and 13281 transitions. [2022-03-15 22:23:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 22:23:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 35 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:23:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:50,213 INFO L225 Difference]: With dead ends: 3225 [2022-03-15 22:23:50,213 INFO L226 Difference]: Without dead ends: 3171 [2022-03-15 22:23:50,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1329, Invalid=4523, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:23:50,214 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:50,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 0 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:23:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2022-03-15 22:23:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 1465. [2022-03-15 22:23:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1464 states have (on average 4.386612021857924) internal successors, (6422), 1464 states have internal predecessors, (6422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 6422 transitions. [2022-03-15 22:23:50,258 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 6422 transitions. Word has length 16 [2022-03-15 22:23:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:50,258 INFO L470 AbstractCegarLoop]: Abstraction has 1465 states and 6422 transitions. [2022-03-15 22:23:50,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 35 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:23:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 6422 transitions. [2022-03-15 22:23:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:50,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:50,262 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:50,298 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:23:50,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 22:23:50,478 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:23:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1587261622, now seen corresponding path program 8 times [2022-03-15 22:23:50,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:50,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949050477] [2022-03-15 22:23:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:50,530 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:23:50,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:50,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949050477] [2022-03-15 22:23:50,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949050477] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:50,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553065180] [2022-03-15 22:23:50,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:50,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:50,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:50,532 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:23:50,532 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:23:50,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:50,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:50,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:23:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:50,681 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:23:50,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:50,797 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:23:50,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553065180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:50,798 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:50,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 22:23:50,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234339013] [2022-03-15 22:23:50,798 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:50,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:50,804 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:23:50,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:51,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [36452#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 36428#(or (<= N i) (< (+ i 1) N) (< k N)), 36442#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 36429#(or (<= (+ k j 1) (+ N M)) (<= N i) (< (+ i 1) N)), 36447#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)), 36448#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 36424#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 36425#(< k N), 36437#(or (<= N k) (< (+ k 1) N) (< i N)), 36432#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 36449#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 36450#(or (<= (+ 3 k j) (+ N M)) (< i N)), 36438#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 36434#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 36446#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 36444#(or (<= (+ 3 k j) (+ N M)) (< i N) (<= M j)), 36431#(or (<= N (+ i 1)) (<= (+ k j 1) (+ N M)) (< (+ 2 i) N)), 36423#(or (<= N (+ i 1)) (< (+ 2 i) N)), 36436#(or (<= N k) (< (+ k 1) N)), 36426#(or (< k N) (< i N)), 36440#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 36453#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 36420#(or (<= N i) (< (+ i 1) N)), 36421#(or (<= (+ j 1) M) (< i N)), 36433#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 36419#(< i N), 36422#(or (<= N i) (< (+ i 1) N) (< j M)), 36435#(or (<= (+ k j 1) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 36443#(or (<= (+ 3 k j) (+ N M)) (<= M j)), 36430#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 36427#(or (<= (+ k j 1) (+ N M)) (< i N)), 36451#(or (<= (+ 3 k j) (+ N M)) (<= N i) (< (+ i 1) N)), 36445#(or (<= (+ 3 k j) (+ N M)) (<= N i) (< (+ i 1) N) (<= M j)), 36441#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 36439#(or (<= (+ 2 k j) (+ N M)) (< i N))] [2022-03-15 22:23:51,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:23:51,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:23:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2738, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 22:23:51,802 INFO L87 Difference]: Start difference. First operand 1465 states and 6422 transitions. Second operand has 44 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:59,537 INFO L93 Difference]: Finished difference Result 2903 states and 10856 transitions. [2022-03-15 22:23:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-03-15 22:23:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 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:23:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:59,545 INFO L225 Difference]: With dead ends: 2903 [2022-03-15 22:23:59,546 INFO L226 Difference]: Without dead ends: 2903 [2022-03-15 22:23:59,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26875 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11183, Invalid=61987, Unknown=0, NotChecked=0, Total=73170 [2022-03-15 22:23:59,549 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1042 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:59,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1042 Valid, 0 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:23:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2022-03-15 22:23:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1532. [2022-03-15 22:23:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 4.389941214892227) internal successors, (6721), 1531 states have internal predecessors, (6721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 6721 transitions. [2022-03-15 22:23:59,588 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 6721 transitions. Word has length 16 [2022-03-15 22:23:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:59,588 INFO L470 AbstractCegarLoop]: Abstraction has 1532 states and 6721 transitions. [2022-03-15 22:23:59,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 6721 transitions. [2022-03-15 22:23:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:23:59,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:59,592 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:59,614 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:23:59,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:59,808 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:23:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 48319670, now seen corresponding path program 9 times [2022-03-15 22:23:59,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:59,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011976482] [2022-03-15 22:23:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:59,864 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:23:59,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:59,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011976482] [2022-03-15 22:23:59,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011976482] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:59,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561941765] [2022-03-15 22:23:59,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:23:59,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:59,866 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:23:59,880 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:23:59,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:23:59,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:59,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:23:59,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:59,984 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:23:59,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:00,058 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:24:00,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561941765] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:00,058 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:00,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:24:00,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541284255] [2022-03-15 22:24:00,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:00,059 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:00,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:24:00,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:00,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [42960#(< i N), 42965#(or (< k N) (< i N)), 42974#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 42963#(< k N), 42976#(or (<= N (+ i 1)) (< (+ 2 i) N)), 42968#(or (<= (+ 3 k j) (+ N M)) (< i N)), 42986#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 42982#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 42987#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 42984#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 42978#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 42985#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 42983#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 42964#(or (< k N) (<= (+ j 1) M)), 42961#(or (<= (+ j 1) M) (< i N)), 42962#(or (<= (+ 2 j) M) (< i N)), 42980#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 42970#(or (<= N i) (< (+ i 1) N) (< j M)), 42971#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 42988#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 42967#(or (<= (+ 2 k j) (+ N M)) (< i N)), 42981#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 42969#(or (<= N i) (< (+ i 1) N)), 42979#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 42972#(or (<= N i) (< (+ i 1) N) (< k N)), 42975#(or (<= (+ 3 k j) (+ N M)) (<= N i) (< (+ i 1) N)), 42966#(or (< j M) (< k N) (< i N)), 42989#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 42973#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 42977#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:24:00,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:24:00,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:00,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:24:00,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:24:00,772 INFO L87 Difference]: Start difference. First operand 1532 states and 6721 transitions. Second operand has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:03,539 INFO L93 Difference]: Finished difference Result 2507 states and 9273 transitions. [2022-03-15 22:24:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 22:24:03,539 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:24:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:03,546 INFO L225 Difference]: With dead ends: 2507 [2022-03-15 22:24:03,546 INFO L226 Difference]: Without dead ends: 2507 [2022-03-15 22:24:03,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8006 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4886, Invalid=20874, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 22:24:03,548 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 555 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:03,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 0 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:24:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-03-15 22:24:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1601. [2022-03-15 22:24:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 4.3475) internal successors, (6956), 1600 states have internal predecessors, (6956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 6956 transitions. [2022-03-15 22:24:03,586 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 6956 transitions. Word has length 16 [2022-03-15 22:24:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:03,586 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 6956 transitions. [2022-03-15 22:24:03,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 6956 transitions. [2022-03-15 22:24:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:24:03,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:03,590 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:03,624 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:24:03,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:24:03,825 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:24:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1673804610, now seen corresponding path program 7 times [2022-03-15 22:24:03,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:03,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207435551] [2022-03-15 22:24:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:03,885 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:24:03,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:03,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207435551] [2022-03-15 22:24:03,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207435551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:03,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293408405] [2022-03-15 22:24:03,885 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:24:03,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:03,887 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:24:03,887 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:24:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:03,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:24:03,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:04,005 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:24:04,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:04,089 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:24:04,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293408405] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:04,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:04,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 22:24:04,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131812695] [2022-03-15 22:24:04,090 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:04,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:04,097 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:24:04,097 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:05,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [49033#(or (<= (+ 3 k) N) (< i N)), 49030#(< i N), 49060#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 49031#(or (< k N) (< i N)), 49063#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 49034#(< j M), 49046#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 49057#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 49053#(or (<= N i) (< (+ i 1) N) (< j M)), 49043#(or (<= N i) (< (+ i 1) N) (< k N)), 49061#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 49048#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N)), 49051#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 49054#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 49032#(or (<= (+ 2 k) N) (< i N)), 49036#(or (<= (+ 2 k) N) (< j M)), 49064#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 49049#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 49055#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 49038#(or (< j M) (< k N) (< i N)), 49041#(or (<= N i) (< (+ i 1) N)), 49052#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N)), 49056#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 49058#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 49045#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 49040#(or (<= (+ 3 k j) (+ N M)) (< i N)), 49035#(or (<= (+ k 1) N) (< j M)), 49062#(or (<= (+ 3 k j) (+ N M)) (<= N i) (< (+ i 1) N)), 49044#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 49050#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 49047#(or (<= (+ 3 k) N) (<= N i) (< (+ i 1) N)), 49042#(or (<= N (+ i 1)) (< (+ 2 i) N)), 49037#(or (< j M) (< i N)), 49059#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 49039#(or (<= (+ 2 k) N) (< j M) (< i N))] [2022-03-15 22:24:05,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:24:05,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:24:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2256, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 22:24:05,400 INFO L87 Difference]: Start difference. First operand 1601 states and 6956 transitions. Second operand has 44 states, 44 states have (on average 2.659090909090909) internal successors, (117), 43 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:10,071 INFO L93 Difference]: Finished difference Result 2685 states and 9828 transitions. [2022-03-15 22:24:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2022-03-15 22:24:10,072 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.659090909090909) internal successors, (117), 43 states have internal predecessors, (117), 0 states have call successors, (0), 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:24:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:10,087 INFO L225 Difference]: With dead ends: 2685 [2022-03-15 22:24:10,088 INFO L226 Difference]: Without dead ends: 2676 [2022-03-15 22:24:10,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17230 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8966, Invalid=39214, Unknown=0, NotChecked=0, Total=48180 [2022-03-15 22:24:10,091 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 804 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:10,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 0 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:24:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2022-03-15 22:24:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1687. [2022-03-15 22:24:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 4.279359430604982) internal successors, (7215), 1686 states have internal predecessors, (7215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 7215 transitions. [2022-03-15 22:24:10,130 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 7215 transitions. Word has length 16 [2022-03-15 22:24:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:10,130 INFO L470 AbstractCegarLoop]: Abstraction has 1687 states and 7215 transitions. [2022-03-15 22:24:10,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.659090909090909) internal successors, (117), 43 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 7215 transitions. [2022-03-15 22:24:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:24:10,133 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:10,134 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:10,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 22:24:10,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:10,347 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:24:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -601891774, now seen corresponding path program 8 times [2022-03-15 22:24:10,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:10,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130128398] [2022-03-15 22:24:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:10,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:10,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130128398] [2022-03-15 22:24:10,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130128398] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:10,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94037868] [2022-03-15 22:24:10,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:24:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:10,394 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:24:10,395 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:24:10,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:24:10,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:10,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:24:10,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:24:10,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:24:10,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94037868] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:10,528 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:10,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-03-15 22:24:10,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126662056] [2022-03-15 22:24:10,528 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:10,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:10,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:24:10,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:11,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [55586#(or (<= (+ 2 N j) (+ M i)) (<= N k) (< (+ k 1) N)), 55576#(or (<= N i) (< (+ i 1) N) (< k N)), 55590#(or (< (+ i 4) N) (<= N (+ 3 i))), 55569#(or (<= N k) (< (+ k 1) N)), 55584#(or (<= (+ N j 1) (+ M i)) (< k N)), 55582#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 55571#(or (<= (+ 3 j) M) (<= N k) (< (+ k 1) N)), 55588#(or (<= (+ N j 1) (+ M i)) (<= N k) (< (+ k 1) N)), 55587#(or (<= N (+ 2 i)) (<= N k) (< (+ 3 i) N) (< (+ k 1) N)), 55589#(or (<= N k) (< (+ k 1) N) (<= (+ N j) (+ M i))), 55568#(< k N), 55581#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 55592#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= N k) (< (+ k 1) N)), 55591#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 55573#(or (< k N) (< i N)), 55585#(or (< k N) (<= (+ N j) (+ M i))), 55580#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k) (< (+ k 1) N)), 55579#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 55575#(or (<= N i) (< (+ i 1) N)), 55570#(or (<= (+ 3 j) M) (< k N)), 55578#(or (<= N (+ i 1)) (< (+ 2 i) N)), 55583#(or (<= (+ 2 N j) (+ M i)) (< k N)), 55577#(or (<= N i) (< (+ i 1) N) (<= N k) (< (+ k 1) N)), 55574#(or (<= N k) (< (+ k 1) N) (< i N)), 55572#(< i N)] [2022-03-15 22:24:11,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:24:11,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:24:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:24:11,541 INFO L87 Difference]: Start difference. First operand 1687 states and 7215 transitions. Second operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:22,020 INFO L93 Difference]: Finished difference Result 4623 states and 16707 transitions. [2022-03-15 22:24:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2022-03-15 22:24:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:24:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:22,033 INFO L225 Difference]: With dead ends: 4623 [2022-03-15 22:24:22,033 INFO L226 Difference]: Without dead ends: 4623 [2022-03-15 22:24:22,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36157 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12541, Invalid=76561, Unknown=0, NotChecked=0, Total=89102 [2022-03-15 22:24:22,039 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 759 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:22,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 0 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:24:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2022-03-15 22:24:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 2310. [2022-03-15 22:24:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 4.384582070160243) internal successors, (10124), 2309 states have internal predecessors, (10124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 10124 transitions. [2022-03-15 22:24:22,127 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 10124 transitions. Word has length 16 [2022-03-15 22:24:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:22,127 INFO L470 AbstractCegarLoop]: Abstraction has 2310 states and 10124 transitions. [2022-03-15 22:24:22,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 10124 transitions. [2022-03-15 22:24:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:24:22,134 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:22,134 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:22,162 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:24:22,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:22,351 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:24:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash -794424282, now seen corresponding path program 10 times [2022-03-15 22:24:22,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:22,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126179758] [2022-03-15 22:24:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:22,544 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:24:22,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:22,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126179758] [2022-03-15 22:24:22,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126179758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:22,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321198209] [2022-03-15 22:24:22,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:24:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:22,560 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:24:22,562 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:24:22,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:24:22,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:22,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:24:22,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:22,735 INFO L353 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-03-15 22:24:22,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2022-03-15 22:24:22,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-03-15 22:24:22,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:22,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:22,867 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 68 treesize of output 56 [2022-03-15 22:24:22,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:22,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2022-03-15 22:24:22,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:22,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:24:22,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-03-15 22:24:22,972 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:24:22,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:23,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:23,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:23,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:24:23,212 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 73 treesize of output 178 [2022-03-15 22:24:23,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:23,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:24:23,297 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:24:23,297 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 57 treesize of output 162 Received shutdown request... [2022-03-15 22:35:57,503 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:35:57,504 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:35:57,519 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:35:57,549 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:35:57,549 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:35:57,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:35:57,707 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. [2022-03-15 22:35:57,708 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:35:57,708 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:35:57,708 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:35:57,710 INFO L732 BasicCegarLoop]: Path program histogram: [10, 8, 1, 1, 1] [2022-03-15 22:35:57,711 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:35:57,711 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:35:57,713 INFO L202 PluginConnector]: Adding new model vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:35:57 BasicIcfg [2022-03-15 22:35:57,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:35:57,714 INFO L158 Benchmark]: Toolchain (without parser) took 855574.37ms. Allocated memory was 176.2MB in the beginning and 515.9MB in the end (delta: 339.7MB). Free memory was 140.5MB in the beginning and 369.0MB in the end (delta: -228.5MB). Peak memory consumption was 370.5MB. Max. memory is 8.0GB. [2022-03-15 22:35:57,714 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:35:57,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.82ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:35:57,714 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 176.2MB. Free memory was 138.9MB in the beginning and 138.0MB in the end (delta: 935.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:35:57,714 INFO L158 Benchmark]: RCFGBuilder took 215.25ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 128.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:35:57,714 INFO L158 Benchmark]: TraceAbstraction took 855313.43ms. Allocated memory was 176.2MB in the beginning and 515.9MB in the end (delta: 339.7MB). Free memory was 127.9MB in the beginning and 369.0MB in the end (delta: -241.1MB). Peak memory consumption was 357.9MB. Max. memory is 8.0GB. [2022-03-15 22:35:57,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.82ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 176.2MB. Free memory was 138.9MB in the beginning and 138.0MB in the end (delta: 935.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 215.25ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 128.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 855313.43ms. Allocated memory was 176.2MB in the beginning and 515.9MB in the end (delta: 339.7MB). Free memory was 127.9MB in the beginning and 369.0MB in the end (delta: -241.1MB). Peak memory consumption was 357.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 25 PlacesAfterwards, 30 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 124, positive conditional: 0, positive unconditional: 124, 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: 67, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 124, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 67, unknown conditional: 0, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 855.2s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 65.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7844 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7844 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4477 mSDsCounter, 4191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17479 IncrementalHoareTripleChecker+Invalid, 21670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4191 mSolverCounterUnsat, 0 mSDtfsCounter, 17479 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3012 GetRequests, 723 SyntacticMatches, 64 SemanticMatches, 2225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145660 ImplicationChecksByTransitivity, 81.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2310occurred in iteration=20, InterpolantAutomatonStates: 1820, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 14495 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 65.9s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 758 ConstructedInterpolants, 29 QuantifiedInterpolants, 6883 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 54 InterpolantComputations, 3 PerfectInterpolantSequences, 140/329 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown