/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/unroll-cond-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:47:04,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:47:04,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:47:04,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:47:04,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:47:04,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:47:04,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:47:04,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:47:04,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:47:04,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:47:04,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:47:04,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:47:04,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:47:04,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:47:04,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:47:04,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:47:04,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:47:04,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:47:04,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:47:04,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:47:04,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:47:04,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:47:04,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:47:04,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:47:04,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:47:04,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:47:04,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:47:04,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:47:04,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:47:04,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:47:04,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:47:04,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:47:04,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:47:04,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:47:04,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:47:04,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:47:04,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:47:04,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:47:04,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:47:04,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:47:04,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:47:04,833 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 20:47:04,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:47:04,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:47:04,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:47:04,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:47:04,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:47:04,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:47:04,865 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:47:04,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:47:04,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:47:04,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:47:04,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:47:04,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:47:04,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:47:04,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:47:04,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:47:04,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:47:04,869 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:47:04,869 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:47:04,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:47:04,869 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 20:47:05,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:47:05,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:47:05,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:47:05,120 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:47:05,121 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:47:05,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-3.wvr.bpl [2022-03-15 20:47:05,123 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-3.wvr.bpl' [2022-03-15 20:47:05,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:47:05,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:47:05,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:47:05,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:47:05,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:47:05,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,172 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:47:05,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:47:05,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:47:05,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:47:05,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:47:05,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:47:05,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:47:05,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:47:05,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:47:05,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/1) ... [2022-03-15 20:47:05,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:47:05,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:05,224 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 20:47:05,236 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 20:47:05,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:47:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:47:05,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:47:05,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:47:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:47:05,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:47:05,264 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:47:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:47:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:47:05,265 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 20:47:05,305 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:47:05,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:47:05,450 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:47:05,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:47:05,490 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:47:05,491 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 20:47:05,492 INFO L202 PluginConnector]: Adding new model unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:47:05 BoogieIcfgContainer [2022-03-15 20:47:05,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:47:05,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:47:05,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:47:05,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:47:05,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:47:05" (1/2) ... [2022-03-15 20:47:05,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f73c37 and model type unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:47:05, skipping insertion in model container [2022-03-15 20:47:05,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:47:05" (2/2) ... [2022-03-15 20:47:05,509 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.bpl [2022-03-15 20:47:05,513 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:47:05,513 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:47:05,514 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:47:05,514 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:47:05,556 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:47:05,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:47:05,608 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 20:47:05,608 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:47:05,616 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:47:05,633 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 48 flow [2022-03-15 20:47:05,635 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 48 flow [2022-03-15 20:47:05,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 48 flow [2022-03-15 20:47:05,653 INFO L129 PetriNetUnfolder]: 2/14 cut-off events. [2022-03-15 20:47:05,653 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:47:05,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2022-03-15 20:47:05,656 INFO L116 LiptonReduction]: Number of co-enabled transitions 22 [2022-03-15 20:47:05,725 INFO L131 LiptonReduction]: Checked pairs total: 19 [2022-03-15 20:47:05,725 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-03-15 20:47:05,731 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:47:05,740 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:47:05,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:05,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:05,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1512318692, now seen corresponding path program 1 times [2022-03-15 20:47:05,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:05,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311171592] [2022-03-15 20:47:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:05,976 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 20:47:05,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:05,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311171592] [2022-03-15 20:47:05,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311171592] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:47:05,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:47:05,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:47:05,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339656203] [2022-03-15 20:47:05,980 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:05,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:05,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:47:05,999 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:06,253 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:06,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 7 treesize of output 16 [2022-03-15 20:47:06,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 20:47:06,469 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 20:47:06,476 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 20:47:06,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [53#(and (or (not (< (+ i2 1) n)) (< (+ 2 i2) n)) (or (<= n i2) (< (+ i2 1) n)) (or (= x2 x1) (< i2 n)))] [2022-03-15 20:47:06,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:47:06,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:47:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:47:06,554 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:06,656 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2022-03-15 20:47:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:47:06,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 8 [2022-03-15 20:47:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:06,682 INFO L225 Difference]: With dead ends: 29 [2022-03-15 20:47:06,682 INFO L226 Difference]: Without dead ends: 23 [2022-03-15 20:47:06,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:47:06,686 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:06,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-15 20:47:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2022-03-15 20:47:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-03-15 20:47:06,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 8 [2022-03-15 20:47:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:06,727 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2022-03-15 20:47:06,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2022-03-15 20:47:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:47:06,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:06,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:06,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:47:06,729 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash -362106383, now seen corresponding path program 1 times [2022-03-15 20:47:06,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:06,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461149557] [2022-03-15 20:47:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:06,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:06,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461149557] [2022-03-15 20:47:06,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461149557] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:06,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80286178] [2022-03-15 20:47:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:06,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:06,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:06,806 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 20:47:06,846 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 20:47:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:06,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:47:06,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:06,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:06,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-03-15 20:47:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:07,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:07,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:07,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 68 [2022-03-15 20:47:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:07,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80286178] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:07,411 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:07,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 20:47:07,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372145441] [2022-03-15 20:47:07,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:07,413 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:07,419 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:47:07,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:07,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [179#(and (or (< i1 n) (= (select f (select f x2)) x1) (not (< (+ i2 1) n)) (< (+ 2 i2) n)) (or (< i1 n) (= x2 x1) (< i2 n)) (or (< i1 n) (<= n i2) (< (+ i2 1) n) (= x1 (select f x2)))), 178#(and (or (<= n i2) (< (+ i2 1) n) (= x1 (select f x2))) (or (= (select f (select f x2)) x1) (not (< (+ i2 1) n)) (< (+ 2 i2) n)) (or (= x2 x1) (< i2 n)))] [2022-03-15 20:47:07,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:47:07,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:47:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:47:07,803 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:08,153 INFO L93 Difference]: Finished difference Result 52 states and 89 transitions. [2022-03-15 20:47:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:47:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 9 [2022-03-15 20:47:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:08,155 INFO L225 Difference]: With dead ends: 52 [2022-03-15 20:47:08,155 INFO L226 Difference]: Without dead ends: 43 [2022-03-15 20:47:08,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:47:08,156 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:08,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-15 20:47:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 21. [2022-03-15 20:47:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2022-03-15 20:47:08,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 9 [2022-03-15 20:47:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:08,162 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 40 transitions. [2022-03-15 20:47:08,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 40 transitions. [2022-03-15 20:47:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:47:08,162 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:08,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:08,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:08,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:08,383 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -669547581, now seen corresponding path program 1 times [2022-03-15 20:47:08,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:08,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328264442] [2022-03-15 20:47:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:08,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:08,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328264442] [2022-03-15 20:47:08,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328264442] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:47:08,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:47:08,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:47:08,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867665486] [2022-03-15 20:47:08,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:08,420 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:08,421 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:47:08,421 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:08,491 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [292#(< i1 n)] [2022-03-15 20:47:08,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:47:08,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:08,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:47:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:47:08,492 INFO L87 Difference]: Start difference. First operand 21 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:08,537 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. [2022-03-15 20:47:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:47:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 9 [2022-03-15 20:47:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:08,539 INFO L225 Difference]: With dead ends: 28 [2022-03-15 20:47:08,539 INFO L226 Difference]: Without dead ends: 25 [2022-03-15 20:47:08,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:47:08,544 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:08,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:47:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-15 20:47:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-03-15 20:47:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2022-03-15 20:47:08,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 9 [2022-03-15 20:47:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:08,558 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2022-03-15 20:47:08,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2022-03-15 20:47:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:47:08,560 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:08,561 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:08,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:47:08,562 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1660258436, now seen corresponding path program 2 times [2022-03-15 20:47:08,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:08,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000406704] [2022-03-15 20:47:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:08,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:08,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000406704] [2022-03-15 20:47:08,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000406704] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:08,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815828168] [2022-03-15 20:47:08,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:08,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:08,628 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 20:47:08,649 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 20:47:08,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:08,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:08,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:47:08,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:08,829 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:08,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2022-03-15 20:47:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:08,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:08,904 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:08,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 96 [2022-03-15 20:47:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:09,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815828168] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:09,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:09,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 20:47:09,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071800799] [2022-03-15 20:47:09,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:09,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:09,239 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 20:47:09,239 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:09,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [433#(and (or (<= n i2) (< (+ i2 1) n) (= x1 (select f x2))) (or (= (select f (select f x2)) x1) (not (< (+ i2 1) n)) (< (+ 2 i2) n)) (or (= x2 x1) (< i2 n))), 434#(and (or (<= n i2) (= (select f x1) (select f x2)) (<= n i1) (< (+ i2 1) n)) (or (= (select f (select f x2)) (select f x1)) (not (< (+ i2 1) n)) (<= n i1) (< (+ 2 i2) n)) (or (= (select f x1) x2) (<= n i1) (< i2 n)))] [2022-03-15 20:47:09,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:47:09,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:09,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:47:09,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:47:09,661 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:10,052 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2022-03-15 20:47:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:47:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:47:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:10,053 INFO L225 Difference]: With dead ends: 45 [2022-03-15 20:47:10,053 INFO L226 Difference]: Without dead ends: 39 [2022-03-15 20:47:10,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:47:10,054 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:10,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-03-15 20:47:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2022-03-15 20:47:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2022-03-15 20:47:10,058 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 10 [2022-03-15 20:47:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:10,058 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 49 transitions. [2022-03-15 20:47:10,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 49 transitions. [2022-03-15 20:47:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:47:10,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:10,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:10,084 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 20:47:10,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 20:47:10,275 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1354006530, now seen corresponding path program 1 times [2022-03-15 20:47:10,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:10,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823689289] [2022-03-15 20:47:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:10,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:10,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823689289] [2022-03-15 20:47:10,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823689289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:10,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460660721] [2022-03-15 20:47:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:10,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:10,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:10,306 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 20:47:10,316 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 20:47:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:10,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:47:10,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:10,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:10,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460660721] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:10,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:10,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 20:47:10,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443284924] [2022-03-15 20:47:10,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:10,386 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:10,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:47:10,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:10,476 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [604#(< i1 n), 605#(or (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:47:10,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:47:10,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:47:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:47:10,478 INFO L87 Difference]: Start difference. First operand 25 states and 49 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:10,591 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2022-03-15 20:47:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:47:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:47:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:10,592 INFO L225 Difference]: With dead ends: 39 [2022-03-15 20:47:10,592 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 20:47:10,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:47:10,593 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:10,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 20:47:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2022-03-15 20:47:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 25 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 20:47:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 50 transitions. [2022-03-15 20:47:10,596 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 50 transitions. Word has length 10 [2022-03-15 20:47:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:10,596 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 50 transitions. [2022-03-15 20:47:10,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 50 transitions. [2022-03-15 20:47:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:47:10,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:10,597 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:10,626 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 20:47:10,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:10,824 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -70941615, now seen corresponding path program 3 times [2022-03-15 20:47:10,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:10,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303625252] [2022-03-15 20:47:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:10,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:10,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303625252] [2022-03-15 20:47:10,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303625252] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:47:10,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:47:10,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:47:10,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898741622] [2022-03-15 20:47:10,858 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:10,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:10,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 20:47:10,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:10,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [715#(< (+ 2 i2) n), 716#(or (<= n i1) (< (+ 2 i2) n)), 717#(or (<= n (+ i1 1)) (< (+ 2 i2) n))] [2022-03-15 20:47:10,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:47:10,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:10,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:47:10,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:47:10,967 INFO L87 Difference]: Start difference. First operand 26 states and 50 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:11,040 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2022-03-15 20:47:11,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:47:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:47:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:11,041 INFO L225 Difference]: With dead ends: 31 [2022-03-15 20:47:11,041 INFO L226 Difference]: Without dead ends: 28 [2022-03-15 20:47:11,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:47:11,042 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:11,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-15 20:47:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-03-15 20:47:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-03-15 20:47:11,045 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 11 [2022-03-15 20:47:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:11,045 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 42 transitions. [2022-03-15 20:47:11,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 42 transitions. [2022-03-15 20:47:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:47:11,046 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:11,046 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:11,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:47:11,046 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash -340325469, now seen corresponding path program 2 times [2022-03-15 20:47:11,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:11,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440296208] [2022-03-15 20:47:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:11,078 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 20:47:11,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:11,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440296208] [2022-03-15 20:47:11,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440296208] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:11,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112615739] [2022-03-15 20:47:11,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:11,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:11,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:11,080 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 20:47:11,113 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 20:47:11,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:11,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:11,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:47:11,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:11,138 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 20:47:11,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:11,161 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 20:47:11,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112615739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:11,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:11,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 20:47:11,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2049485190] [2022-03-15 20:47:11,162 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:11,162 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:11,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:47:11,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:11,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [865#(or (< (+ i1 1) n) (<= n i1)), 864#(< i1 n), 866#(or (< (+ 2 i1) n) (<= n (+ i1 1)))] [2022-03-15 20:47:11,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:47:11,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:47:11,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:47:11,273 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:11,527 INFO L93 Difference]: Finished difference Result 48 states and 90 transitions. [2022-03-15 20:47:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:47:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:47:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:11,528 INFO L225 Difference]: With dead ends: 48 [2022-03-15 20:47:11,528 INFO L226 Difference]: Without dead ends: 45 [2022-03-15 20:47:11,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:47:11,529 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:11,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 1 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:47:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-15 20:47:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-03-15 20:47:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 66 transitions. [2022-03-15 20:47:11,533 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 66 transitions. Word has length 11 [2022-03-15 20:47:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:11,533 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 66 transitions. [2022-03-15 20:47:11,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 66 transitions. [2022-03-15 20:47:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:47:11,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:11,534 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:11,559 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 20:47:11,755 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 20:47:11,756 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1325009886, now seen corresponding path program 3 times [2022-03-15 20:47:11,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:11,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737588202] [2022-03-15 20:47:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:11,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:11,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737588202] [2022-03-15 20:47:11,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737588202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:11,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867732181] [2022-03-15 20:47:11,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:47:11,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:11,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:11,841 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 20:47:11,844 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 20:47:11,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:47:11,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:11,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:47:11,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:12,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:12,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 129 [2022-03-15 20:47:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:12,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:12,620 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:12,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 39 treesize of output 202 [2022-03-15 20:47:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:13,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867732181] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:13,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:13,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 20:47:13,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825328676] [2022-03-15 20:47:13,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:13,463 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:13,466 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:47:13,466 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:13,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1099#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)) (or (<= n i2) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1098#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 1092#(or (< i1 n) (= x2 x1)), 1094#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2))), 1093#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 1097#(and (or (<= n i2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f x1)) x2) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 1096#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 1095#(and (or (<= n i2) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))))] [2022-03-15 20:47:13,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:47:13,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:47:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:47:13,972 INFO L87 Difference]: Start difference. First operand 33 states and 66 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 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 20:47:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:14,498 INFO L93 Difference]: Finished difference Result 67 states and 145 transitions. [2022-03-15 20:47:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:47:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 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 12 [2022-03-15 20:47:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:14,499 INFO L225 Difference]: With dead ends: 67 [2022-03-15 20:47:14,499 INFO L226 Difference]: Without dead ends: 57 [2022-03-15 20:47:14,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:47:14,501 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:14,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 1 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:47:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-15 20:47:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-03-15 20:47:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 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 20:47:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2022-03-15 20:47:14,505 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 12 [2022-03-15 20:47:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:14,505 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2022-03-15 20:47:14,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 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 20:47:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2022-03-15 20:47:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:47:14,506 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:14,506 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:14,522 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 20:47:14,711 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 20:47:14,712 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1785455741, now seen corresponding path program 4 times [2022-03-15 20:47:14,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:14,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303190736] [2022-03-15 20:47:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:14,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:14,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303190736] [2022-03-15 20:47:14,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303190736] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:14,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253458353] [2022-03-15 20:47:14,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:47:14,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:14,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:14,848 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 20:47:14,849 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 20:47:14,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:47:14,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:14,870 WARN L261 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 20:47:14,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:15,066 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:15,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 23 treesize of output 64 [2022-03-15 20:47:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:15,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:15,667 INFO L353 Elim1Store]: treesize reduction 20, result has 93.1 percent of original size [2022-03-15 20:47:15,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 21 treesize of output 300 [2022-03-15 20:47:25,513 INFO L353 Elim1Store]: treesize reduction 15, result has 91.1 percent of original size [2022-03-15 20:47:25,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 17 treesize of output 177 [2022-03-15 20:47:28,116 INFO L353 Elim1Store]: treesize reduction 20, result has 91.1 percent of original size [2022-03-15 20:47:28,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 19 treesize of output 232 [2022-03-15 20:47:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:30,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253458353] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:30,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:30,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 20:47:30,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303446852] [2022-03-15 20:47:30,524 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:30,525 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:30,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:47:30,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:31,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1360#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 1358#(or (< i1 n) (= x2 x1)), 1362#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 1359#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2))) (or (< i1 n) (<= n (+ i2 1)))), 1361#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 1364#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n)) (or (<= n (+ i2 1)) (< (+ i1 1) n) (not (< i1 n)))), 1363#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 1367#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f x2))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ i2 1) n)) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= n (+ i2 1)))), 1366#(and (or (<= n (+ i2 1)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (<= (+ i2 1) n)) (or (= (select f (select f (select f x1))) (select f x2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1365#(and (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (<= (+ i2 1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f x2))) (or (<= n (+ i2 1)) (not (< (+ i1 1) n)) (< (+ 2 i1) n)))] [2022-03-15 20:47:31,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:47:31,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:47:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:47:31,300 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:34,390 INFO L93 Difference]: Finished difference Result 143 states and 300 transitions. [2022-03-15 20:47:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 20:47:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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 20:47:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:34,392 INFO L225 Difference]: With dead ends: 143 [2022-03-15 20:47:34,392 INFO L226 Difference]: Without dead ends: 115 [2022-03-15 20:47:34,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=656, Invalid=4036, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:47:34,395 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 107 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:34,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 1 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:47:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-03-15 20:47:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 62. [2022-03-15 20:47:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 139 transitions. [2022-03-15 20:47:34,400 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 139 transitions. Word has length 13 [2022-03-15 20:47:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:34,400 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 139 transitions. [2022-03-15 20:47:34,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 139 transitions. [2022-03-15 20:47:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:47:34,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:34,401 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:34,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:34,615 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 20:47:34,616 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1120591938, now seen corresponding path program 5 times [2022-03-15 20:47:34,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:34,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944468763] [2022-03-15 20:47:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:34,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:34,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944468763] [2022-03-15 20:47:34,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944468763] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:34,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912247222] [2022-03-15 20:47:34,736 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:47:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:34,738 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 20:47:34,750 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 20:47:34,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:47:34,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:34,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 20:47:34,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:35,028 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:35,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 129 [2022-03-15 20:47:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:35,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:35,688 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:35,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 74 treesize of output 413 [2022-03-15 20:48:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:25,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912247222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:25,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:25,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 20:48:25,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267849201] [2022-03-15 20:48:25,249 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:25,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:25,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:48:25,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:25,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1810#(and (or (< i1 n) (<= (+ 2 i2) n)) (or (< i1 n) (= (select f (select f x2)) x1))), 1809#(or (< i1 n) (= x2 x1)), 1818#(and (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f x2))) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ 2 i2) n))), 1814#(and (or (= (select f (select f x2)) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (<= (+ 2 i2) n) (< (+ 2 i1) n))), 1816#(and (or (<= (+ 2 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f x2)) (select f (select f (select f x1)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1813#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 1811#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 1815#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 1820#(and (or (not (< (+ i1 4) n)) (<= (+ 2 i2) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f x2)) (select f (select f (select f (select f (select f x1)))))) (< (+ 5 i1) n))), 1817#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 1819#(or (<= n (+ i1 4)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)), 1812#(and (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ 2 i2) n)) (or (= (select f (select f x2)) (select f x1)) (< (+ i1 1) n) (not (< i1 n))))] [2022-03-15 20:48:25,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:48:25,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:48:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1157, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:48:25,930 INFO L87 Difference]: Start difference. First operand 62 states and 139 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:28,904 INFO L93 Difference]: Finished difference Result 197 states and 416 transitions. [2022-03-15 20:48:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 20:48:28,904 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:48:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:28,906 INFO L225 Difference]: With dead ends: 197 [2022-03-15 20:48:28,906 INFO L226 Difference]: Without dead ends: 188 [2022-03-15 20:48:28,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=602, Invalid=4510, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 20:48:28,907 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 153 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:28,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:48:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-03-15 20:48:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 96. [2022-03-15 20:48:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.5052631578947366) internal successors, (238), 95 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 238 transitions. [2022-03-15 20:48:28,917 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 238 transitions. Word has length 14 [2022-03-15 20:48:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:28,917 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 238 transitions. [2022-03-15 20:48:28,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 238 transitions. [2022-03-15 20:48:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:48:28,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:28,919 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:28,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:29,131 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 20:48:29,132 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:29,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 378374323, now seen corresponding path program 6 times [2022-03-15 20:48:29,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:29,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912735547] [2022-03-15 20:48:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:29,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:29,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912735547] [2022-03-15 20:48:29,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912735547] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:29,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056212579] [2022-03-15 20:48:29,198 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:48:29,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:29,201 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 20:48:29,201 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 20:48:29,233 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:48:29,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:29,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:48:29,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:29,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:29,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056212579] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:29,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:29,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-03-15 20:48:29,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279770743] [2022-03-15 20:48:29,289 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:29,290 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:29,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:48:29,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:29,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2388#(or (<= n (+ 2 i2)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 2381#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 2383#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 2384#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 2379#(or (<= n (+ 2 i2)) (< i1 n)), 2378#(or (< (+ i1 1) n) (<= n i1)), 2380#(or (<= n (+ 2 i2)) (< (+ i1 1) n) (<= n i1)), 2386#(or (<= n (+ 2 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 2387#(or (<= n (+ 2 i2)) (< (+ i1 4) n) (<= n (+ 3 i1))), 2385#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 2382#(or (<= n (+ 2 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 2377#(< i1 n)] [2022-03-15 20:48:29,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:48:29,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:48:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:48:29,676 INFO L87 Difference]: Start difference. First operand 96 states and 238 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:31,578 INFO L93 Difference]: Finished difference Result 369 states and 880 transitions. [2022-03-15 20:48:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 20:48:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:48:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:31,581 INFO L225 Difference]: With dead ends: 369 [2022-03-15 20:48:31,581 INFO L226 Difference]: Without dead ends: 354 [2022-03-15 20:48:31,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3309 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2451, Invalid=6669, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 20:48:31,584 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 99 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:31,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:48:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-03-15 20:48:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 127. [2022-03-15 20:48:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.7301587301587302) internal successors, (344), 126 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 344 transitions. [2022-03-15 20:48:31,599 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 344 transitions. Word has length 15 [2022-03-15 20:48:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:31,606 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 344 transitions. [2022-03-15 20:48:31,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 344 transitions. [2022-03-15 20:48:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:48:31,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:31,608 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:31,628 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 20:48:31,819 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 20:48:31,820 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1013756771, now seen corresponding path program 7 times [2022-03-15 20:48:31,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:31,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044769610] [2022-03-15 20:48:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:31,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:31,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044769610] [2022-03-15 20:48:31,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044769610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:31,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527113233] [2022-03-15 20:48:31,903 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:48:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:31,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:31,904 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 20:48:31,905 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 20:48:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:31,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:48:31,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:31,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:31,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527113233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:31,987 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:31,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-03-15 20:48:31,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [879539272] [2022-03-15 20:48:31,987 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:31,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:31,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:48:31,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:32,332 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [3260#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (< (+ 2 i2) n)), 3258#(or (< (+ 2 i1) n) (<= n (+ i1 1)) (< (+ 2 i2) n)), 3265#(or (<= n (+ i1 4)) (< (+ 2 i2) n) (< (+ 5 i1) n)), 3255#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 3263#(or (<= n (+ 5 i1)) (< (+ 6 i1) n)), 3256#(or (< i1 n) (< (+ 2 i2) n)), 3264#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (< (+ 2 i2) n)), 3254#(or (< (+ i1 1) n) (<= n i1)), 3253#(< i1 n), 3259#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 3266#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (< (+ 2 i2) n)), 3262#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 3261#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 3257#(or (< (+ i1 1) n) (<= n i1) (< (+ 2 i2) n))] [2022-03-15 20:48:32,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:48:32,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:48:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:48:32,333 INFO L87 Difference]: Start difference. First operand 127 states and 344 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:33,692 INFO L93 Difference]: Finished difference Result 297 states and 720 transitions. [2022-03-15 20:48:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 20:48:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:48:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:33,694 INFO L225 Difference]: With dead ends: 297 [2022-03-15 20:48:33,694 INFO L226 Difference]: Without dead ends: 295 [2022-03-15 20:48:33,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1293, Invalid=4713, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 20:48:33,697 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 137 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:33,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 1 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:48:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-03-15 20:48:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 211. [2022-03-15 20:48:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.8523809523809525) internal successors, (599), 210 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 599 transitions. [2022-03-15 20:48:33,707 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 599 transitions. Word has length 15 [2022-03-15 20:48:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:33,707 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 599 transitions. [2022-03-15 20:48:33,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 599 transitions. [2022-03-15 20:48:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:48:33,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:33,709 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:33,732 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 20:48:33,923 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 20:48:33,923 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1361451442, now seen corresponding path program 8 times [2022-03-15 20:48:33,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:33,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291947797] [2022-03-15 20:48:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:34,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:34,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291947797] [2022-03-15 20:48:34,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291947797] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:34,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828432489] [2022-03-15 20:48:34,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:48:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:34,053 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 20:48:34,054 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 20:48:34,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:48:34,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:34,077 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:48:34,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:34,470 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:34,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 282 [2022-03-15 20:48:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:37,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:37,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:37,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 24 new quantified variables, introduced 78 case distinctions, treesize of input 63 treesize of output 682 [2022-03-15 20:50:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:11,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828432489] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:11,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:11,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:50:11,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [596132756] [2022-03-15 20:50:11,994 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:11,994 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:11,998 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:50:11,998 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:13,353 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [4231#(and (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)) (or (<= n i2) (not (< (+ i1 4) n)) (< (+ 5 i1) n))), 4233#(and (or (<= n i2) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (= x2 (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n) (not (< (+ 5 i1) n)))), 4224#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) x2)) (or (< (+ i1 4) n) (<= n i2) (not (< (+ 3 i1) n)))), 4225#(and (or (<= n (+ 3 i2)) (< i1 n)) (or (< i1 n) (= x1 (select f (select f (select f x2)))))), 4229#(and (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f (select f x2)))) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (<= n (+ 3 i2)) (not (< (+ 3 i1) n)))), 4218#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 4223#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)) (or (<= n i2) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 4232#(or (<= n (+ 5 i1)) (= x2 (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n)), 4234#(and (or (<= n (+ 3 i2)) (not (< (+ i1 4) n)) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f x2)))) (< (+ 5 i1) n))), 4221#(and (or (<= n i2) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n)))), 4227#(and (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f (select f (select f x2))))) (or (<= n (+ 3 i2)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 4220#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2))), 4217#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 4216#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 4228#(and (or (<= n (+ 3 i2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f x2)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 4222#(and (or (<= n i2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f x1)) x2) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 4226#(and (or (= (select f x1) (select f (select f (select f x2)))) (< (+ i1 1) n) (not (< i1 n))) (or (<= n (+ 3 i2)) (< (+ i1 1) n) (not (< i1 n)))), 4219#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 4235#(and (or (<= n (+ 3 i2)) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (< (+ 6 i1) n) (not (< (+ 5 i1) n)) (= (select f (select f (select f x2))) (select f (select f (select f (select f (select f (select f x1))))))))), 4215#(or (< i1 n) (= x2 x1)), 4230#(or (<= n (+ i1 4)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n))] [2022-03-15 20:50:13,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:50:13,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:50:13,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2692, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:50:13,355 INFO L87 Difference]: Start difference. First operand 211 states and 599 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:17,879 INFO L93 Difference]: Finished difference Result 563 states and 1535 transitions. [2022-03-15 20:50:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 20:50:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:50:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:17,882 INFO L225 Difference]: With dead ends: 563 [2022-03-15 20:50:17,882 INFO L226 Difference]: Without dead ends: 534 [2022-03-15 20:50:17,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=762, Invalid=6210, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 20:50:17,884 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 149 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:17,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 1 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:50:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-03-15 20:50:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 266. [2022-03-15 20:50:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.8377358490566036) internal successors, (752), 265 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 752 transitions. [2022-03-15 20:50:17,896 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 752 transitions. Word has length 16 [2022-03-15 20:50:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:17,896 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 752 transitions. [2022-03-15 20:50:17,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 752 transitions. [2022-03-15 20:50:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:50:17,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:17,897 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:17,915 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 20:50:18,103 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 20:50:18,103 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1572962542, now seen corresponding path program 9 times [2022-03-15 20:50:18,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:18,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945947696] [2022-03-15 20:50:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:18,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:18,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945947696] [2022-03-15 20:50:18,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945947696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:18,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033822639] [2022-03-15 20:50:18,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:50:18,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:18,162 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 20:50:18,163 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 20:50:18,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:50:18,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:18,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:50:18,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:18,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:18,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033822639] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:18,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:18,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-03-15 20:50:18,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338723903] [2022-03-15 20:50:18,265 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:18,266 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:18,269 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 20:50:18,269 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:18,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [5499#(or (<= n (+ 2 i2)) (<= (+ n 1) i1) (< (+ 5 i2) n)), 5502#(or (<= n (+ 2 i2)) (< (+ 5 i2) n) (<= n i1)), 5506#(or (<= n (+ i1 4)) (< (+ 2 i2) n)), 5503#(or (<= n (+ 2 i2)) (< (+ 5 i2) n) (<= n (+ i1 1))), 5501#(or (<= n (+ i1 1)) (< (+ 2 i2) n)), 5497#(or (<= (+ n 1) i1) (< (+ 2 i2) n)), 5509#(or (<= n (+ 2 i2)) (< (+ 5 i2) n) (<= n (+ i1 4))), 5507#(or (<= n (+ 2 i2)) (<= n (+ 2 i1)) (< (+ 5 i2) n)), 5505#(or (<= n (+ 3 i1)) (< (+ 2 i2) n)), 5496#(< (+ 2 i2) n), 5500#(or (<= n i1) (< (+ 2 i2) n)), 5498#(or (<= n (+ 2 i2)) (< (+ 5 i2) n)), 5504#(or (<= n (+ 2 i1)) (< (+ 2 i2) n)), 5508#(or (<= n (+ 2 i2)) (<= n (+ 3 i1)) (< (+ 5 i2) n))] [2022-03-15 20:50:18,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:50:18,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:18,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:50:18,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:50:18,720 INFO L87 Difference]: Start difference. First operand 266 states and 752 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:19,222 INFO L93 Difference]: Finished difference Result 347 states and 896 transitions. [2022-03-15 20:50:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 20:50:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:50:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:19,224 INFO L225 Difference]: With dead ends: 347 [2022-03-15 20:50:19,224 INFO L226 Difference]: Without dead ends: 322 [2022-03-15 20:50:19,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=734, Invalid=2128, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:50:19,225 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:19,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-15 20:50:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 279. [2022-03-15 20:50:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.758992805755396) internal successors, (767), 278 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 767 transitions. [2022-03-15 20:50:19,234 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 767 transitions. Word has length 16 [2022-03-15 20:50:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:19,234 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 767 transitions. [2022-03-15 20:50:19,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 767 transitions. [2022-03-15 20:50:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:50:19,235 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:19,235 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:19,262 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 20:50:19,451 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 20:50:19,451 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1772071059, now seen corresponding path program 10 times [2022-03-15 20:50:19,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:19,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614314311] [2022-03-15 20:50:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:19,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:19,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614314311] [2022-03-15 20:50:19,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614314311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:19,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011678178] [2022-03-15 20:50:19,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:50:19,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:19,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:19,620 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 20:50:19,621 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 20:50:19,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:50:19,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:19,645 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 20:50:19,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:20,019 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:50:20,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 35 treesize of output 193 [2022-03-15 20:50:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:21,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:22,652 INFO L353 Elim1Store]: treesize reduction 35, result has 95.2 percent of original size [2022-03-15 20:50:22,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 26 new quantified variables, introduced 91 case distinctions, treesize of input 31 treesize of output 745 [2022-03-15 20:53:59,286 INFO L353 Elim1Store]: treesize reduction 30, result has 95.2 percent of original size [2022-03-15 20:53:59,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 24 new quantified variables, introduced 78 case distinctions, treesize of input 29 treesize of output 642 Received shutdown request... [2022-03-15 21:00:36,977 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:00:36,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:00:37,005 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:00:37,005 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 21:00:37,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:00:37,188 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-2-20-2-7-2-6-2-5-2-4-2-8-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∨-3-1 context. [2022-03-15 21:00:37,189 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:00:37,189 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:00:37,191 INFO L732 BasicCegarLoop]: Path program histogram: [10, 3, 1, 1] [2022-03-15 21:00:37,193 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:00:37,193 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:00:37,195 INFO L202 PluginConnector]: Adding new model unroll-cond-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:00:37 BasicIcfg [2022-03-15 21:00:37,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:00:37,195 INFO L158 Benchmark]: Toolchain (without parser) took 812047.91ms. Allocated memory was 184.5MB in the beginning and 871.4MB in the end (delta: 686.8MB). Free memory was 144.2MB in the beginning and 790.6MB in the end (delta: -646.3MB). Peak memory consumption was 529.4MB. Max. memory is 8.0GB. [2022-03-15 21:00:37,195 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:00:37,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 184.5MB. Free memory was 144.2MB in the beginning and 142.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:00:37,196 INFO L158 Benchmark]: Boogie Preprocessor took 12.48ms. Allocated memory is still 184.5MB. Free memory was 142.7MB in the beginning and 141.7MB in the end (delta: 932.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:00:37,196 INFO L158 Benchmark]: RCFGBuilder took 304.39ms. Allocated memory is still 184.5MB. Free memory was 141.7MB in the beginning and 131.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 21:00:37,196 INFO L158 Benchmark]: TraceAbstraction took 811690.55ms. Allocated memory was 184.5MB in the beginning and 871.4MB in the end (delta: 686.8MB). Free memory was 130.6MB in the beginning and 790.6MB in the end (delta: -659.9MB). Peak memory consumption was 515.7MB. Max. memory is 8.0GB. [2022-03-15 21:00:37,197 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 184.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 184.5MB. Free memory was 144.2MB in the beginning and 142.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.48ms. Allocated memory is still 184.5MB. Free memory was 142.7MB in the beginning and 141.7MB in the end (delta: 932.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 304.39ms. Allocated memory is still 184.5MB. Free memory was 141.7MB in the beginning and 131.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 811690.55ms. Allocated memory was 184.5MB in the beginning and 871.4MB in the end (delta: 686.8MB). Free memory was 130.6MB in the beginning and 790.6MB in the end (delta: -659.9MB). Peak memory consumption was 515.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 18 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, 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: 61]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-2-20-2-7-2-6-2-5-2-4-2-8-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∨-3-1 context. - TimeoutResultAtElement [Line: 56]: 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 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-2-20-2-7-2-6-2-5-2-4-2-8-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∨-3-1 context. - TimeoutResultAtElement [Line: 56]: 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 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-2-20-2-7-2-6-2-5-2-4-2-8-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∨-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 22 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 811.6s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1289 mSDsCounter, 1047 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6527 IncrementalHoareTripleChecker+Invalid, 7574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1047 mSolverCounterUnsat, 14 mSDtfsCounter, 6527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 281 SyntacticMatches, 11 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9885 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=14, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 856 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 168.0s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 4460 SizeOfPredicates, 36 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 146/418 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