/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 21:50:36,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 21:50:36,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 21:50:36,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 21:50:36,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 21:50:36,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 21:50:36,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 21:50:36,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 21:50:36,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 21:50:36,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 21:50:36,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 21:50:36,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 21:50:36,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 21:50:36,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 21:50:36,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 21:50:36,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 21:50:36,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 21:50:36,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 21:50:36,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 21:50:36,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 21:50:36,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 21:50:36,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 21:50:36,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 21:50:36,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 21:50:36,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 21:50:36,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 21:50:36,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 21:50:36,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 21:50:36,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 21:50:36,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 21:50:36,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 21:50:36,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 21:50:36,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 21:50:36,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 21:50:36,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 21:50:36,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 21:50:36,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 21:50:36,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 21:50:36,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 21:50:36,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 21:50:36,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 21:50:36,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-03-10 21:50:36,636 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 21:50:36,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 21:50:36,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 21:50:36,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 21:50:36,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 21:50:36,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 21:50:36,640 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 21:50:36,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 21:50:36,640 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 21:50:36,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 21:50:36,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 21:50:36,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 21:50:36,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 21:50:36,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 21:50:36,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 21:50:36,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 21:50:36,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 21:50:36,642 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 21:50:36,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 21:50:36,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 21:50:36,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 21:50:36,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 21:50:36,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 21:50:36,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 21:50:36,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 21:50:36,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 21:50:36,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 21:50:36,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 21:50:36,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 21:50:36,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 21:50:36,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 21:50:36,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-03-10 21:50:36,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 21:50:36,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 21:50:36,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 21:50:36,972 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-10 21:50:36,973 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-10 21:50:36,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-trans.wvr.bpl [2021-03-10 21:50:36,974 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-trans.wvr.bpl' [2021-03-10 21:50:37,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 21:50:37,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-10 21:50:37,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 21:50:37,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 21:50:37,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 21:50:37,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 21:50:37,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 21:50:37,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 21:50:37,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 21:50:37,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... [2021-03-10 21:50:37,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 21:50:37,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 21:50:37,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 21:50:37,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 21:50:37,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 21:50:37,131 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-10 21:50:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-10 21:50:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-10 21:50:37,131 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-10 21:50:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-10 21:50:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-10 21:50:37,131 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-10 21:50:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 21:50:37,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 21:50:37,132 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-10 21:50:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-10 21:50:37,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-10 21:50:37,133 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 21:50:37,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 21:50:37,553 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-03-10 21:50:37,555 INFO L202 PluginConnector]: Adding new model chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 09:50:37 BoogieIcfgContainer [2021-03-10 21:50:37,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 21:50:37,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 21:50:37,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 21:50:37,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 21:50:37,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:50:37" (1/2) ... [2021-03-10 21:50:37,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6b7ac3 and model type chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 09:50:37, skipping insertion in model container [2021-03-10 21:50:37,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 09:50:37" (2/2) ... [2021-03-10 21:50:37,564 INFO L111 eAbstractionObserver]: Analyzing ICFG chromosome-trans.wvr.bpl [2021-03-10 21:50:37,568 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 21:50:37,568 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 21:50:37,575 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-10 21:50:37,576 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 21:50:37,646 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-03-10 21:50:37,660 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-10 21:50:37,675 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 21:50:37,675 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 21:50:37,675 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 21:50:37,676 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 21:50:37,676 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 21:50:37,676 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 21:50:37,676 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 21:50:37,676 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 21:50:37,683 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 25 transitions, 74 flow [2021-03-10 21:50:37,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (310), 109 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (310), 109 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-10 21:50:37,707 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:37,707 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:37,707 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 480470199, now seen corresponding path program 1 times [2021-03-10 21:50:37,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:37,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977949900] [2021-03-10 21:50:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:37,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977949900] [2021-03-10 21:50:37,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:37,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-10 21:50:37,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350337048] [2021-03-10 21:50:37,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:50:37,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:37,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:50:37,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:37,923 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (310), 109 states have internal predecessors, (310), 0 states have call successors, (0), 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 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:37,973 INFO L93 Difference]: Finished difference Result 194 states and 539 transitions. [2021-03-10 21:50:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-10 21:50:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-10 21:50:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:37,985 INFO L225 Difference]: With dead ends: 194 [2021-03-10 21:50:37,985 INFO L226 Difference]: Without dead ends: 178 [2021-03-10 21:50:37,987 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-03-10 21:50:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 114. [2021-03-10 21:50:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.8761061946902653) internal successors, (325), 113 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 325 transitions. [2021-03-10 21:50:38,037 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 325 transitions. Word has length 17 [2021-03-10 21:50:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,037 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 325 transitions. [2021-03-10 21:50:38,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 325 transitions. [2021-03-10 21:50:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-10 21:50:38,039 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,039 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 21:50:38,040 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1062696049, now seen corresponding path program 2 times [2021-03-10 21:50:38,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209344394] [2021-03-10 21:50:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:38,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209344394] [2021-03-10 21:50:38,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-10 21:50:38,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629374375] [2021-03-10 21:50:38,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:50:38,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:50:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:38,081 INFO L87 Difference]: Start difference. First operand 114 states and 325 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,099 INFO L93 Difference]: Finished difference Result 193 states and 552 transitions. [2021-03-10 21:50:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-10 21:50:38,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-10 21:50:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,102 INFO L225 Difference]: With dead ends: 193 [2021-03-10 21:50:38,102 INFO L226 Difference]: Without dead ends: 193 [2021-03-10 21:50:38,102 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-03-10 21:50:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 129. [2021-03-10 21:50:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.890625) internal successors, (370), 128 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 370 transitions. [2021-03-10 21:50:38,115 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 370 transitions. Word has length 17 [2021-03-10 21:50:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,115 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 370 transitions. [2021-03-10 21:50:38,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 370 transitions. [2021-03-10 21:50:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-10 21:50:38,117 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,117 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 21:50:38,117 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1198421705, now seen corresponding path program 3 times [2021-03-10 21:50:38,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079106072] [2021-03-10 21:50:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:38,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079106072] [2021-03-10 21:50:38,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-10 21:50:38,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154136567] [2021-03-10 21:50:38,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:50:38,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:50:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:38,184 INFO L87 Difference]: Start difference. First operand 129 states and 370 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,221 INFO L93 Difference]: Finished difference Result 238 states and 687 transitions. [2021-03-10 21:50:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-10 21:50:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-10 21:50:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,224 INFO L225 Difference]: With dead ends: 238 [2021-03-10 21:50:38,224 INFO L226 Difference]: Without dead ends: 238 [2021-03-10 21:50:38,224 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-03-10 21:50:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 149. [2021-03-10 21:50:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.939189189189189) internal successors, (435), 148 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 435 transitions. [2021-03-10 21:50:38,238 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 435 transitions. Word has length 17 [2021-03-10 21:50:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,238 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 435 transitions. [2021-03-10 21:50:38,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 435 transitions. [2021-03-10 21:50:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-10 21:50:38,246 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,247 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 21:50:38,247 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2134989050, now seen corresponding path program 1 times [2021-03-10 21:50:38,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237200814] [2021-03-10 21:50:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:38,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237200814] [2021-03-10 21:50:38,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-10 21:50:38,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719394132] [2021-03-10 21:50:38,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:50:38,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:50:38,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:38,341 INFO L87 Difference]: Start difference. First operand 149 states and 435 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2021-03-10 21:50:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,358 INFO L93 Difference]: Finished difference Result 237 states and 697 transitions. [2021-03-10 21:50:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 21:50:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 18 [2021-03-10 21:50:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,361 INFO L225 Difference]: With dead ends: 237 [2021-03-10 21:50:38,361 INFO L226 Difference]: Without dead ends: 178 [2021-03-10 21:50:38,362 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:50:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-03-10 21:50:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-03-10 21:50:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 2.9491525423728815) internal successors, (522), 177 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 522 transitions. [2021-03-10 21:50:38,381 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 522 transitions. Word has length 18 [2021-03-10 21:50:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,381 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 522 transitions. [2021-03-10 21:50:38,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2021-03-10 21:50:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 522 transitions. [2021-03-10 21:50:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:38,382 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,382 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 21:50:38,383 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash 479941677, now seen corresponding path program 1 times [2021-03-10 21:50:38,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692487580] [2021-03-10 21:50:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:38,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692487580] [2021-03-10 21:50:38,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:38,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277495762] [2021-03-10 21:50:38,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:38,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:38,434 INFO L87 Difference]: Start difference. First operand 178 states and 522 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,475 INFO L93 Difference]: Finished difference Result 199 states and 585 transitions. [2021-03-10 21:50:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,479 INFO L225 Difference]: With dead ends: 199 [2021-03-10 21:50:38,479 INFO L226 Difference]: Without dead ends: 199 [2021-03-10 21:50:38,479 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-10 21:50:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-03-10 21:50:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-03-10 21:50:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9545454545454546) internal successors, (585), 198 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 585 transitions. [2021-03-10 21:50:38,492 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 585 transitions. Word has length 19 [2021-03-10 21:50:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,493 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 585 transitions. [2021-03-10 21:50:38,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 585 transitions. [2021-03-10 21:50:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:38,494 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,494 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 21:50:38,494 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash -727237863, now seen corresponding path program 2 times [2021-03-10 21:50:38,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453345148] [2021-03-10 21:50:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:38,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453345148] [2021-03-10 21:50:38,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:38,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948253459] [2021-03-10 21:50:38,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:38,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:38,538 INFO L87 Difference]: Start difference. First operand 199 states and 585 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,606 INFO L93 Difference]: Finished difference Result 303 states and 870 transitions. [2021-03-10 21:50:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:38,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,610 INFO L225 Difference]: With dead ends: 303 [2021-03-10 21:50:38,610 INFO L226 Difference]: Without dead ends: 303 [2021-03-10 21:50:38,610 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-10 21:50:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-03-10 21:50:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 206. [2021-03-10 21:50:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.9902439024390244) internal successors, (613), 205 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 613 transitions. [2021-03-10 21:50:38,618 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 613 transitions. Word has length 19 [2021-03-10 21:50:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,618 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 613 transitions. [2021-03-10 21:50:38,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 613 transitions. [2021-03-10 21:50:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:38,620 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,620 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 21:50:38,621 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2087010031, now seen corresponding path program 3 times [2021-03-10 21:50:38,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173772348] [2021-03-10 21:50:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:38,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173772348] [2021-03-10 21:50:38,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:38,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122925409] [2021-03-10 21:50:38,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:38,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:38,669 INFO L87 Difference]: Start difference. First operand 206 states and 613 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,717 INFO L93 Difference]: Finished difference Result 219 states and 632 transitions. [2021-03-10 21:50:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:38,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,719 INFO L225 Difference]: With dead ends: 219 [2021-03-10 21:50:38,719 INFO L226 Difference]: Without dead ends: 206 [2021-03-10 21:50:38,720 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-10 21:50:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-03-10 21:50:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-03-10 21:50:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.9560975609756097) internal successors, (606), 205 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 606 transitions. [2021-03-10 21:50:38,727 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 606 transitions. Word has length 19 [2021-03-10 21:50:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,728 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 606 transitions. [2021-03-10 21:50:38,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 606 transitions. [2021-03-10 21:50:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:38,729 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,729 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 21:50:38,729 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1343541745, now seen corresponding path program 4 times [2021-03-10 21:50:38,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304594688] [2021-03-10 21:50:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:38,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304594688] [2021-03-10 21:50:38,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:38,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446309531] [2021-03-10 21:50:38,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:38,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:38,784 INFO L87 Difference]: Start difference. First operand 206 states and 606 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,849 INFO L93 Difference]: Finished difference Result 301 states and 859 transitions. [2021-03-10 21:50:38,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:38,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,852 INFO L225 Difference]: With dead ends: 301 [2021-03-10 21:50:38,852 INFO L226 Difference]: Without dead ends: 301 [2021-03-10 21:50:38,853 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-10 21:50:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-03-10 21:50:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 214. [2021-03-10 21:50:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.995305164319249) internal successors, (638), 213 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2021-03-10 21:50:38,862 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2021-03-10 21:50:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,862 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2021-03-10 21:50:38,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2021-03-10 21:50:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:38,863 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,864 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 21:50:38,864 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash -16230423, now seen corresponding path program 5 times [2021-03-10 21:50:38,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898542725] [2021-03-10 21:50:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:38,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898542725] [2021-03-10 21:50:38,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:38,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:38,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952881021] [2021-03-10 21:50:38,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:38,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:38,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:38,899 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:38,951 INFO L93 Difference]: Finished difference Result 314 states and 878 transitions. [2021-03-10 21:50:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:38,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:38,954 INFO L225 Difference]: With dead ends: 314 [2021-03-10 21:50:38,954 INFO L226 Difference]: Without dead ends: 301 [2021-03-10 21:50:38,955 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-10 21:50:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-03-10 21:50:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 207. [2021-03-10 21:50:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.9611650485436893) internal successors, (610), 206 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 610 transitions. [2021-03-10 21:50:38,967 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 610 transitions. Word has length 19 [2021-03-10 21:50:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:38,967 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 610 transitions. [2021-03-10 21:50:38,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 610 transitions. [2021-03-10 21:50:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:38,968 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:38,968 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:38,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 21:50:38,969 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1056854957, now seen corresponding path program 6 times [2021-03-10 21:50:38,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:38,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772094278] [2021-03-10 21:50:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:39,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772094278] [2021-03-10 21:50:39,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:39,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:39,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135880544] [2021-03-10 21:50:39,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:39,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:39,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:39,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:39,024 INFO L87 Difference]: Start difference. First operand 207 states and 610 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:39,048 INFO L93 Difference]: Finished difference Result 231 states and 656 transitions. [2021-03-10 21:50:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:39,050 INFO L225 Difference]: With dead ends: 231 [2021-03-10 21:50:39,054 INFO L226 Difference]: Without dead ends: 195 [2021-03-10 21:50:39,054 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-10 21:50:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-03-10 21:50:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-03-10 21:50:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.922680412371134) internal successors, (567), 194 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 567 transitions. [2021-03-10 21:50:39,060 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 567 transitions. Word has length 19 [2021-03-10 21:50:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:39,060 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 567 transitions. [2021-03-10 21:50:39,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 567 transitions. [2021-03-10 21:50:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:39,061 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:39,061 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:39,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 21:50:39,061 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash 3917895, now seen corresponding path program 1 times [2021-03-10 21:50:39,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:39,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492818429] [2021-03-10 21:50:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:39,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492818429] [2021-03-10 21:50:39,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:39,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:39,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7238156] [2021-03-10 21:50:39,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:39,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:39,108 INFO L87 Difference]: Start difference. First operand 195 states and 567 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:39,143 INFO L93 Difference]: Finished difference Result 213 states and 621 transitions. [2021-03-10 21:50:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:50:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:39,145 INFO L225 Difference]: With dead ends: 213 [2021-03-10 21:50:39,145 INFO L226 Difference]: Without dead ends: 213 [2021-03-10 21:50:39,145 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-10 21:50:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-03-10 21:50:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2021-03-10 21:50:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.9202127659574466) internal successors, (549), 188 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 549 transitions. [2021-03-10 21:50:39,151 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 549 transitions. Word has length 19 [2021-03-10 21:50:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:39,151 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 549 transitions. [2021-03-10 21:50:39,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 549 transitions. [2021-03-10 21:50:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:50:39,153 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:39,153 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:39,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 21:50:39,153 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash 591663217, now seen corresponding path program 2 times [2021-03-10 21:50:39,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:39,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790659236] [2021-03-10 21:50:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-10 21:50:39,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790659236] [2021-03-10 21:50:39,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:50:39,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-10 21:50:39,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056474246] [2021-03-10 21:50:39,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:50:39,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:50:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:50:39,215 INFO L87 Difference]: Start difference. First operand 189 states and 549 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:39,249 INFO L93 Difference]: Finished difference Result 231 states and 675 transitions. [2021-03-10 21:50:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-10 21:50:39,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-03-10 21:50:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:39,251 INFO L225 Difference]: With dead ends: 231 [2021-03-10 21:50:39,251 INFO L226 Difference]: Without dead ends: 231 [2021-03-10 21:50:39,252 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-10 21:50:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-03-10 21:50:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 189. [2021-03-10 21:50:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.9202127659574466) internal successors, (549), 188 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 549 transitions. [2021-03-10 21:50:39,258 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 549 transitions. Word has length 19 [2021-03-10 21:50:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:39,258 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 549 transitions. [2021-03-10 21:50:39,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-03-10 21:50:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 549 transitions. [2021-03-10 21:50:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:39,260 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:39,260 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:39,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 21:50:39,260 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1066078798, now seen corresponding path program 1 times [2021-03-10 21:50:39,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:39,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518605408] [2021-03-10 21:50:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:39,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518605408] [2021-03-10 21:50:39,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700854374] [2021-03-10 21:50:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:39,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:39,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:39,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:39,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:39,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:50:39,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:39,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:39,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:39,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:39,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:39,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:39,863 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:63 [2021-03-10 21:50:40,215 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_3], 1=[o_2, v_prenex_2]} [2021-03-10 21:50:40,220 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:40,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:40,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:40,250 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:40,254 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:40,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:40,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:40,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:40,293 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:40,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:40,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:40,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:40,319 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:40,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:40,341 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:40,341 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:27 [2021-03-10 21:50:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:40,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:40,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:40,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9969527] [2021-03-10 21:50:40,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:40,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:40,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:40,434 INFO L87 Difference]: Start difference. First operand 189 states and 549 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:41,659 INFO L93 Difference]: Finished difference Result 435 states and 1273 transitions. [2021-03-10 21:50:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:50:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:41,663 INFO L225 Difference]: With dead ends: 435 [2021-03-10 21:50:41,663 INFO L226 Difference]: Without dead ends: 420 [2021-03-10 21:50:41,663 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 953.1ms TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2021-03-10 21:50:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-03-10 21:50:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 211. [2021-03-10 21:50:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.9047619047619047) internal successors, (610), 210 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 610 transitions. [2021-03-10 21:50:41,672 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 610 transitions. Word has length 20 [2021-03-10 21:50:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:41,673 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 610 transitions. [2021-03-10 21:50:41,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 610 transitions. [2021-03-10 21:50:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:41,674 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:41,674 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:41,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-03-10 21:50:41,887 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash -876621394, now seen corresponding path program 2 times [2021-03-10 21:50:41,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:41,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160532897] [2021-03-10 21:50:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:42,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160532897] [2021-03-10 21:50:42,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547322544] [2021-03-10 21:50:42,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:42,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:50:42,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:42,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:50:42,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:42,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:50:42,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:42,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:42,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:42,291 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2021-03-10 21:50:42,488 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_6], 1=[o_2, v_prenex_5]} [2021-03-10 21:50:42,493 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:42,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,498 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:42,499 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:42,563 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:42,565 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,573 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:42,574 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:42,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:42,631 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:42,642 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:42,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:42,708 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:42,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:42,712 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:42,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:42,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:50:42,770 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:173, output treesize:73 [2021-03-10 21:50:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:42,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:42,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:42,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904104123] [2021-03-10 21:50:42,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:42,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:42,904 INFO L87 Difference]: Start difference. First operand 211 states and 610 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:43,983 INFO L93 Difference]: Finished difference Result 356 states and 1039 transitions. [2021-03-10 21:50:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 21:50:43,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:43,986 INFO L225 Difference]: With dead ends: 356 [2021-03-10 21:50:43,986 INFO L226 Difference]: Without dead ends: 341 [2021-03-10 21:50:43,986 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 833.3ms TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2021-03-10 21:50:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-03-10 21:50:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 217. [2021-03-10 21:50:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.912037037037037) internal successors, (629), 216 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 629 transitions. [2021-03-10 21:50:43,994 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 629 transitions. Word has length 20 [2021-03-10 21:50:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:43,994 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 629 transitions. [2021-03-10 21:50:43,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 629 transitions. [2021-03-10 21:50:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:43,995 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:43,996 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:44,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-03-10 21:50:44,218 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1378412730, now seen corresponding path program 3 times [2021-03-10 21:50:44,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:44,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000378861] [2021-03-10 21:50:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:44,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000378861] [2021-03-10 21:50:44,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162199424] [2021-03-10 21:50:44,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:44,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:50:44,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:44,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:50:44,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:44,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:50:44,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:44,573 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,594 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:44,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:44,597 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2021-03-10 21:50:44,677 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_9, o_4], 1=[v_prenex_8, o_2]} [2021-03-10 21:50:44,682 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:44,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,687 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:44,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:44,753 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:44,756 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,764 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:44,769 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:44,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:44,831 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:44,843 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:44,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:44,914 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:44,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:44,918 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:44,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:44,981 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:50:44,982 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:193, output treesize:85 [2021-03-10 21:50:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:45,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:45,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:45,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137934673] [2021-03-10 21:50:45,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:45,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:45,197 INFO L87 Difference]: Start difference. First operand 217 states and 629 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:46,146 INFO L93 Difference]: Finished difference Result 362 states and 1052 transitions. [2021-03-10 21:50:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 21:50:46,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:46,148 INFO L225 Difference]: With dead ends: 362 [2021-03-10 21:50:46,148 INFO L226 Difference]: Without dead ends: 347 [2021-03-10 21:50:46,149 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 825.8ms TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2021-03-10 21:50:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-03-10 21:50:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 215. [2021-03-10 21:50:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.9065420560747666) internal successors, (622), 214 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 622 transitions. [2021-03-10 21:50:46,156 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 622 transitions. Word has length 20 [2021-03-10 21:50:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:46,156 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 622 transitions. [2021-03-10 21:50:46,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 622 transitions. [2021-03-10 21:50:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:46,157 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:46,157 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:46,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-03-10 21:50:46,380 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 809770446, now seen corresponding path program 4 times [2021-03-10 21:50:46,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:46,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842375671] [2021-03-10 21:50:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:46,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842375671] [2021-03-10 21:50:46,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816103899] [2021-03-10 21:50:46,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:46,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:50:46,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:46,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:46,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:46,682 INFO L388 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 26 treesize of output 20 [2021-03-10 21:50:46,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:46,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:46,688 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:46,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:46,706 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:46,706 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:59 [2021-03-10 21:50:46,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:46,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:46,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:50:46,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:46,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:46,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:46,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:46,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:46,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:46,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:46,798 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:46,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:46,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:46,802 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:46,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:46,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:46,822 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:33 [2021-03-10 21:50:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:46,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:46,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:46,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989314419] [2021-03-10 21:50:46,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:46,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:46,956 INFO L87 Difference]: Start difference. First operand 215 states and 622 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:47,827 INFO L93 Difference]: Finished difference Result 383 states and 1103 transitions. [2021-03-10 21:50:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:50:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:47,829 INFO L225 Difference]: With dead ends: 383 [2021-03-10 21:50:47,829 INFO L226 Difference]: Without dead ends: 353 [2021-03-10 21:50:47,830 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 764.7ms TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2021-03-10 21:50:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-03-10 21:50:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 227. [2021-03-10 21:50:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.911504424778761) internal successors, (658), 226 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 658 transitions. [2021-03-10 21:50:47,838 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 658 transitions. Word has length 20 [2021-03-10 21:50:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:47,838 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 658 transitions. [2021-03-10 21:50:47,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 658 transitions. [2021-03-10 21:50:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:47,839 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:47,839 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:48,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:48,062 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1389597972, now seen corresponding path program 5 times [2021-03-10 21:50:48,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:48,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776171032] [2021-03-10 21:50:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:48,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776171032] [2021-03-10 21:50:48,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936844832] [2021-03-10 21:50:48,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:48,232 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:50:48,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:48,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:48,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:48,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:48,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:48,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:48,289 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:48,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:48,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:48,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:48,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:48,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:48,321 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:67 [2021-03-10 21:50:48,713 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_14], 1=[o_2, v_prenex_13]} [2021-03-10 21:50:48,716 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:48,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:48,734 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:48,736 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:48,737 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:48,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:48,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:48,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:48,755 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:48,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:48,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:48,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:48,772 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:48,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:48,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:48,787 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:27 [2021-03-10 21:50:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:48,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:48,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:48,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764184013] [2021-03-10 21:50:48,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:48,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:48,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:48,845 INFO L87 Difference]: Start difference. First operand 227 states and 658 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:50,037 INFO L93 Difference]: Finished difference Result 589 states and 1705 transitions. [2021-03-10 21:50:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 21:50:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:50,040 INFO L225 Difference]: With dead ends: 589 [2021-03-10 21:50:50,040 INFO L226 Difference]: Without dead ends: 559 [2021-03-10 21:50:50,041 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1099.1ms TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2021-03-10 21:50:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-03-10 21:50:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 241. [2021-03-10 21:50:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.995833333333333) internal successors, (719), 240 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 719 transitions. [2021-03-10 21:50:50,050 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 719 transitions. Word has length 20 [2021-03-10 21:50:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:50,051 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 719 transitions. [2021-03-10 21:50:50,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 719 transitions. [2021-03-10 21:50:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:50,052 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:50,052 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:50,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-03-10 21:50:50,267 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash 780645038, now seen corresponding path program 6 times [2021-03-10 21:50:50,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:50,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653487188] [2021-03-10 21:50:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:50,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653487188] [2021-03-10 21:50:50,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688254140] [2021-03-10 21:50:50,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:50,476 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:50:50,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:50,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:50,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:50,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:50,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:50,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:50,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:50,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:50,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:50,644 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:50,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:50,687 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:50,687 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:50:51,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:51,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:50:51,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:51,501 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:51,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:51,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:51,507 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:51,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:51,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:51,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:51,541 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:51,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:51,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:51,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:51,569 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:51,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:51,594 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:51,594 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:89, output treesize:27 [2021-03-10 21:50:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:51,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:51,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:51,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033135401] [2021-03-10 21:50:51,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:51,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:51,672 INFO L87 Difference]: Start difference. First operand 241 states and 719 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:52,260 INFO L93 Difference]: Finished difference Result 400 states and 1178 transitions. [2021-03-10 21:50:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:50:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:52,262 INFO L225 Difference]: With dead ends: 400 [2021-03-10 21:50:52,262 INFO L226 Difference]: Without dead ends: 385 [2021-03-10 21:50:52,263 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 653.5ms TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:50:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-03-10 21:50:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 247. [2021-03-10 21:50:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 3.016260162601626) internal successors, (742), 246 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 742 transitions. [2021-03-10 21:50:52,270 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 742 transitions. Word has length 20 [2021-03-10 21:50:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:52,270 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 742 transitions. [2021-03-10 21:50:52,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 742 transitions. [2021-03-10 21:50:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:52,271 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:52,271 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:52,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:52,493 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 278853702, now seen corresponding path program 7 times [2021-03-10 21:50:52,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:52,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45113142] [2021-03-10 21:50:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:52,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45113142] [2021-03-10 21:50:52,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078936411] [2021-03-10 21:50:52,623 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:52,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:52,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:52,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:52,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:52,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:52,797 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:52,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:52,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:52,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:52,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:52,842 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:52,843 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:50:53,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:53,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:53,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:53,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:53,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:53,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:50:53,235 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:53,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:53,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:53,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:53,268 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:53,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:53,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:53,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:50:53,300 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:53,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:53,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:53,329 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:99, output treesize:33 [2021-03-10 21:50:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:53,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:53,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:53,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622775153] [2021-03-10 21:50:53,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:53,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:53,440 INFO L87 Difference]: Start difference. First operand 247 states and 742 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:53,857 INFO L93 Difference]: Finished difference Result 339 states and 989 transitions. [2021-03-10 21:50:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:50:53,858 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:53,860 INFO L225 Difference]: With dead ends: 339 [2021-03-10 21:50:53,860 INFO L226 Difference]: Without dead ends: 324 [2021-03-10 21:50:53,860 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 399.1ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:50:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-03-10 21:50:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245. [2021-03-10 21:50:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 3.012295081967213) internal successors, (735), 244 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 735 transitions. [2021-03-10 21:50:53,868 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 735 transitions. Word has length 20 [2021-03-10 21:50:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:53,868 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 735 transitions. [2021-03-10 21:50:53,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 735 transitions. [2021-03-10 21:50:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:53,869 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:53,869 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:54,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:54,084 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1252991442, now seen corresponding path program 8 times [2021-03-10 21:50:54,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:54,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157271526] [2021-03-10 21:50:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:54,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157271526] [2021-03-10 21:50:54,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174041115] [2021-03-10 21:50:54,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:54,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:50:54,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:54,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:54,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:54,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:54,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:54,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:54,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:54,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:54,481 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:54,481 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:50:54,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:54,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:54,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:54,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:54,912 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:54,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:54,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:54,954 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:54,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:54,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:54,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:54,991 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:55,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:55,024 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:55,024 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:97, output treesize:41 [2021-03-10 21:50:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:55,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:55,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:55,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858082580] [2021-03-10 21:50:55,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:55,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:55,131 INFO L87 Difference]: Start difference. First operand 245 states and 735 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:55,748 INFO L93 Difference]: Finished difference Result 401 states and 1193 transitions. [2021-03-10 21:50:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:50:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:55,751 INFO L225 Difference]: With dead ends: 401 [2021-03-10 21:50:55,751 INFO L226 Difference]: Without dead ends: 386 [2021-03-10 21:50:55,751 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 637.6ms TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:50:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-03-10 21:50:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 242. [2021-03-10 21:50:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 3.004149377593361) internal successors, (724), 241 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 724 transitions. [2021-03-10 21:50:55,759 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 724 transitions. Word has length 20 [2021-03-10 21:50:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:55,759 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 724 transitions. [2021-03-10 21:50:55,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 724 transitions. [2021-03-10 21:50:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:55,760 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:55,760 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:55,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable180 [2021-03-10 21:50:55,975 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 251310436, now seen corresponding path program 9 times [2021-03-10 21:50:55,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:55,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301696883] [2021-03-10 21:50:55,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:56,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301696883] [2021-03-10 21:50:56,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313027699] [2021-03-10 21:50:56,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:56,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:50:56,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:56,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:56,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:56,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:56,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:56,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:56,290 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:56,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:56,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:56,329 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:83 [2021-03-10 21:50:56,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:56,435 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:56,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:56,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:56,476 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:56,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:56,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:56,516 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:56,547 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:56,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:56,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:56,552 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:56,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:56,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:56,585 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:41 [2021-03-10 21:50:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:56,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:56,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:56,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084965757] [2021-03-10 21:50:56,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:56,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:56,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:56,729 INFO L87 Difference]: Start difference. First operand 242 states and 724 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:57,224 INFO L93 Difference]: Finished difference Result 438 states and 1282 transitions. [2021-03-10 21:50:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:50:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:57,226 INFO L225 Difference]: With dead ends: 438 [2021-03-10 21:50:57,226 INFO L226 Difference]: Without dead ends: 408 [2021-03-10 21:50:57,227 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 439.2ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:50:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-03-10 21:50:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 241. [2021-03-10 21:50:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.995833333333333) internal successors, (719), 240 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 719 transitions. [2021-03-10 21:50:57,233 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 719 transitions. Word has length 20 [2021-03-10 21:50:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:57,233 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 719 transitions. [2021-03-10 21:50:57,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 719 transitions. [2021-03-10 21:50:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:57,234 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:57,234 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:57,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:57,447 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1438632468, now seen corresponding path program 10 times [2021-03-10 21:50:57,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:57,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786096562] [2021-03-10 21:50:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:57,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786096562] [2021-03-10 21:50:57,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042645461] [2021-03-10 21:50:57,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:57,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:50:57,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:57,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:57,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:50:57,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:57,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:57,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:57,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:57,826 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:57,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:57,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:50:57,863 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:50:57,942 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:50:57,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:57,948 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:57,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:50:57,953 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:57,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:57,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:57,995 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:57,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:50:57,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:50:57,999 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:58,028 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:58,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:58,030 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:41 [2021-03-10 21:50:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:58,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:58,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:50:58,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687967120] [2021-03-10 21:50:58,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:50:58,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:50:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:50:58,164 INFO L87 Difference]: Start difference. First operand 241 states and 719 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:50:58,773 INFO L93 Difference]: Finished difference Result 378 states and 1125 transitions. [2021-03-10 21:50:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:50:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:50:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:50:58,776 INFO L225 Difference]: With dead ends: 378 [2021-03-10 21:50:58,776 INFO L226 Difference]: Without dead ends: 363 [2021-03-10 21:50:58,776 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 633.1ms TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:50:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-03-10 21:50:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 241. [2021-03-10 21:50:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.995833333333333) internal successors, (719), 240 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:50:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 719 transitions. [2021-03-10 21:50:58,783 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 719 transitions. Word has length 20 [2021-03-10 21:50:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:50:58,783 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 719 transitions. [2021-03-10 21:50:58,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:50:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 719 transitions. [2021-03-10 21:50:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:50:58,784 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:50:58,784 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:50:59,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable201 [2021-03-10 21:50:59,006 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:50:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:50:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -314612260, now seen corresponding path program 11 times [2021-03-10 21:50:59,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:50:59,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819163892] [2021-03-10 21:50:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:50:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:50:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:59,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819163892] [2021-03-10 21:50:59,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768377648] [2021-03-10 21:50:59,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:50:59,149 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:50:59,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:50:59,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:50:59,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:50:59,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:59,179 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:59,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:50:59,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:59,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:59,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:59,201 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:50:59,331 INFO L388 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 21 treesize of output 17 [2021-03-10 21:50:59,333 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:59,335 INFO L388 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 30 treesize of output 24 [2021-03-10 21:50:59,336 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:50:59,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:50:59,347 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:50:59,347 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:50:59,347 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:50:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:50:59,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:50:59,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:50:59,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339143927] [2021-03-10 21:50:59,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:50:59,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:50:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:50:59,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:50:59,412 INFO L87 Difference]: Start difference. First operand 241 states and 719 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:00,042 INFO L93 Difference]: Finished difference Result 456 states and 1339 transitions. [2021-03-10 21:51:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:51:00,042 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:00,044 INFO L225 Difference]: With dead ends: 456 [2021-03-10 21:51:00,044 INFO L226 Difference]: Without dead ends: 426 [2021-03-10 21:51:00,044 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 513.2ms TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:51:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-03-10 21:51:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 245. [2021-03-10 21:51:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.9959016393442623) internal successors, (731), 244 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 731 transitions. [2021-03-10 21:51:00,049 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 731 transitions. Word has length 20 [2021-03-10 21:51:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:00,050 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 731 transitions. [2021-03-10 21:51:00,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 731 transitions. [2021-03-10 21:51:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:00,050 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:00,050 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:00,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable210 [2021-03-10 21:51:00,256 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1996748574, now seen corresponding path program 12 times [2021-03-10 21:51:00,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:00,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911622922] [2021-03-10 21:51:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:00,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911622922] [2021-03-10 21:51:00,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842986036] [2021-03-10 21:51:00,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:00,389 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:51:00,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:00,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:00,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:00,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:00,434 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:00,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:00,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:00,458 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:00,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:00,459 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:51:00,546 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:00,549 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:00,552 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:00,556 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:00,559 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:00,561 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:00,564 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:00,565 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:00,599 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:00,600 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:00,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:00,601 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:73 [2021-03-10 21:51:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:00,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:00,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:00,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627623933] [2021-03-10 21:51:00,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:00,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:00,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:00,694 INFO L87 Difference]: Start difference. First operand 245 states and 731 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:01,078 INFO L93 Difference]: Finished difference Result 326 states and 964 transitions. [2021-03-10 21:51:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:51:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:01,080 INFO L225 Difference]: With dead ends: 326 [2021-03-10 21:51:01,080 INFO L226 Difference]: Without dead ends: 311 [2021-03-10 21:51:01,080 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 340.7ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-03-10 21:51:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 252. [2021-03-10 21:51:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 3.00398406374502) internal successors, (754), 251 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 754 transitions. [2021-03-10 21:51:01,086 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 754 transitions. Word has length 20 [2021-03-10 21:51:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:01,086 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 754 transitions. [2021-03-10 21:51:01,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 754 transitions. [2021-03-10 21:51:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:01,087 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:01,087 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:01,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:01,310 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:01,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2032800900, now seen corresponding path program 13 times [2021-03-10 21:51:01,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:01,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745687684] [2021-03-10 21:51:01,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:01,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745687684] [2021-03-10 21:51:01,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467052079] [2021-03-10 21:51:01,426 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:01,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:01,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:01,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:01,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:01,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:01,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:01,532 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:01,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:01,533 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:51:01,577 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:01,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:01,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:01,603 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:01,604 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:01,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:01,625 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:01,625 INFO L518 ElimStorePlain]: Eliminatee v_prenex_49 vanished before elimination [2021-03-10 21:51:01,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:01,626 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2021-03-10 21:51:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:01,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:01,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:01,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216643063] [2021-03-10 21:51:01,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:01,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:01,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:01,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:01,729 INFO L87 Difference]: Start difference. First operand 252 states and 754 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:01,974 INFO L93 Difference]: Finished difference Result 338 states and 998 transitions. [2021-03-10 21:51:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:01,977 INFO L225 Difference]: With dead ends: 338 [2021-03-10 21:51:01,977 INFO L226 Difference]: Without dead ends: 323 [2021-03-10 21:51:01,977 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 247.4ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-03-10 21:51:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 249. [2021-03-10 21:51:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.995967741935484) internal successors, (743), 248 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 743 transitions. [2021-03-10 21:51:01,992 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 743 transitions. Word has length 20 [2021-03-10 21:51:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:01,992 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 743 transitions. [2021-03-10 21:51:01,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 743 transitions. [2021-03-10 21:51:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:01,994 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:01,994 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:02,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable224 [2021-03-10 21:51:02,215 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash -115995636, now seen corresponding path program 14 times [2021-03-10 21:51:02,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:02,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680820801] [2021-03-10 21:51:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:02,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680820801] [2021-03-10 21:51:02,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137933969] [2021-03-10 21:51:02,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:02,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:02,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:02,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:02,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:02,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:02,392 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:02,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:02,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:02,397 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:51:02,416 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:02,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:02,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:02,422 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:02,423 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:02,423 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2021-03-10 21:51:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:02,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:02,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 21:51:02,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827824429] [2021-03-10 21:51:02,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 21:51:02,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 21:51:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:51:02,438 INFO L87 Difference]: Start difference. First operand 249 states and 743 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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) [2021-03-10 21:51:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:02,596 INFO L93 Difference]: Finished difference Result 327 states and 966 transitions. [2021-03-10 21:51:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:51:02,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 20 [2021-03-10 21:51:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:02,597 INFO L225 Difference]: With dead ends: 327 [2021-03-10 21:51:02,598 INFO L226 Difference]: Without dead ends: 312 [2021-03-10 21:51:02,598 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 120.6ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:51:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-03-10 21:51:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 262. [2021-03-10 21:51:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.992337164750958) internal successors, (781), 261 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 781 transitions. [2021-03-10 21:51:02,603 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 781 transitions. Word has length 20 [2021-03-10 21:51:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:02,604 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 781 transitions. [2021-03-10 21:51:02,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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) [2021-03-10 21:51:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 781 transitions. [2021-03-10 21:51:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:02,605 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:02,605 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:02,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:02,805 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash -742091602, now seen corresponding path program 15 times [2021-03-10 21:51:02,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:02,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644972731] [2021-03-10 21:51:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:02,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644972731] [2021-03-10 21:51:02,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020349746] [2021-03-10 21:51:02,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:02,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:51:02,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:02,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:02,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:03,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:03,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:03,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:03,006 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:03,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:03,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:03,025 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:03,151 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:03,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:03,154 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:03,155 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:03,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:03,165 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:03,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:03,166 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:51:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:03,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:03,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:03,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694728155] [2021-03-10 21:51:03,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:03,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:03,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:03,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:03,220 INFO L87 Difference]: Start difference. First operand 262 states and 781 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:03,522 INFO L93 Difference]: Finished difference Result 364 states and 1068 transitions. [2021-03-10 21:51:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:03,522 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:03,524 INFO L225 Difference]: With dead ends: 364 [2021-03-10 21:51:03,524 INFO L226 Difference]: Without dead ends: 349 [2021-03-10 21:51:03,524 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 267.0ms TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-03-10 21:51:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 268. [2021-03-10 21:51:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 3.0112359550561796) internal successors, (804), 267 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 804 transitions. [2021-03-10 21:51:03,530 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 804 transitions. Word has length 20 [2021-03-10 21:51:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 804 transitions. [2021-03-10 21:51:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 804 transitions. [2021-03-10 21:51:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:03,531 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:03,531 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:03,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:03,739 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1243882938, now seen corresponding path program 16 times [2021-03-10 21:51:03,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:03,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853657980] [2021-03-10 21:51:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:03,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853657980] [2021-03-10 21:51:03,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705768048] [2021-03-10 21:51:03,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:03,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:03,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:03,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:03,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:03,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:03,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:03,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:03,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:03,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:03,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:03,951 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:04,029 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:04,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:04,032 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:04,033 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:04,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:04,045 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:04,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:04,046 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:51:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:04,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:04,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:04,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456946075] [2021-03-10 21:51:04,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:04,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:04,152 INFO L87 Difference]: Start difference. First operand 268 states and 804 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:04,463 INFO L93 Difference]: Finished difference Result 390 states and 1154 transitions. [2021-03-10 21:51:04,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:04,467 INFO L225 Difference]: With dead ends: 390 [2021-03-10 21:51:04,467 INFO L226 Difference]: Without dead ends: 375 [2021-03-10 21:51:04,467 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 286.2ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-03-10 21:51:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 266. [2021-03-10 21:51:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.0075471698113208) internal successors, (797), 265 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 797 transitions. [2021-03-10 21:51:04,478 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 797 transitions. Word has length 20 [2021-03-10 21:51:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:04,478 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 797 transitions. [2021-03-10 21:51:04,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 797 transitions. [2021-03-10 21:51:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:04,479 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:04,479 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:04,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:04,695 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:04,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1519239214, now seen corresponding path program 17 times [2021-03-10 21:51:04,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:04,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399527119] [2021-03-10 21:51:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:04,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399527119] [2021-03-10 21:51:04,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379302013] [2021-03-10 21:51:04,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:04,874 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:04,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:04,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:04,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:04,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:04,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:04,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:04,931 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:04,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:04,952 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:04,953 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:05,054 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:05,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:05,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:05,072 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:05,074 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:05,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:05,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:05,090 INFO L518 ElimStorePlain]: Eliminatee v_prenex_51 vanished before elimination [2021-03-10 21:51:05,091 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:05,091 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2021-03-10 21:51:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:05,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:05,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:05,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496244854] [2021-03-10 21:51:05,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:05,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:05,198 INFO L87 Difference]: Start difference. First operand 266 states and 797 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:05,449 INFO L93 Difference]: Finished difference Result 370 states and 1085 transitions. [2021-03-10 21:51:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:05,450 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:05,451 INFO L225 Difference]: With dead ends: 370 [2021-03-10 21:51:05,451 INFO L226 Difference]: Without dead ends: 355 [2021-03-10 21:51:05,452 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 290.4ms TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-03-10 21:51:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 263. [2021-03-10 21:51:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.0) internal successors, (786), 262 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 786 transitions. [2021-03-10 21:51:05,458 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 786 transitions. Word has length 20 [2021-03-10 21:51:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:05,458 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 786 transitions. [2021-03-10 21:51:05,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 786 transitions. [2021-03-10 21:51:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:05,460 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:05,460 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:05,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:05,663 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1271426204, now seen corresponding path program 18 times [2021-03-10 21:51:05,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:05,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289720725] [2021-03-10 21:51:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:05,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289720725] [2021-03-10 21:51:05,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075731273] [2021-03-10 21:51:05,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:05,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:51:05,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:05,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:05,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:05,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:05,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:05,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:05,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:05,868 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2021-03-10 21:51:05,886 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:05,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:05,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:05,892 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:05,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:05,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2021-03-10 21:51:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:05,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:05,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:05,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076861505] [2021-03-10 21:51:05,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:05,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:05,963 INFO L87 Difference]: Start difference. First operand 263 states and 786 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:06,207 INFO L93 Difference]: Finished difference Result 389 states and 1144 transitions. [2021-03-10 21:51:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:06,209 INFO L225 Difference]: With dead ends: 389 [2021-03-10 21:51:06,209 INFO L226 Difference]: Without dead ends: 374 [2021-03-10 21:51:06,209 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 191.3ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-03-10 21:51:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 262. [2021-03-10 21:51:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.992337164750958) internal successors, (781), 261 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 781 transitions. [2021-03-10 21:51:06,216 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 781 transitions. Word has length 20 [2021-03-10 21:51:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:06,216 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 781 transitions. [2021-03-10 21:51:06,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 781 transitions. [2021-03-10 21:51:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:06,217 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:06,217 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:06,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable259 [2021-03-10 21:51:06,427 INFO L428 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 418516700, now seen corresponding path program 19 times [2021-03-10 21:51:06,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:06,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841722131] [2021-03-10 21:51:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:06,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841722131] [2021-03-10 21:51:06,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124542015] [2021-03-10 21:51:06,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:06,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:06,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:06,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:06,610 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:06,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:06,616 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:06,616 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:51:06,635 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:06,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:06,638 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:06,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:06,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:06,657 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:06,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:06,658 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:51:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:06,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:06,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:06,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049957340] [2021-03-10 21:51:06,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:06,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:06,770 INFO L87 Difference]: Start difference. First operand 262 states and 781 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:07,120 INFO L93 Difference]: Finished difference Result 384 states and 1142 transitions. [2021-03-10 21:51:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:51:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:07,122 INFO L225 Difference]: With dead ends: 384 [2021-03-10 21:51:07,122 INFO L226 Difference]: Without dead ends: 369 [2021-03-10 21:51:07,122 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 280.9ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-03-10 21:51:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 262. [2021-03-10 21:51:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.992337164750958) internal successors, (781), 261 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 781 transitions. [2021-03-10 21:51:07,128 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 781 transitions. Word has length 20 [2021-03-10 21:51:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:07,128 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 781 transitions. [2021-03-10 21:51:07,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 781 transitions. [2021-03-10 21:51:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:07,129 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:07,129 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:07,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:07,331 INFO L428 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash -730480638, now seen corresponding path program 20 times [2021-03-10 21:51:07,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:07,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510104541] [2021-03-10 21:51:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:07,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510104541] [2021-03-10 21:51:07,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904005212] [2021-03-10 21:51:07,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:07,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:07,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:07,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:07,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:07,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:07,762 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:07,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:07,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:51:07,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:07,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:07,810 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:07,810 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:65 [2021-03-10 21:51:07,876 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:51:07,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:07,881 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:07,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:07,885 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:07,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:07,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:07,911 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:07,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:07,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:07,915 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:07,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:07,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:07,937 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:33 [2021-03-10 21:51:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:08,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:08,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:08,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138519560] [2021-03-10 21:51:08,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:08,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:08,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:08,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:08,034 INFO L87 Difference]: Start difference. First operand 262 states and 781 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:08,380 INFO L93 Difference]: Finished difference Result 319 states and 943 transitions. [2021-03-10 21:51:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:51:08,380 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:08,382 INFO L225 Difference]: With dead ends: 319 [2021-03-10 21:51:08,382 INFO L226 Difference]: Without dead ends: 304 [2021-03-10 21:51:08,382 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 435.9ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-03-10 21:51:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 260. [2021-03-10 21:51:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.996138996138996) internal successors, (776), 259 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 776 transitions. [2021-03-10 21:51:08,387 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 776 transitions. Word has length 20 [2021-03-10 21:51:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:08,387 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 776 transitions. [2021-03-10 21:51:08,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 776 transitions. [2021-03-10 21:51:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:08,388 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:08,388 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:08,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable265 [2021-03-10 21:51:08,588 INFO L428 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1584321884, now seen corresponding path program 21 times [2021-03-10 21:51:08,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:08,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869642365] [2021-03-10 21:51:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:08,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869642365] [2021-03-10 21:51:08,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399680816] [2021-03-10 21:51:08,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:08,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:51:08,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:08,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:08,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:08,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:08,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:08,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:08,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:08,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:08,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:08,812 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:08,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:08,843 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:08,843 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:51:09,055 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:51:09,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:09,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:09,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:09,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:09,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:09,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:09,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:09,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:09,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:09,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:09,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:09,095 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:09,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:09,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:09,100 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:09,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:09,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:09,132 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:35 [2021-03-10 21:51:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:09,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:09,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:09,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965131025] [2021-03-10 21:51:09,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:09,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:09,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:09,246 INFO L87 Difference]: Start difference. First operand 260 states and 776 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:09,673 INFO L93 Difference]: Finished difference Result 417 states and 1205 transitions. [2021-03-10 21:51:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:09,673 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:09,675 INFO L225 Difference]: With dead ends: 417 [2021-03-10 21:51:09,675 INFO L226 Difference]: Without dead ends: 387 [2021-03-10 21:51:09,675 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 493.2ms TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:51:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-03-10 21:51:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 263. [2021-03-10 21:51:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.0076335877862594) internal successors, (788), 262 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 788 transitions. [2021-03-10 21:51:09,680 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 788 transitions. Word has length 20 [2021-03-10 21:51:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:09,680 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 788 transitions. [2021-03-10 21:51:09,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 788 transitions. [2021-03-10 21:51:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:09,681 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:09,681 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:09,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable288 [2021-03-10 21:51:09,882 INFO L428 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1380717250, now seen corresponding path program 22 times [2021-03-10 21:51:09,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:09,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095443520] [2021-03-10 21:51:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:10,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095443520] [2021-03-10 21:51:10,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203656261] [2021-03-10 21:51:10,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:10,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:10,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:10,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:10,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:10,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:10,174 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:10,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:10,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:10,204 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:10,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:10,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:10,230 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:73 [2021-03-10 21:51:10,299 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:51:10,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:10,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:10,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:10,308 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:10,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:10,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:10,340 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:10,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:10,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:10,344 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:10,372 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:10,373 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:10,373 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:101, output treesize:41 [2021-03-10 21:51:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:10,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:10,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:10,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967915110] [2021-03-10 21:51:10,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:10,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:10,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:10,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:10,488 INFO L87 Difference]: Start difference. First operand 263 states and 788 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:10,901 INFO L93 Difference]: Finished difference Result 392 states and 1166 transitions. [2021-03-10 21:51:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:51:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:10,903 INFO L225 Difference]: With dead ends: 392 [2021-03-10 21:51:10,903 INFO L226 Difference]: Without dead ends: 377 [2021-03-10 21:51:10,903 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 454.8ms TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:51:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-03-10 21:51:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 259. [2021-03-10 21:51:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 2.992248062015504) internal successors, (772), 258 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 772 transitions. [2021-03-10 21:51:10,909 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 772 transitions. Word has length 20 [2021-03-10 21:51:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:10,909 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 772 transitions. [2021-03-10 21:51:10,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 772 transitions. [2021-03-10 21:51:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:10,910 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:10,910 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:11,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:11,131 INFO L428 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1002272404, now seen corresponding path program 23 times [2021-03-10 21:51:11,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:11,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976334661] [2021-03-10 21:51:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:11,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976334661] [2021-03-10 21:51:11,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103349930] [2021-03-10 21:51:11,289 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:11,312 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:51:11,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:11,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:11,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:11,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:11,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:11,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:11,380 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:11,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:11,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:11,418 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:79 [2021-03-10 21:51:11,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:11,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:11,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:11,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:11,897 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:11,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:11,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:11,919 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:11,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:11,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:11,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:11,940 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:11,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:11,958 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:11,958 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:79, output treesize:27 [2021-03-10 21:51:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:12,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:12,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:12,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68078505] [2021-03-10 21:51:12,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:12,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:12,022 INFO L87 Difference]: Start difference. First operand 259 states and 772 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:12,455 INFO L93 Difference]: Finished difference Result 355 states and 1054 transitions. [2021-03-10 21:51:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:12,457 INFO L225 Difference]: With dead ends: 355 [2021-03-10 21:51:12,457 INFO L226 Difference]: Without dead ends: 340 [2021-03-10 21:51:12,457 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 450.3ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-03-10 21:51:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 269. [2021-03-10 21:51:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 3.0111940298507465) internal successors, (807), 268 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 807 transitions. [2021-03-10 21:51:12,462 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 807 transitions. Word has length 20 [2021-03-10 21:51:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:12,462 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 807 transitions. [2021-03-10 21:51:12,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 807 transitions. [2021-03-10 21:51:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:12,463 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:12,463 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:12,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable310 [2021-03-10 21:51:12,665 INFO L428 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash 500481068, now seen corresponding path program 24 times [2021-03-10 21:51:12,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:12,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972127947] [2021-03-10 21:51:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:12,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972127947] [2021-03-10 21:51:12,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012706710] [2021-03-10 21:51:12,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:12,855 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:51:12,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:12,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:12,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:12,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:12,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:12,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:12,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:12,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:12,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:12,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:12,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:12,952 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:12,952 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:79 [2021-03-10 21:51:13,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:13,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:13,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:13,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:13,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:13,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:13,248 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:13,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:13,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:13,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:13,272 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:13,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:13,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:13,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:13,296 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:13,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:13,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:13,317 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:89, output treesize:33 [2021-03-10 21:51:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:13,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:13,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:13,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918909244] [2021-03-10 21:51:13,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:13,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:13,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:13,436 INFO L87 Difference]: Start difference. First operand 269 states and 807 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:13,886 INFO L93 Difference]: Finished difference Result 361 states and 1067 transitions. [2021-03-10 21:51:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:13,887 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:13,888 INFO L225 Difference]: With dead ends: 361 [2021-03-10 21:51:13,888 INFO L226 Difference]: Without dead ends: 346 [2021-03-10 21:51:13,888 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 421.1ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-03-10 21:51:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 267. [2021-03-10 21:51:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 3.007518796992481) internal successors, (800), 266 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 800 transitions. [2021-03-10 21:51:13,894 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 800 transitions. Word has length 20 [2021-03-10 21:51:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:13,894 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 800 transitions. [2021-03-10 21:51:13,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 800 transitions. [2021-03-10 21:51:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:13,895 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:13,895 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:14,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:14,115 INFO L428 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1031364076, now seen corresponding path program 25 times [2021-03-10 21:51:14,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:14,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629233488] [2021-03-10 21:51:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:14,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629233488] [2021-03-10 21:51:14,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421847197] [2021-03-10 21:51:14,248 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:14,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:14,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:14,324 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:14,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:14,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:14,331 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:14,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:14,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:14,367 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:79 [2021-03-10 21:51:14,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:14,791 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:14,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:14,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:14,822 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:14,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:14,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:14,851 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:14,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:14,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:14,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:14,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:14,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:14,906 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:14,906 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:87, output treesize:35 [2021-03-10 21:51:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:14,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:14,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:14,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565610094] [2021-03-10 21:51:14,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:14,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:14,995 INFO L87 Difference]: Start difference. First operand 267 states and 800 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:15,235 INFO L93 Difference]: Finished difference Result 335 states and 985 transitions. [2021-03-10 21:51:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:15,236 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:15,237 INFO L225 Difference]: With dead ends: 335 [2021-03-10 21:51:15,237 INFO L226 Difference]: Without dead ends: 320 [2021-03-10 21:51:15,237 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 353.3ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-03-10 21:51:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 264. [2021-03-10 21:51:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.0) internal successors, (789), 263 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 789 transitions. [2021-03-10 21:51:15,241 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 789 transitions. Word has length 20 [2021-03-10 21:51:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:15,241 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 789 transitions. [2021-03-10 21:51:15,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 789 transitions. [2021-03-10 21:51:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:15,242 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:15,242 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:15,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable379 [2021-03-10 21:51:15,442 INFO L428 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash 472937802, now seen corresponding path program 26 times [2021-03-10 21:51:15,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:15,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987403846] [2021-03-10 21:51:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:15,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987403846] [2021-03-10 21:51:15,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652793087] [2021-03-10 21:51:15,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:15,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:15,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:15,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:15,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:15,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:15,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:15,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:15,679 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:15,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:15,716 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:15,716 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:79 [2021-03-10 21:51:15,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:15,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:15,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:15,813 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:15,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:15,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:15,906 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:15,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:15,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:15,912 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:16,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:16,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:16,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:16,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:16,010 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:16,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:16,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:16,014 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:16,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:16,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:16,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:16,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:16,099 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:16,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:16,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:16,104 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:16,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:16,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:16,177 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:213, output treesize:101 [2021-03-10 21:51:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:16,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:16,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:16,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757924625] [2021-03-10 21:51:16,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:16,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:16,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:16,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:16,409 INFO L87 Difference]: Start difference. First operand 264 states and 789 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:16,778 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-03-10 21:51:16,969 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-03-10 21:51:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:16,989 INFO L93 Difference]: Finished difference Result 411 states and 1197 transitions. [2021-03-10 21:51:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:16,991 INFO L225 Difference]: With dead ends: 411 [2021-03-10 21:51:16,991 INFO L226 Difference]: Without dead ends: 381 [2021-03-10 21:51:16,991 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 624.1ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:51:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-03-10 21:51:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 263. [2021-03-10 21:51:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 2.9923664122137406) internal successors, (784), 262 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 784 transitions. [2021-03-10 21:51:16,996 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 784 transitions. Word has length 20 [2021-03-10 21:51:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:16,997 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 784 transitions. [2021-03-10 21:51:16,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 784 transitions. [2021-03-10 21:51:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:16,998 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:16,998 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:17,203 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable434 [2021-03-10 21:51:17,203 INFO L428 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash -413101908, now seen corresponding path program 27 times [2021-03-10 21:51:17,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:17,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336141277] [2021-03-10 21:51:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:17,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336141277] [2021-03-10 21:51:17,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678073170] [2021-03-10 21:51:17,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:17,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:51:17,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:17,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:17,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:17,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:17,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:17,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:17,504 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:17,504 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2021-03-10 21:51:17,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:17,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:17,532 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:17,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:17,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:17,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:17,544 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:17,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:17,553 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:17,553 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2021-03-10 21:51:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:17,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:17,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:17,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830049096] [2021-03-10 21:51:17,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:17,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:17,575 INFO L87 Difference]: Start difference. First operand 263 states and 784 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:17,756 INFO L93 Difference]: Finished difference Result 324 states and 957 transitions. [2021-03-10 21:51:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:51:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:17,758 INFO L225 Difference]: With dead ends: 324 [2021-03-10 21:51:17,758 INFO L226 Difference]: Without dead ends: 309 [2021-03-10 21:51:17,758 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 175.3ms TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-03-10 21:51:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2021-03-10 21:51:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.996138996138996) internal successors, (776), 259 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 776 transitions. [2021-03-10 21:51:17,777 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 776 transitions. Word has length 20 [2021-03-10 21:51:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:17,777 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 776 transitions. [2021-03-10 21:51:17,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 776 transitions. [2021-03-10 21:51:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:17,777 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:17,777 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:17,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable446 [2021-03-10 21:51:17,978 INFO L428 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2132086590, now seen corresponding path program 28 times [2021-03-10 21:51:17,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:17,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300723343] [2021-03-10 21:51:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:18,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300723343] [2021-03-10 21:51:18,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372087562] [2021-03-10 21:51:18,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:18,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:18,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:18,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:18,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:18,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:18,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:18,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:18,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:18,212 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2021-03-10 21:51:18,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:18,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:18,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:18,247 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:18,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:18,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:18,284 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:18,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:18,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:18,287 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:18,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:18,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:18,319 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:41 [2021-03-10 21:51:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:18,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:18,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:18,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532661085] [2021-03-10 21:51:18,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:18,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:18,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:18,445 INFO L87 Difference]: Start difference. First operand 260 states and 776 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:18,726 INFO L93 Difference]: Finished difference Result 391 states and 1159 transitions. [2021-03-10 21:51:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:51:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:18,728 INFO L225 Difference]: With dead ends: 391 [2021-03-10 21:51:18,728 INFO L226 Difference]: Without dead ends: 376 [2021-03-10 21:51:18,728 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 315.4ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-03-10 21:51:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 259. [2021-03-10 21:51:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 2.992248062015504) internal successors, (772), 258 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 772 transitions. [2021-03-10 21:51:18,734 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 772 transitions. Word has length 20 [2021-03-10 21:51:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:18,734 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 772 transitions. [2021-03-10 21:51:18,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 772 transitions. [2021-03-10 21:51:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:18,735 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:18,735 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:18,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:18,947 INFO L428 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash -735699412, now seen corresponding path program 29 times [2021-03-10 21:51:18,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:18,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019130927] [2021-03-10 21:51:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:19,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019130927] [2021-03-10 21:51:19,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288302228] [2021-03-10 21:51:19,074 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:19,097 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:51:19,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:19,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:19,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:19,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:19,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:19,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:19,154 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:19,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:19,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:19,187 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:19,357 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:51:19,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:19,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:19,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:19,366 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:19,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:19,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:19,396 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:19,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:19,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:19,400 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:19,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:19,425 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:19,426 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:33 [2021-03-10 21:51:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:19,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:19,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:19,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50539924] [2021-03-10 21:51:19,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:19,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:19,527 INFO L87 Difference]: Start difference. First operand 259 states and 772 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:20,013 INFO L93 Difference]: Finished difference Result 350 states and 1038 transitions. [2021-03-10 21:51:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:20,015 INFO L225 Difference]: With dead ends: 350 [2021-03-10 21:51:20,015 INFO L226 Difference]: Without dead ends: 335 [2021-03-10 21:51:20,015 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 390.3ms TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:51:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-03-10 21:51:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 265. [2021-03-10 21:51:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.003787878787879) internal successors, (793), 264 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 793 transitions. [2021-03-10 21:51:20,024 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 793 transitions. Word has length 20 [2021-03-10 21:51:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:20,024 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 793 transitions. [2021-03-10 21:51:20,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 793 transitions. [2021-03-10 21:51:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:20,025 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:20,025 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:20,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable456 [2021-03-10 21:51:20,247 INFO L428 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2065627574, now seen corresponding path program 30 times [2021-03-10 21:51:20,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:20,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249418635] [2021-03-10 21:51:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:20,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249418635] [2021-03-10 21:51:20,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473350472] [2021-03-10 21:51:20,373 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:20,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:51:20,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:20,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:20,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:20,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:20,459 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:20,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:20,463 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:20,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:20,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:20,496 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:20,575 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:51:20,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:20,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:20,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:20,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:20,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:20,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:20,634 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:20,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:20,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:20,638 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:20,672 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:20,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:20,673 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:51:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:20,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:20,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:20,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600845878] [2021-03-10 21:51:20,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:20,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:20,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:20,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:20,788 INFO L87 Difference]: Start difference. First operand 265 states and 793 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:21,152 INFO L93 Difference]: Finished difference Result 372 states and 1107 transitions. [2021-03-10 21:51:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:51:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:21,154 INFO L225 Difference]: With dead ends: 372 [2021-03-10 21:51:21,154 INFO L226 Difference]: Without dead ends: 357 [2021-03-10 21:51:21,154 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 327.6ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-03-10 21:51:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 262. [2021-03-10 21:51:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.992337164750958) internal successors, (781), 261 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 781 transitions. [2021-03-10 21:51:21,159 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 781 transitions. Word has length 20 [2021-03-10 21:51:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:21,160 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 781 transitions. [2021-03-10 21:51:21,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 781 transitions. [2021-03-10 21:51:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:21,161 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:21,161 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:21,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:21,375 INFO L428 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1314258234, now seen corresponding path program 31 times [2021-03-10 21:51:21,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:21,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111795454] [2021-03-10 21:51:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:21,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111795454] [2021-03-10 21:51:21,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049627672] [2021-03-10 21:51:21,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:21,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:21,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:21,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:21,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:21,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:21,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:21,573 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-03-10 21:51:21,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:21,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:21,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:21,609 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:21,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:21,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:21,650 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:21,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:21,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:21,653 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:21,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:21,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:21,689 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:41 [2021-03-10 21:51:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:21,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:21,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:21,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859577338] [2021-03-10 21:51:21,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:21,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:21,834 INFO L87 Difference]: Start difference. First operand 262 states and 781 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:22,096 INFO L93 Difference]: Finished difference Result 323 states and 954 transitions. [2021-03-10 21:51:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:22,097 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:22,098 INFO L225 Difference]: With dead ends: 323 [2021-03-10 21:51:22,098 INFO L226 Difference]: Without dead ends: 308 [2021-03-10 21:51:22,098 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 275.2ms TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-03-10 21:51:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 262. [2021-03-10 21:51:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.992337164750958) internal successors, (781), 261 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 781 transitions. [2021-03-10 21:51:22,103 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 781 transitions. Word has length 20 [2021-03-10 21:51:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:22,103 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 781 transitions. [2021-03-10 21:51:22,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 781 transitions. [2021-03-10 21:51:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:22,104 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:22,104 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:22,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:22,307 INFO L428 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 927087754, now seen corresponding path program 32 times [2021-03-10 21:51:22,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:22,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965304708] [2021-03-10 21:51:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:22,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965304708] [2021-03-10 21:51:22,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009701310] [2021-03-10 21:51:22,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:22,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:22,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:22,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:22,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:22,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:22,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:22,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:22,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:22,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:22,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:22,468 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:51:22,578 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:22,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:22,582 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:22,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:22,585 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:22,586 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:22,588 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:22,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:22,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:22,617 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:22,618 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:22,618 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:73 [2021-03-10 21:51:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:22,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:22,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:22,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648848731] [2021-03-10 21:51:22,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:22,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:22,707 INFO L87 Difference]: Start difference. First operand 262 states and 781 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:23,719 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-03-10 21:51:23,983 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-03-10 21:51:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:24,004 INFO L93 Difference]: Finished difference Result 702 states and 2078 transitions. [2021-03-10 21:51:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-03-10 21:51:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:24,007 INFO L225 Difference]: With dead ends: 702 [2021-03-10 21:51:24,007 INFO L226 Difference]: Without dead ends: 672 [2021-03-10 21:51:24,007 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1199.6ms TimeCoverageRelationStatistics Valid=303, Invalid=1179, Unknown=0, NotChecked=0, Total=1482 [2021-03-10 21:51:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-03-10 21:51:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 276. [2021-03-10 21:51:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.981818181818182) internal successors, (820), 275 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 820 transitions. [2021-03-10 21:51:24,013 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 820 transitions. Word has length 20 [2021-03-10 21:51:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:24,013 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 820 transitions. [2021-03-10 21:51:24,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 820 transitions. [2021-03-10 21:51:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:24,014 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:24,014 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:24,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable487 [2021-03-10 21:51:24,231 INFO L428 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash -755048560, now seen corresponding path program 33 times [2021-03-10 21:51:24,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:24,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688497248] [2021-03-10 21:51:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:24,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688497248] [2021-03-10 21:51:24,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694181568] [2021-03-10 21:51:24,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:24,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:51:24,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:24,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:24,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:24,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:24,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:24,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:24,382 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:24,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:24,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:24,400 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:51:24,464 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:24,465 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:24,467 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:24,468 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:24,470 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:24,471 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:24,473 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:24,474 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:24,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:24,503 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:24,504 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:24,504 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:73 [2021-03-10 21:51:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:24,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:24,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:24,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012351472] [2021-03-10 21:51:24,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:24,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:24,602 INFO L87 Difference]: Start difference. First operand 276 states and 820 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:25,056 INFO L93 Difference]: Finished difference Result 469 states and 1378 transitions. [2021-03-10 21:51:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:51:25,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:25,058 INFO L225 Difference]: With dead ends: 469 [2021-03-10 21:51:25,058 INFO L226 Difference]: Without dead ends: 454 [2021-03-10 21:51:25,058 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 437.5ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:51:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-03-10 21:51:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 284. [2021-03-10 21:51:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 2.9964664310954063) internal successors, (848), 283 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 848 transitions. [2021-03-10 21:51:25,065 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 848 transitions. Word has length 20 [2021-03-10 21:51:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:25,065 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 848 transitions. [2021-03-10 21:51:25,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 848 transitions. [2021-03-10 21:51:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:25,066 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:25,066 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:25,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:25,287 INFO L428 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1020466382, now seen corresponding path program 34 times [2021-03-10 21:51:25,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:25,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280027356] [2021-03-10 21:51:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:25,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280027356] [2021-03-10 21:51:25,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251542893] [2021-03-10 21:51:25,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:25,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:25,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:25,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:25,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:25,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:25,443 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:25,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:25,446 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:25,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:25,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:25,467 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:51:25,508 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:25,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:25,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:25,527 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:25,529 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:25,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:25,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:25,548 INFO L518 ElimStorePlain]: Eliminatee v_prenex_95 vanished before elimination [2021-03-10 21:51:25,548 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:25,548 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2021-03-10 21:51:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:25,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:25,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:25,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445389392] [2021-03-10 21:51:25,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:25,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:25,627 INFO L87 Difference]: Start difference. First operand 284 states and 848 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:25,895 INFO L93 Difference]: Finished difference Result 481 states and 1408 transitions. [2021-03-10 21:51:25,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:25,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:25,897 INFO L225 Difference]: With dead ends: 481 [2021-03-10 21:51:25,897 INFO L226 Difference]: Without dead ends: 466 [2021-03-10 21:51:25,898 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 267.9ms TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-03-10 21:51:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 280. [2021-03-10 21:51:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 2.982078853046595) internal successors, (832), 279 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 832 transitions. [2021-03-10 21:51:25,904 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 832 transitions. Word has length 20 [2021-03-10 21:51:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:25,905 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 832 transitions. [2021-03-10 21:51:25,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 832 transitions. [2021-03-10 21:51:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:25,906 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:25,906 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:26,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable502 [2021-03-10 21:51:26,128 INFO L428 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1125704378, now seen corresponding path program 35 times [2021-03-10 21:51:26,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:26,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575647091] [2021-03-10 21:51:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:26,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575647091] [2021-03-10 21:51:26,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083361528] [2021-03-10 21:51:26,209 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:26,232 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:51:26,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:26,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:26,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:26,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:26,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:26,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:26,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:26,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:51:26,296 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:26,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:26,299 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:26,300 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:26,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:26,316 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:26,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:26,317 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:35 [2021-03-10 21:51:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:26,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:26,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:26,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231958001] [2021-03-10 21:51:26,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:26,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:26,398 INFO L87 Difference]: Start difference. First operand 280 states and 832 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:26,668 INFO L93 Difference]: Finished difference Result 470 states and 1380 transitions. [2021-03-10 21:51:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:26,671 INFO L225 Difference]: With dead ends: 470 [2021-03-10 21:51:26,671 INFO L226 Difference]: Without dead ends: 455 [2021-03-10 21:51:26,671 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 254.4ms TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-03-10 21:51:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 272. [2021-03-10 21:51:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.981549815498155) internal successors, (808), 271 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 808 transitions. [2021-03-10 21:51:26,681 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 808 transitions. Word has length 20 [2021-03-10 21:51:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:26,681 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 808 transitions. [2021-03-10 21:51:26,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 808 transitions. [2021-03-10 21:51:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:26,682 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:26,682 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:26,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:26,887 INFO L428 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2067877130, now seen corresponding path program 36 times [2021-03-10 21:51:26,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:26,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6569726] [2021-03-10 21:51:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:26,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6569726] [2021-03-10 21:51:26,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671217751] [2021-03-10 21:51:26,992 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:27,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:51:27,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:27,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:27,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:27,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:27,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:27,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:27,059 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:27,077 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:27,078 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:27,078 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:51:27,141 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:27,142 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:27,144 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:27,145 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:27,147 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:27,148 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:27,150 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:27,151 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:27,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:27,180 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:27,181 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:27,181 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:73 [2021-03-10 21:51:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:27,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:27,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:27,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199627848] [2021-03-10 21:51:27,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:27,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:27,272 INFO L87 Difference]: Start difference. First operand 272 states and 808 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:27,704 INFO L93 Difference]: Finished difference Result 487 states and 1433 transitions. [2021-03-10 21:51:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:51:27,704 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:27,706 INFO L225 Difference]: With dead ends: 487 [2021-03-10 21:51:27,706 INFO L226 Difference]: Without dead ends: 472 [2021-03-10 21:51:27,707 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 449.3ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:51:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-03-10 21:51:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 287. [2021-03-10 21:51:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.9965034965034967) internal successors, (857), 286 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 857 transitions. [2021-03-10 21:51:27,714 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 857 transitions. Word has length 20 [2021-03-10 21:51:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:27,714 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 857 transitions. [2021-03-10 21:51:27,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 857 transitions. [2021-03-10 21:51:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:27,715 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:27,715 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:27,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable512 [2021-03-10 21:51:27,931 INFO L428 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1802459308, now seen corresponding path program 37 times [2021-03-10 21:51:27,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:27,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386358141] [2021-03-10 21:51:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:28,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386358141] [2021-03-10 21:51:28,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408555141] [2021-03-10 21:51:28,020 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:28,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:28,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:28,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:28,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:28,089 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:28,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:28,107 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:51:28,145 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:28,146 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:28,166 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:28,167 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:28,183 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:28,183 INFO L518 ElimStorePlain]: Eliminatee v_prenex_97 vanished before elimination [2021-03-10 21:51:28,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:28,183 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2021-03-10 21:51:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:28,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:28,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:28,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174973186] [2021-03-10 21:51:28,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:28,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:28,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:28,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:28,276 INFO L87 Difference]: Start difference. First operand 287 states and 857 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:28,568 INFO L93 Difference]: Finished difference Result 499 states and 1463 transitions. [2021-03-10 21:51:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:28,569 INFO L225 Difference]: With dead ends: 499 [2021-03-10 21:51:28,569 INFO L226 Difference]: Without dead ends: 484 [2021-03-10 21:51:28,569 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 297.9ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-03-10 21:51:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 283. [2021-03-10 21:51:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 2.982269503546099) internal successors, (841), 282 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 841 transitions. [2021-03-10 21:51:28,574 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 841 transitions. Word has length 20 [2021-03-10 21:51:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:28,574 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 841 transitions. [2021-03-10 21:51:28,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 841 transitions. [2021-03-10 21:51:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:28,575 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:28,575 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:28,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable520 [2021-03-10 21:51:28,791 INFO L428 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash -346337228, now seen corresponding path program 38 times [2021-03-10 21:51:28,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:28,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639383684] [2021-03-10 21:51:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:28,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639383684] [2021-03-10 21:51:28,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456892105] [2021-03-10 21:51:28,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:28,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:28,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:28,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:28,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:28,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:28,931 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:28,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,936 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:51:28,953 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:28,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:28,958 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:28,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:28,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2021-03-10 21:51:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:28,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:28,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 21:51:28,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928534059] [2021-03-10 21:51:28,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 21:51:28,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 21:51:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:51:28,974 INFO L87 Difference]: Start difference. First operand 283 states and 841 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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) [2021-03-10 21:51:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:29,161 INFO L93 Difference]: Finished difference Result 488 states and 1435 transitions. [2021-03-10 21:51:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:51:29,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 20 [2021-03-10 21:51:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:29,163 INFO L225 Difference]: With dead ends: 488 [2021-03-10 21:51:29,163 INFO L226 Difference]: Without dead ends: 473 [2021-03-10 21:51:29,163 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 123.3ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:51:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-03-10 21:51:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 279. [2021-03-10 21:51:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.9820143884892087) internal successors, (829), 278 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 829 transitions. [2021-03-10 21:51:29,170 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 829 transitions. Word has length 20 [2021-03-10 21:51:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:29,170 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 829 transitions. [2021-03-10 21:51:29,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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) [2021-03-10 21:51:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 829 transitions. [2021-03-10 21:51:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:29,171 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:29,171 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:29,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:29,375 INFO L428 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:29,375 INFO L82 PathProgramCache]: Analyzing trace with hash 160009038, now seen corresponding path program 39 times [2021-03-10 21:51:29,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:29,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803584876] [2021-03-10 21:51:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:29,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803584876] [2021-03-10 21:51:29,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044453707] [2021-03-10 21:51:29,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:29,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:51:29,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:29,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:29,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:29,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:29,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:29,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:29,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:29,524 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2021-03-10 21:51:29,549 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:29,550 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:29,552 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:29,553 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:29,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:29,572 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:29,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:29,573 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:35 [2021-03-10 21:51:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:29,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:29,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:29,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000885053] [2021-03-10 21:51:29,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:29,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:29,678 INFO L87 Difference]: Start difference. First operand 279 states and 829 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:30,031 INFO L93 Difference]: Finished difference Result 592 states and 1740 transitions. [2021-03-10 21:51:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:30,032 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:30,033 INFO L225 Difference]: With dead ends: 592 [2021-03-10 21:51:30,033 INFO L226 Difference]: Without dead ends: 577 [2021-03-10 21:51:30,033 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 303.3ms TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-03-10 21:51:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 301. [2021-03-10 21:51:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 2.98) internal successors, (894), 300 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 894 transitions. [2021-03-10 21:51:30,040 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 894 transitions. Word has length 20 [2021-03-10 21:51:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:30,040 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 894 transitions. [2021-03-10 21:51:30,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 894 transitions. [2021-03-10 21:51:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:30,041 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:30,042 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:30,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:30,255 INFO L428 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1360504170, now seen corresponding path program 40 times [2021-03-10 21:51:30,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:30,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335699581] [2021-03-10 21:51:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:30,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335699581] [2021-03-10 21:51:30,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949204961] [2021-03-10 21:51:30,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:30,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:30,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:30,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:30,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:30,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:30,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:30,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:51:30,520 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:30,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:30,546 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:30,546 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2021-03-10 21:51:30,706 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:30,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:30,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:30,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:30,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:30,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:30,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:30,743 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:30,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:30,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:30,758 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:30,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:30,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:30,784 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:89, output treesize:27 [2021-03-10 21:51:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:30,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:30,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:30,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908367475] [2021-03-10 21:51:30,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:30,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:30,838 INFO L87 Difference]: Start difference. First operand 301 states and 894 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:31,186 INFO L93 Difference]: Finished difference Result 367 states and 1083 transitions. [2021-03-10 21:51:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:51:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:31,188 INFO L225 Difference]: With dead ends: 367 [2021-03-10 21:51:31,188 INFO L226 Difference]: Without dead ends: 352 [2021-03-10 21:51:31,188 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 322.1ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-03-10 21:51:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 309. [2021-03-10 21:51:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.9837662337662336) internal successors, (919), 308 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 919 transitions. [2021-03-10 21:51:31,194 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 919 transitions. Word has length 20 [2021-03-10 21:51:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:31,194 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 919 transitions. [2021-03-10 21:51:31,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 919 transitions. [2021-03-10 21:51:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:31,195 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:31,195 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:31,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:31,403 INFO L428 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 858712834, now seen corresponding path program 41 times [2021-03-10 21:51:31,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:31,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728322747] [2021-03-10 21:51:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:31,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728322747] [2021-03-10 21:51:31,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33961509] [2021-03-10 21:51:31,531 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:31,555 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:31,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:31,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:31,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:31,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:31,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:31,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:51:31,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:31,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:31,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:31,688 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2021-03-10 21:51:31,752 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:31,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:31,757 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:31,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:31,761 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:31,788 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:31,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:31,793 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:31,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:31,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:31,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:31,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:31,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:31,822 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:51:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:31,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:31,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:31,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430652338] [2021-03-10 21:51:31,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:31,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:31,919 INFO L87 Difference]: Start difference. First operand 309 states and 919 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:32,208 INFO L93 Difference]: Finished difference Result 373 states and 1096 transitions. [2021-03-10 21:51:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:51:32,209 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:32,210 INFO L225 Difference]: With dead ends: 373 [2021-03-10 21:51:32,210 INFO L226 Difference]: Without dead ends: 358 [2021-03-10 21:51:32,210 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 313.1ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-03-10 21:51:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 307. [2021-03-10 21:51:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 2.980392156862745) internal successors, (912), 306 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 912 transitions. [2021-03-10 21:51:32,218 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 912 transitions. Word has length 20 [2021-03-10 21:51:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 912 transitions. [2021-03-10 21:51:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 912 transitions. [2021-03-10 21:51:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:32,219 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:32,219 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:32,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable551 [2021-03-10 21:51:32,427 INFO L428 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1248071286, now seen corresponding path program 42 times [2021-03-10 21:51:32,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:32,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434393541] [2021-03-10 21:51:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:32,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434393541] [2021-03-10 21:51:32,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340921549] [2021-03-10 21:51:32,535 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:32,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:51:32,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:32,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:32,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:32,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:32,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:32,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:32,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:32,638 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:32,638 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2021-03-10 21:51:32,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:32,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:32,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:32,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:32,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:32,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:32,689 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:32,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:32,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:32,700 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2021-03-10 21:51:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:32,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:32,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:51:32,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69963596] [2021-03-10 21:51:32,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:51:32,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:51:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:32,723 INFO L87 Difference]: Start difference. First operand 307 states and 912 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:32,948 INFO L93 Difference]: Finished difference Result 364 states and 1074 transitions. [2021-03-10 21:51:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:51:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:32,950 INFO L225 Difference]: With dead ends: 364 [2021-03-10 21:51:32,950 INFO L226 Difference]: Without dead ends: 349 [2021-03-10 21:51:32,950 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 152.5ms TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:51:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-03-10 21:51:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 305. [2021-03-10 21:51:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.9835526315789473) internal successors, (907), 304 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 907 transitions. [2021-03-10 21:51:32,955 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 907 transitions. Word has length 20 [2021-03-10 21:51:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:32,955 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 907 transitions. [2021-03-10 21:51:32,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 907 transitions. [2021-03-10 21:51:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:32,956 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:32,956 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:33,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable564 [2021-03-10 21:51:33,167 INFO L428 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1212563188, now seen corresponding path program 43 times [2021-03-10 21:51:33,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:33,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049586819] [2021-03-10 21:51:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:33,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049586819] [2021-03-10 21:51:33,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268647252] [2021-03-10 21:51:33,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:33,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:33,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:33,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:33,402 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:33,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:33,405 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:33,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:33,439 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:33,439 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:33,709 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:33,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:33,715 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:33,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:33,719 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:33,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:33,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:33,753 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:33,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:33,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:33,758 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:33,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:33,789 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:33,789 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:89, output treesize:27 [2021-03-10 21:51:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:33,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:33,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:33,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627691058] [2021-03-10 21:51:33,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:33,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:33,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:33,857 INFO L87 Difference]: Start difference. First operand 305 states and 907 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:34,224 INFO L93 Difference]: Finished difference Result 387 states and 1133 transitions. [2021-03-10 21:51:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:34,225 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:34,225 INFO L225 Difference]: With dead ends: 387 [2021-03-10 21:51:34,225 INFO L226 Difference]: Without dead ends: 372 [2021-03-10 21:51:34,225 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 429.6ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-03-10 21:51:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 311. [2021-03-10 21:51:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 3.0) internal successors, (930), 310 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 930 transitions. [2021-03-10 21:51:34,230 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 930 transitions. Word has length 20 [2021-03-10 21:51:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:34,230 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 930 transitions. [2021-03-10 21:51:34,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 930 transitions. [2021-03-10 21:51:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:34,231 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:34,231 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:34,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable565 [2021-03-10 21:51:34,443 INFO L428 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1714354524, now seen corresponding path program 44 times [2021-03-10 21:51:34,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:34,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215552493] [2021-03-10 21:51:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:34,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215552493] [2021-03-10 21:51:34,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825600703] [2021-03-10 21:51:34,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:34,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:34,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:34,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:34,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:34,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:34,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:34,693 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:34,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:34,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:34,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2021-03-10 21:51:34,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:34,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:34,779 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:34,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:34,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:34,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:34,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:34,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:34,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:34,805 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2021-03-10 21:51:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:34,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:34,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:34,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864732355] [2021-03-10 21:51:34,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:34,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:34,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:34,864 INFO L87 Difference]: Start difference. First operand 311 states and 930 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:35,230 INFO L93 Difference]: Finished difference Result 451 states and 1327 transitions. [2021-03-10 21:51:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:35,232 INFO L225 Difference]: With dead ends: 451 [2021-03-10 21:51:35,233 INFO L226 Difference]: Without dead ends: 436 [2021-03-10 21:51:35,233 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 350.3ms TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:51:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-03-10 21:51:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 309. [2021-03-10 21:51:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.9967532467532467) internal successors, (923), 308 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 923 transitions. [2021-03-10 21:51:35,239 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 923 transitions. Word has length 20 [2021-03-10 21:51:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:35,239 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 923 transitions. [2021-03-10 21:51:35,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 923 transitions. [2021-03-10 21:51:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:35,240 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:35,240 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:35,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable589 [2021-03-10 21:51:35,449 INFO L428 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1048767628, now seen corresponding path program 45 times [2021-03-10 21:51:35,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:35,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500835908] [2021-03-10 21:51:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:35,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500835908] [2021-03-10 21:51:35,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200205888] [2021-03-10 21:51:35,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:35,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:51:35,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:35,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:35,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:35,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:35,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:35,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:35,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:35,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:35,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:35,704 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:35,888 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:35,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:35,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:35,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:35,899 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:35,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:35,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:35,937 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:35,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:35,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:35,941 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:35,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:35,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:35,971 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:35 [2021-03-10 21:51:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:36,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:36,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:36,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059600385] [2021-03-10 21:51:36,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:36,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:36,057 INFO L87 Difference]: Start difference. First operand 309 states and 923 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:36,342 INFO L93 Difference]: Finished difference Result 379 states and 1113 transitions. [2021-03-10 21:51:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:36,344 INFO L225 Difference]: With dead ends: 379 [2021-03-10 21:51:36,344 INFO L226 Difference]: Without dead ends: 364 [2021-03-10 21:51:36,344 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 342.2ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-03-10 21:51:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 306. [2021-03-10 21:51:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.9901639344262296) internal successors, (912), 305 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 912 transitions. [2021-03-10 21:51:36,349 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 912 transitions. Word has length 20 [2021-03-10 21:51:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:36,349 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 912 transitions. [2021-03-10 21:51:36,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 912 transitions. [2021-03-10 21:51:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:36,350 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:36,350 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:36,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:36,559 INFO L428 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1741897790, now seen corresponding path program 46 times [2021-03-10 21:51:36,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:36,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422570935] [2021-03-10 21:51:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:36,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422570935] [2021-03-10 21:51:36,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507595424] [2021-03-10 21:51:36,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:36,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:36,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:36,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:36,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:36,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:36,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:36,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:36,785 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:36,817 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:36,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:36,818 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:36,888 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:36,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:36,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:36,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:36,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:36,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:36,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:36,940 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:36,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:36,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:36,943 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:36,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:36,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:36,977 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:51:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:37,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:37,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:37,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996665644] [2021-03-10 21:51:37,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:37,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:37,095 INFO L87 Difference]: Start difference. First operand 306 states and 912 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:37,562 INFO L93 Difference]: Finished difference Result 478 states and 1413 transitions. [2021-03-10 21:51:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:51:37,563 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:37,564 INFO L225 Difference]: With dead ends: 478 [2021-03-10 21:51:37,564 INFO L226 Difference]: Without dead ends: 463 [2021-03-10 21:51:37,564 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 417.8ms TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:51:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-03-10 21:51:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 305. [2021-03-10 21:51:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.9835526315789473) internal successors, (907), 304 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 907 transitions. [2021-03-10 21:51:37,568 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 907 transitions. Word has length 20 [2021-03-10 21:51:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:37,569 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 907 transitions. [2021-03-10 21:51:37,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 907 transitions. [2021-03-10 21:51:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:37,569 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:37,569 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:37,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable604 [2021-03-10 21:51:37,773 INFO L428 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2101912532, now seen corresponding path program 47 times [2021-03-10 21:51:37,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:37,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944927523] [2021-03-10 21:51:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:37,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944927523] [2021-03-10 21:51:37,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661922387] [2021-03-10 21:51:37,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:37,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:37,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:37,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:37,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:38,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:38,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:38,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:38,035 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:38,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:38,078 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:38,079 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:38,240 INFO L446 ElimStorePlain]: Different costs {1=[o_0], 3=[o_2]} [2021-03-10 21:51:38,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:38,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:38,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:38,250 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:38,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:38,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:38,280 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:38,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:38,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:38,283 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:38,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:38,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:38,309 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:51:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:38,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:38,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:38,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312955982] [2021-03-10 21:51:38,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:38,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:38,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:38,417 INFO L87 Difference]: Start difference. First operand 305 states and 907 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:38,929 INFO L93 Difference]: Finished difference Result 471 states and 1384 transitions. [2021-03-10 21:51:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:51:38,929 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:38,931 INFO L225 Difference]: With dead ends: 471 [2021-03-10 21:51:38,931 INFO L226 Difference]: Without dead ends: 456 [2021-03-10 21:51:38,931 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 574.0ms TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:51:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-03-10 21:51:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 308. [2021-03-10 21:51:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.993485342019544) internal successors, (919), 307 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 919 transitions. [2021-03-10 21:51:38,938 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 919 transitions. Word has length 20 [2021-03-10 21:51:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:38,938 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 919 transitions. [2021-03-10 21:51:38,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 919 transitions. [2021-03-10 21:51:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:38,939 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:38,939 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:39,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:39,155 INFO L428 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash 863126602, now seen corresponding path program 48 times [2021-03-10 21:51:39,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:39,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096607518] [2021-03-10 21:51:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:39,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096607518] [2021-03-10 21:51:39,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404779770] [2021-03-10 21:51:39,307 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:39,334 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:51:39,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:39,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:39,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:39,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:39,393 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:39,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:39,397 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:39,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:39,431 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:39,431 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:51:39,506 INFO L446 ElimStorePlain]: Different costs {1=[o_0], 3=[o_2]} [2021-03-10 21:51:39,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:39,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:39,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:39,517 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:39,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:39,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:39,560 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:39,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:39,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:39,564 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:39,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:39,598 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:39,598 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:51:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:39,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:39,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:39,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714953329] [2021-03-10 21:51:39,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:39,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:39,747 INFO L87 Difference]: Start difference. First operand 308 states and 919 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:40,281 INFO L93 Difference]: Finished difference Result 494 states and 1432 transitions. [2021-03-10 21:51:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:51:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:40,282 INFO L225 Difference]: With dead ends: 494 [2021-03-10 21:51:40,282 INFO L226 Difference]: Without dead ends: 464 [2021-03-10 21:51:40,282 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 505.8ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:51:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-03-10 21:51:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 304. [2021-03-10 21:51:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.98019801980198) internal successors, (903), 303 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 903 transitions. [2021-03-10 21:51:40,288 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 903 transitions. Word has length 20 [2021-03-10 21:51:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:40,288 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 903 transitions. [2021-03-10 21:51:40,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 903 transitions. [2021-03-10 21:51:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:40,289 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:40,289 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:40,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:40,503 INFO L428 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash 484681756, now seen corresponding path program 49 times [2021-03-10 21:51:40,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:40,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802631868] [2021-03-10 21:51:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:40,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802631868] [2021-03-10 21:51:40,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668809262] [2021-03-10 21:51:40,645 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:40,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:40,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:40,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:40,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:40,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:40,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:40,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:40,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:40,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:40,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:40,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:40,800 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:69 [2021-03-10 21:51:41,124 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:41,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:41,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:41,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:51:41,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:41,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:41,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:41,133 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:41,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:41,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:41,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:41,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:41,157 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:41,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:41,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:41,160 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:41,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:41,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:41,180 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:27 [2021-03-10 21:51:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:41,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:41,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:41,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10289022] [2021-03-10 21:51:41,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:41,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:41,236 INFO L87 Difference]: Start difference. First operand 304 states and 903 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:41,616 INFO L93 Difference]: Finished difference Result 368 states and 1086 transitions. [2021-03-10 21:51:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:41,617 INFO L225 Difference]: With dead ends: 368 [2021-03-10 21:51:41,618 INFO L226 Difference]: Without dead ends: 353 [2021-03-10 21:51:41,618 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 426.9ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-03-10 21:51:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 314. [2021-03-10 21:51:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.9968051118210863) internal successors, (938), 313 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 938 transitions. [2021-03-10 21:51:41,622 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 938 transitions. Word has length 20 [2021-03-10 21:51:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:41,622 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 938 transitions. [2021-03-10 21:51:41,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 938 transitions. [2021-03-10 21:51:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:41,623 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:41,623 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:41,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable639 [2021-03-10 21:51:41,828 INFO L428 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash -17109580, now seen corresponding path program 50 times [2021-03-10 21:51:41,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:41,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539720494] [2021-03-10 21:51:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:41,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539720494] [2021-03-10 21:51:41,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230751505] [2021-03-10 21:51:41,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:41,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:41,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:41,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:41,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:42,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:42,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:42,044 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:42,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:42,070 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-03-10 21:51:42,161 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[o_4]} [2021-03-10 21:51:42,164 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:42,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,168 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:42,169 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,172 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:42,173 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,176 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:42,176 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:42,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:42,235 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:42,239 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:42,243 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:42,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:42,247 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:42,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:42,297 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:42,297 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:193, output treesize:85 [2021-03-10 21:51:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:42,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:42,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:42,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449267174] [2021-03-10 21:51:42,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:42,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:42,456 INFO L87 Difference]: Start difference. First operand 314 states and 938 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:42,961 INFO L93 Difference]: Finished difference Result 431 states and 1272 transitions. [2021-03-10 21:51:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:51:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:42,963 INFO L225 Difference]: With dead ends: 431 [2021-03-10 21:51:42,963 INFO L226 Difference]: Without dead ends: 416 [2021-03-10 21:51:42,963 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 532.9ms TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:51:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-03-10 21:51:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 312. [2021-03-10 21:51:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.9935691318327975) internal successors, (931), 311 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 931 transitions. [2021-03-10 21:51:42,968 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 931 transitions. Word has length 20 [2021-03-10 21:51:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:42,968 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 931 transitions. [2021-03-10 21:51:42,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 931 transitions. [2021-03-10 21:51:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:42,969 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:42,969 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:43,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable668 [2021-03-10 21:51:43,180 INFO L428 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1548954724, now seen corresponding path program 51 times [2021-03-10 21:51:43,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:43,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781447822] [2021-03-10 21:51:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:43,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781447822] [2021-03-10 21:51:43,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161498826] [2021-03-10 21:51:43,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:43,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:51:43,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:43,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:43,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:43,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:43,432 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:43,436 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:43,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:43,476 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:69 [2021-03-10 21:51:43,720 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:43,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:43,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:43,732 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:43,738 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:43,743 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:43,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:43,832 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:43,838 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:43,849 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:43,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:43,853 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:43,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:43,938 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:43,938 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:193, output treesize:89 [2021-03-10 21:51:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:44,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:44,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:44,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236568276] [2021-03-10 21:51:44,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:44,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:44,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:44,119 INFO L87 Difference]: Start difference. First operand 312 states and 931 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:44,723 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-03-10 21:51:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:44,746 INFO L93 Difference]: Finished difference Result 399 states and 1152 transitions. [2021-03-10 21:51:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:44,748 INFO L225 Difference]: With dead ends: 399 [2021-03-10 21:51:44,748 INFO L226 Difference]: Without dead ends: 369 [2021-03-10 21:51:44,748 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 656.2ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-03-10 21:51:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 309. [2021-03-10 21:51:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.987012987012987) internal successors, (920), 308 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 920 transitions. [2021-03-10 21:51:44,752 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 920 transitions. Word has length 20 [2021-03-10 21:51:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:44,752 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 920 transitions. [2021-03-10 21:51:44,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 920 transitions. [2021-03-10 21:51:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:44,754 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:44,754 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:44,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680,52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:44,969 INFO L428 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash -44652846, now seen corresponding path program 52 times [2021-03-10 21:51:44,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:44,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985385856] [2021-03-10 21:51:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:45,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985385856] [2021-03-10 21:51:45,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769269522] [2021-03-10 21:51:45,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:45,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:45,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:45,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:45,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:45,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:45,204 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:45,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:45,208 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:45,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:45,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:51:45,247 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:69 [2021-03-10 21:51:45,330 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:51:45,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:45,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:45,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:45,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:45,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:45,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:45,385 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:45,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:45,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:45,390 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:45,425 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:45,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:45,427 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:41 [2021-03-10 21:51:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:45,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:45,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:45,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686541603] [2021-03-10 21:51:45,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:45,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:45,577 INFO L87 Difference]: Start difference. First operand 309 states and 920 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:45,897 INFO L93 Difference]: Finished difference Result 396 states and 1158 transitions. [2021-03-10 21:51:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:45,899 INFO L225 Difference]: With dead ends: 396 [2021-03-10 21:51:45,899 INFO L226 Difference]: Without dead ends: 381 [2021-03-10 21:51:45,900 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 372.8ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-03-10 21:51:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 308. [2021-03-10 21:51:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.980456026058632) internal successors, (915), 307 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 915 transitions. [2021-03-10 21:51:45,906 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 915 transitions. Word has length 20 [2021-03-10 21:51:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:45,906 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 915 transitions. [2021-03-10 21:51:45,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 915 transitions. [2021-03-10 21:51:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:45,906 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:45,907 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:46,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:46,119 INFO L428 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash -930692556, now seen corresponding path program 53 times [2021-03-10 21:51:46,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:46,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565651230] [2021-03-10 21:51:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:46,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565651230] [2021-03-10 21:51:46,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212356920] [2021-03-10 21:51:46,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:46,274 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:51:46,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:46,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:46,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:46,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:46,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:46,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:46,353 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:46,354 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2021-03-10 21:51:46,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:46,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:46,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:46,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:46,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:46,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:46,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:46,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:46,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:46,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:46,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:46,413 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:46,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:46,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:46,416 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:46,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:46,440 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:46,440 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:35 [2021-03-10 21:51:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:46,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:46,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:46,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330592635] [2021-03-10 21:51:46,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:46,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:46,525 INFO L87 Difference]: Start difference. First operand 308 states and 915 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:46,804 INFO L93 Difference]: Finished difference Result 369 states and 1088 transitions. [2021-03-10 21:51:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:46,805 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:46,805 INFO L225 Difference]: With dead ends: 369 [2021-03-10 21:51:46,805 INFO L226 Difference]: Without dead ends: 354 [2021-03-10 21:51:46,806 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 267.5ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-03-10 21:51:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 305. [2021-03-10 21:51:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.9835526315789473) internal successors, (907), 304 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 907 transitions. [2021-03-10 21:51:46,809 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 907 transitions. Word has length 20 [2021-03-10 21:51:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:46,809 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 907 transitions. [2021-03-10 21:51:46,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 907 transitions. [2021-03-10 21:51:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:46,810 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:46,810 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:47,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable713 [2021-03-10 21:51:47,011 INFO L428 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1645290058, now seen corresponding path program 54 times [2021-03-10 21:51:47,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:47,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105109528] [2021-03-10 21:51:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:47,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105109528] [2021-03-10 21:51:47,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927130564] [2021-03-10 21:51:47,147 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:47,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:51:47,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:47,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:47,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:47,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:47,220 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:47,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:47,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:47,229 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-03-10 21:51:47,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:47,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:47,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:47,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:47,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:47,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:47,260 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:47,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:47,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:47,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:47,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:47,294 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:47,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:47,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:47,297 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:47,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:47,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:47,326 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:41 [2021-03-10 21:51:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:47,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:47,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:47,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419611560] [2021-03-10 21:51:47,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:47,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:47,447 INFO L87 Difference]: Start difference. First operand 305 states and 907 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:47,812 INFO L93 Difference]: Finished difference Result 458 states and 1355 transitions. [2021-03-10 21:51:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:51:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:47,813 INFO L225 Difference]: With dead ends: 458 [2021-03-10 21:51:47,813 INFO L226 Difference]: Without dead ends: 443 [2021-03-10 21:51:47,813 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 337.2ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:51:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-03-10 21:51:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 304. [2021-03-10 21:51:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.98019801980198) internal successors, (903), 303 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 903 transitions. [2021-03-10 21:51:47,818 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 903 transitions. Word has length 20 [2021-03-10 21:51:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:47,818 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 903 transitions. [2021-03-10 21:51:47,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 903 transitions. [2021-03-10 21:51:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:47,819 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:47,819 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:48,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable720 [2021-03-10 21:51:48,019 INFO L428 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1253290060, now seen corresponding path program 55 times [2021-03-10 21:51:48,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:48,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141931268] [2021-03-10 21:51:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:48,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141931268] [2021-03-10 21:51:48,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612385849] [2021-03-10 21:51:48,151 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:48,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:48,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:48,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:48,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:48,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:48,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:48,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:48,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:48,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:48,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:48,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:48,266 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-03-10 21:51:48,376 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[o_0]} [2021-03-10 21:51:48,380 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:48,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:48,384 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:48,385 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:48,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:48,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:48,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:48,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:48,418 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:48,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:48,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:51:48,422 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:48,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:48,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:48,448 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:33 [2021-03-10 21:51:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:48,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:48,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:48,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994867895] [2021-03-10 21:51:48,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:48,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:48,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:48,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:48,558 INFO L87 Difference]: Start difference. First operand 304 states and 903 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:49,047 INFO L93 Difference]: Finished difference Result 421 states and 1246 transitions. [2021-03-10 21:51:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:51:49,047 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:49,048 INFO L225 Difference]: With dead ends: 421 [2021-03-10 21:51:49,048 INFO L226 Difference]: Without dead ends: 406 [2021-03-10 21:51:49,049 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 437.1ms TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:51:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-03-10 21:51:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 310. [2021-03-10 21:51:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.9902912621359223) internal successors, (924), 309 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 924 transitions. [2021-03-10 21:51:49,054 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 924 transitions. Word has length 20 [2021-03-10 21:51:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:49,054 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 924 transitions. [2021-03-10 21:51:49,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 924 transitions. [2021-03-10 21:51:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:49,055 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:49,055 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:49,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:49,255 INFO L428 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:49,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1711749074, now seen corresponding path program 56 times [2021-03-10 21:51:49,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:49,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805875805] [2021-03-10 21:51:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:49,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805875805] [2021-03-10 21:51:49,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281473823] [2021-03-10 21:51:49,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:49,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:49,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:49,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:49,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:49,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:49,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:49,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:49,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:49,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:49,479 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2021-03-10 21:51:49,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:49,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:51:49,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:49,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:49,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:49,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:49,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:49,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:49,534 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:49,534 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2021-03-10 21:51:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:49,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:49,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:51:49,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291104705] [2021-03-10 21:51:49,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:51:49,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:51:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:51:49,563 INFO L87 Difference]: Start difference. First operand 310 states and 924 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) [2021-03-10 21:51:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:49,733 INFO L93 Difference]: Finished difference Result 376 states and 1104 transitions. [2021-03-10 21:51:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:51:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 20 [2021-03-10 21:51:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:49,735 INFO L225 Difference]: With dead ends: 376 [2021-03-10 21:51:49,735 INFO L226 Difference]: Without dead ends: 361 [2021-03-10 21:51:49,735 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 171.6ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:51:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-03-10 21:51:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 307. [2021-03-10 21:51:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 2.980392156862745) internal successors, (912), 306 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 912 transitions. [2021-03-10 21:51:49,739 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 912 transitions. Word has length 20 [2021-03-10 21:51:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:49,739 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 912 transitions. [2021-03-10 21:51:49,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) [2021-03-10 21:51:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 912 transitions. [2021-03-10 21:51:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:49,740 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:49,740 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:49,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735,57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:49,940 INFO L428 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash 796667586, now seen corresponding path program 57 times [2021-03-10 21:51:49,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:49,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886451941] [2021-03-10 21:51:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:50,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886451941] [2021-03-10 21:51:50,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492156364] [2021-03-10 21:51:50,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:50,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-03-10 21:51:50,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:50,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:50,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:50,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:50,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:50,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:50,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:51:50,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-03-10 21:51:50,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:50,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:50,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:50,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:50,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:50,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:51:50,241 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:50,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:50,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:50,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:50,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:50,285 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:50,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:51:50,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:51:50,289 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:50,323 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:50,325 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:50,325 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:41 [2021-03-10 21:51:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:50,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:50,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:51:50,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746421752] [2021-03-10 21:51:50,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:51:50,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:51:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:50,470 INFO L87 Difference]: Start difference. First operand 307 states and 912 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:50,765 INFO L93 Difference]: Finished difference Result 431 states and 1284 transitions. [2021-03-10 21:51:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:51:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:51:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:50,767 INFO L225 Difference]: With dead ends: 431 [2021-03-10 21:51:50,767 INFO L226 Difference]: Without dead ends: 416 [2021-03-10 21:51:50,767 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 392.3ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:51:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-03-10 21:51:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 303. [2021-03-10 21:51:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.980132450331126) internal successors, (900), 302 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 900 transitions. [2021-03-10 21:51:50,774 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 900 transitions. Word has length 20 [2021-03-10 21:51:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:50,774 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 900 transitions. [2021-03-10 21:51:50,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:51:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 900 transitions. [2021-03-10 21:51:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:50,775 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:50,775 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:50,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:50,995 INFO L428 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -722189394, now seen corresponding path program 58 times [2021-03-10 21:51:50,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:50,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114910519] [2021-03-10 21:51:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:51,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114910519] [2021-03-10 21:51:51,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392951741] [2021-03-10 21:51:51,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:51,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:51,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:51,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:51,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:51,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:51,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:51,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:51,204 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:51,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:51,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:51,230 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:51,351 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:51,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:51,353 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:51,354 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:51,364 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:51,364 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:51,365 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:51,365 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:51:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:51,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:51,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:51,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330665114] [2021-03-10 21:51:51,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:51,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:51,420 INFO L87 Difference]: Start difference. First operand 303 states and 900 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:51,856 INFO L93 Difference]: Finished difference Result 477 states and 1414 transitions. [2021-03-10 21:51:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:51:51,857 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:51,858 INFO L225 Difference]: With dead ends: 477 [2021-03-10 21:51:51,858 INFO L226 Difference]: Without dead ends: 462 [2021-03-10 21:51:51,858 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 467.7ms TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:51:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-03-10 21:51:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 320. [2021-03-10 21:51:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.9968652037617556) internal successors, (956), 319 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 956 transitions. [2021-03-10 21:51:51,865 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 956 transitions. Word has length 20 [2021-03-10 21:51:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:51,865 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 956 transitions. [2021-03-10 21:51:51,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 956 transitions. [2021-03-10 21:51:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:51,866 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:51,866 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:52,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable741 [2021-03-10 21:51:52,087 INFO L428 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1223980730, now seen corresponding path program 59 times [2021-03-10 21:51:52,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:52,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231565180] [2021-03-10 21:51:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:52,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231565180] [2021-03-10 21:51:52,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675652613] [2021-03-10 21:51:52,196 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:52,223 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:51:52,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:52,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:52,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:52,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:52,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:52,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:52,275 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:52,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:52,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:52,303 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:52,386 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:52,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:52,389 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:52,390 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:52,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:52,406 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:52,406 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:52,406 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:51:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:52,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:52,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:52,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019411623] [2021-03-10 21:51:52,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:52,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:52,514 INFO L87 Difference]: Start difference. First operand 320 states and 956 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:52,950 INFO L93 Difference]: Finished difference Result 412 states and 1213 transitions. [2021-03-10 21:51:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:52,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:52,956 INFO L225 Difference]: With dead ends: 412 [2021-03-10 21:51:52,956 INFO L226 Difference]: Without dead ends: 397 [2021-03-10 21:51:52,956 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 381.2ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:51:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-03-10 21:51:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 318. [2021-03-10 21:51:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.993690851735016) internal successors, (949), 317 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 949 transitions. [2021-03-10 21:51:52,962 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 949 transitions. Word has length 20 [2021-03-10 21:51:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:52,963 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 949 transitions. [2021-03-10 21:51:52,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 949 transitions. [2021-03-10 21:51:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:52,963 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:52,964 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:53,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:53,186 INFO L428 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1539141422, now seen corresponding path program 60 times [2021-03-10 21:51:53,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:53,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777104706] [2021-03-10 21:51:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:53,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777104706] [2021-03-10 21:51:53,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681717500] [2021-03-10 21:51:53,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:51:53,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:51:53,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:53,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:51:53,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:53,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:53,367 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:53,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:53,370 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:53,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:53,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:53,391 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:53,473 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:53,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:53,476 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:53,477 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:53,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:53,526 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:53,527 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:53,529 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:53,530 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:53,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:53,571 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:53,571 INFO L518 ElimStorePlain]: Eliminatee v_prenex_120 vanished before elimination [2021-03-10 21:51:53,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:51:53,572 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:89 [2021-03-10 21:51:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:53,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:53,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:53,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620284450] [2021-03-10 21:51:53,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:53,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:53,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:53,723 INFO L87 Difference]: Start difference. First operand 318 states and 949 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:54,142 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-03-10 21:51:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:54,156 INFO L93 Difference]: Finished difference Result 437 states and 1266 transitions. [2021-03-10 21:51:54,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:51:54,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:54,157 INFO L225 Difference]: With dead ends: 437 [2021-03-10 21:51:54,157 INFO L226 Difference]: Without dead ends: 407 [2021-03-10 21:51:54,158 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 528.2ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:51:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-03-10 21:51:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 315. [2021-03-10 21:51:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 2.9872611464968153) internal successors, (938), 314 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 938 transitions. [2021-03-10 21:51:54,162 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 938 transitions. Word has length 20 [2021-03-10 21:51:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:54,162 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 938 transitions. [2021-03-10 21:51:54,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 938 transitions. [2021-03-10 21:51:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:54,163 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:54,163 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:54,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable761 [2021-03-10 21:51:54,364 INFO L428 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:54,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523996, now seen corresponding path program 61 times [2021-03-10 21:51:54,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:54,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389960170] [2021-03-10 21:51:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:54,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389960170] [2021-03-10 21:51:54,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023069672] [2021-03-10 21:51:54,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:54,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:54,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:54,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:54,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:54,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:54,540 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:54,560 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:54,561 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:54,561 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:54,604 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:54,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:54,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:54,627 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:54,629 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:54,630 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:54,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:54,650 INFO L518 ElimStorePlain]: Eliminatee v_prenex_122 vanished before elimination [2021-03-10 21:51:54,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:54,651 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:51:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:54,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:54,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:54,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514677712] [2021-03-10 21:51:54,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:54,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:54,795 INFO L87 Difference]: Start difference. First operand 315 states and 938 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:55,335 INFO L93 Difference]: Finished difference Result 514 states and 1521 transitions. [2021-03-10 21:51:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:51:55,336 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:55,336 INFO L225 Difference]: With dead ends: 514 [2021-03-10 21:51:55,336 INFO L226 Difference]: Without dead ends: 499 [2021-03-10 21:51:55,337 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 445.0ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:51:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-03-10 21:51:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 314. [2021-03-10 21:51:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.9808306709265175) internal successors, (933), 313 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 933 transitions. [2021-03-10 21:51:55,341 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 933 transitions. Word has length 20 [2021-03-10 21:51:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:55,341 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 933 transitions. [2021-03-10 21:51:55,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 933 transitions. [2021-03-10 21:51:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:55,342 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:55,342 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:55,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable773 [2021-03-10 21:51:55,542 INFO L428 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2137563706, now seen corresponding path program 62 times [2021-03-10 21:51:55,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:55,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575579036] [2021-03-10 21:51:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:55,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575579036] [2021-03-10 21:51:55,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950993964] [2021-03-10 21:51:55,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:55,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:51:55,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:55,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:51:55,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:55,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:55,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:55,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:55,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:55,725 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:51:55,742 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:55,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:55,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:55,749 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:55,749 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:55,749 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2021-03-10 21:51:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:55,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:55,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:51:55,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565871160] [2021-03-10 21:51:55,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:51:55,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:51:55,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:51:55,766 INFO L87 Difference]: Start difference. First operand 314 states and 933 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:55,936 INFO L93 Difference]: Finished difference Result 407 states and 1202 transitions. [2021-03-10 21:51:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:51:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:55,938 INFO L225 Difference]: With dead ends: 407 [2021-03-10 21:51:55,938 INFO L226 Difference]: Without dead ends: 392 [2021-03-10 21:51:55,939 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 125.1ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:51:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-03-10 21:51:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 311. [2021-03-10 21:51:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 2.9838709677419355) internal successors, (925), 310 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 925 transitions. [2021-03-10 21:51:55,945 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 925 transitions. Word has length 20 [2021-03-10 21:51:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:55,945 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 925 transitions. [2021-03-10 21:51:55,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 925 transitions. [2021-03-10 21:51:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:55,946 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:55,946 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:56,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780,63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:56,159 INFO L428 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 438418908, now seen corresponding path program 63 times [2021-03-10 21:51:56,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:56,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690794985] [2021-03-10 21:51:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:56,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690794985] [2021-03-10 21:51:56,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31541622] [2021-03-10 21:51:56,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:56,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:51:56,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:56,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:56,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:56,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:56,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:56,335 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:56,335 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:56,335 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:51:56,355 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:56,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:56,359 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:56,360 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:56,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:56,381 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:56,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:56,382 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:51:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:56,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:56,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:56,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017987626] [2021-03-10 21:51:56,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:56,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:56,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:56,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:56,502 INFO L87 Difference]: Start difference. First operand 311 states and 925 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:56,770 INFO L93 Difference]: Finished difference Result 433 states and 1270 transitions. [2021-03-10 21:51:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:56,771 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:56,772 INFO L225 Difference]: With dead ends: 433 [2021-03-10 21:51:56,773 INFO L226 Difference]: Without dead ends: 418 [2021-03-10 21:51:56,773 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 255.0ms TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:51:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-03-10 21:51:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 310. [2021-03-10 21:51:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.9805825242718447) internal successors, (921), 309 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 921 transitions. [2021-03-10 21:51:56,779 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 921 transitions. Word has length 20 [2021-03-10 21:51:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:56,779 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 921 transitions. [2021-03-10 21:51:56,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 921 transitions. [2021-03-10 21:51:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:56,780 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:56,780 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:57,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:57,002 INFO L428 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -460350802, now seen corresponding path program 64 times [2021-03-10 21:51:57,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:57,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816818950] [2021-03-10 21:51:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:57,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816818950] [2021-03-10 21:51:57,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418089594] [2021-03-10 21:51:57,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:57,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:51:57,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:57,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:57,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:57,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:57,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:57,156 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,156 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2021-03-10 21:51:57,170 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:57,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,173 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:57,174 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:57,193 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:57,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:57,193 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:35 [2021-03-10 21:51:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:57,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:57,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:51:57,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781716178] [2021-03-10 21:51:57,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:51:57,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:51:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:51:57,272 INFO L87 Difference]: Start difference. First operand 310 states and 921 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:57,497 INFO L93 Difference]: Finished difference Result 511 states and 1507 transitions. [2021-03-10 21:51:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:51:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 20 [2021-03-10 21:51:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:57,499 INFO L225 Difference]: With dead ends: 511 [2021-03-10 21:51:57,499 INFO L226 Difference]: Without dead ends: 496 [2021-03-10 21:51:57,500 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 231.2ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:51:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-03-10 21:51:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 305. [2021-03-10 21:51:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.986842105263158) internal successors, (908), 304 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 908 transitions. [2021-03-10 21:51:57,506 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 908 transitions. Word has length 20 [2021-03-10 21:51:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:57,506 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 908 transitions. [2021-03-10 21:51:57,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 908 transitions. [2021-03-10 21:51:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:57,507 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:57,507 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:57,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable786 [2021-03-10 21:51:57,723 INFO L428 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:57,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1074885762, now seen corresponding path program 65 times [2021-03-10 21:51:57,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:57,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788095677] [2021-03-10 21:51:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:57,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788095677] [2021-03-10 21:51:57,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53010357] [2021-03-10 21:51:57,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:57,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:51:57,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:57,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:57,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:57,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:57,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:57,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:51:57,930 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:57,931 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,946 INFO L388 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 20 treesize of output 16 [2021-03-10 21:51:57,949 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:57,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:57,975 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:51:57,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:57,976 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:51:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:58,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:58,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:51:58,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562773219] [2021-03-10 21:51:58,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:51:58,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:51:58,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:51:58,115 INFO L87 Difference]: Start difference. First operand 305 states and 908 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:51:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:58,684 INFO L93 Difference]: Finished difference Result 621 states and 1830 transitions. [2021-03-10 21:51:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:51:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 20 [2021-03-10 21:51:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:58,686 INFO L225 Difference]: With dead ends: 621 [2021-03-10 21:51:58,686 INFO L226 Difference]: Without dead ends: 606 [2021-03-10 21:51:58,686 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 464.1ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:51:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-03-10 21:51:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 303. [2021-03-10 21:51:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.980132450331126) internal successors, (900), 302 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 900 transitions. [2021-03-10 21:51:58,694 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 900 transitions. Word has length 20 [2021-03-10 21:51:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:58,694 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 900 transitions. [2021-03-10 21:51:58,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:51:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 900 transitions. [2021-03-10 21:51:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:58,695 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:58,695 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:58,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable790 [2021-03-10 21:51:58,911 INFO L428 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1297313230, now seen corresponding path program 66 times [2021-03-10 21:51:58,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:58,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527029492] [2021-03-10 21:51:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:51:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:59,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527029492] [2021-03-10 21:51:59,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611126417] [2021-03-10 21:51:59,033 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:51:59,055 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:51:59,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:51:59,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:51:59,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:51:59,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:59,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:59,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:51:59,098 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:59,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:59,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:59,120 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:51:59,201 INFO L388 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 30 treesize of output 24 [2021-03-10 21:51:59,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:59,204 INFO L388 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 21 treesize of output 17 [2021-03-10 21:51:59,205 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:51:59,218 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:51:59,218 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:51:59,219 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:51:59,219 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:51:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:51:59,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:51:59,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:51:59,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356232889] [2021-03-10 21:51:59,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:51:59,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:51:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:51:59,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:51:59,315 INFO L87 Difference]: Start difference. First operand 303 states and 900 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:51:59,777 INFO L93 Difference]: Finished difference Result 452 states and 1338 transitions. [2021-03-10 21:51:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:51:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:51:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:51:59,778 INFO L225 Difference]: With dead ends: 452 [2021-03-10 21:51:59,778 INFO L226 Difference]: Without dead ends: 437 [2021-03-10 21:51:59,778 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 460.1ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:51:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-03-10 21:51:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 315. [2021-03-10 21:51:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 2.9904458598726116) internal successors, (939), 314 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 939 transitions. [2021-03-10 21:51:59,783 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 939 transitions. Word has length 20 [2021-03-10 21:51:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:51:59,783 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 939 transitions. [2021-03-10 21:51:59,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:51:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 939 transitions. [2021-03-10 21:51:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:51:59,784 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:51:59,784 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:51:59,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable795 [2021-03-10 21:51:59,984 INFO L428 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:51:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:51:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash -32614932, now seen corresponding path program 67 times [2021-03-10 21:51:59,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:51:59,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254297791] [2021-03-10 21:51:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:51:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:00,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254297791] [2021-03-10 21:52:00,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157047600] [2021-03-10 21:52:00,102 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:00,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:00,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:00,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:00,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:00,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:00,170 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:00,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:00,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:00,192 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:52:00,243 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:00,245 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:00,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:00,273 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:52:00,276 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:00,277 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:00,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:00,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_124 vanished before elimination [2021-03-10 21:52:00,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:00,303 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:52:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:00,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:00,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:00,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543646312] [2021-03-10 21:52:00,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:00,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:00,437 INFO L87 Difference]: Start difference. First operand 315 states and 939 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:00,954 INFO L93 Difference]: Finished difference Result 474 states and 1407 transitions. [2021-03-10 21:52:00,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:52:00,954 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:00,955 INFO L225 Difference]: With dead ends: 474 [2021-03-10 21:52:00,956 INFO L226 Difference]: Without dead ends: 459 [2021-03-10 21:52:00,956 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 436.0ms TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:52:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-03-10 21:52:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 312. [2021-03-10 21:52:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.9807073954983925) internal successors, (927), 311 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 927 transitions. [2021-03-10 21:52:00,960 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 927 transitions. Word has length 20 [2021-03-10 21:52:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:00,960 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 927 transitions. [2021-03-10 21:52:00,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 927 transitions. [2021-03-10 21:52:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:00,961 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:00,961 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:01,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:01,163 INFO L428 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:01,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:01,163 INFO L82 PathProgramCache]: Analyzing trace with hash -947696420, now seen corresponding path program 68 times [2021-03-10 21:52:01,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:01,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731951860] [2021-03-10 21:52:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:01,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731951860] [2021-03-10 21:52:01,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315962985] [2021-03-10 21:52:01,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:01,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:01,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:01,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:52:01,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:01,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:01,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:01,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:01,371 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:52:01,371 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:52:01,399 INFO L388 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 20 treesize of output 16 [2021-03-10 21:52:01,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:01,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:01,405 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:01,406 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:52:01,406 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:15 [2021-03-10 21:52:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:01,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:01,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:01,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88205100] [2021-03-10 21:52:01,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:01,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:01,474 INFO L87 Difference]: Start difference. First operand 312 states and 927 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:01,797 INFO L93 Difference]: Finished difference Result 436 states and 1287 transitions. [2021-03-10 21:52:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:01,799 INFO L225 Difference]: With dead ends: 436 [2021-03-10 21:52:01,799 INFO L226 Difference]: Without dead ends: 421 [2021-03-10 21:52:01,799 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 264.2ms TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-03-10 21:52:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 309. [2021-03-10 21:52:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.9805194805194803) internal successors, (918), 308 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 918 transitions. [2021-03-10 21:52:01,803 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 918 transitions. Word has length 20 [2021-03-10 21:52:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:01,803 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 918 transitions. [2021-03-10 21:52:01,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 918 transitions. [2021-03-10 21:52:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:01,804 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:01,804 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:02,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable811 [2021-03-10 21:52:02,006 INFO L428 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 537392906, now seen corresponding path program 69 times [2021-03-10 21:52:02,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:02,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627356813] [2021-03-10 21:52:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:02,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627356813] [2021-03-10 21:52:02,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595203355] [2021-03-10 21:52:02,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:02,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-03-10 21:52:02,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:02,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:02,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:02,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:02,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:02,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:02,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:52:02,159 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:52:02,180 INFO L388 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 20 treesize of output 16 [2021-03-10 21:52:02,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:02,183 INFO L388 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 20 treesize of output 16 [2021-03-10 21:52:02,184 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:02,205 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:02,205 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:02,206 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:02,206 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:52:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:02,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:02,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:52:02,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749192832] [2021-03-10 21:52:02,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:52:02,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:52:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:52:02,324 INFO L87 Difference]: Start difference. First operand 309 states and 918 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:52:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:02,792 INFO L93 Difference]: Finished difference Result 557 states and 1655 transitions. [2021-03-10 21:52:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:52:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 20 [2021-03-10 21:52:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:02,794 INFO L225 Difference]: With dead ends: 557 [2021-03-10 21:52:02,794 INFO L226 Difference]: Without dead ends: 542 [2021-03-10 21:52:02,794 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 393.2ms TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:52:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-03-10 21:52:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 309. [2021-03-10 21:52:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.9805194805194803) internal successors, (918), 308 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 918 transitions. [2021-03-10 21:52:02,799 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 918 transitions. Word has length 20 [2021-03-10 21:52:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 918 transitions. [2021-03-10 21:52:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:52:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 918 transitions. [2021-03-10 21:52:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:02,800 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:02,800 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:03,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:03,000 INFO L428 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1424757384, now seen corresponding path program 70 times [2021-03-10 21:52:03,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:03,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125964808] [2021-03-10 21:52:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:03,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125964808] [2021-03-10 21:52:03,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263864270] [2021-03-10 21:52:03,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:52:03,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:03,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:03,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:03,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:03,227 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:03,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:03,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:03,232 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:03,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:03,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:03,246 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:43 [2021-03-10 21:52:03,348 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:03,350 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:03,352 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:03,353 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:03,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:03,366 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:03,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:03,367 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:52:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:03,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:03,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:03,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601741292] [2021-03-10 21:52:03,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:03,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:03,438 INFO L87 Difference]: Start difference. First operand 309 states and 918 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:05,102 INFO L93 Difference]: Finished difference Result 868 states and 2567 transitions. [2021-03-10 21:52:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-03-10 21:52:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:05,104 INFO L225 Difference]: With dead ends: 868 [2021-03-10 21:52:05,104 INFO L226 Difference]: Without dead ends: 838 [2021-03-10 21:52:05,105 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1403.0ms TimeCoverageRelationStatistics Valid=401, Invalid=1951, Unknown=0, NotChecked=0, Total=2352 [2021-03-10 21:52:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-03-10 21:52:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 315. [2021-03-10 21:52:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 2.9808917197452227) internal successors, (936), 314 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 936 transitions. [2021-03-10 21:52:05,111 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 936 transitions. Word has length 20 [2021-03-10 21:52:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:05,111 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 936 transitions. [2021-03-10 21:52:05,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 936 transitions. [2021-03-10 21:52:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:05,112 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:05,112 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:05,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817,71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:05,312 INFO L428 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash -517942808, now seen corresponding path program 71 times [2021-03-10 21:52:05,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:05,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480903772] [2021-03-10 21:52:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:05,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480903772] [2021-03-10 21:52:05,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137681366] [2021-03-10 21:52:05,420 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:05,441 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:05,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:05,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:05,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:05,550 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:05,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:05,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:05,558 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:05,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:05,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:05,572 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:49 [2021-03-10 21:52:05,645 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:05,647 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:05,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:05,659 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:05,661 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:05,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:05,672 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:05,672 INFO L518 ElimStorePlain]: Eliminatee v_prenex_126 vanished before elimination [2021-03-10 21:52:05,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:05,673 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:27 [2021-03-10 21:52:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:05,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:05,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:05,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172355491] [2021-03-10 21:52:05,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:05,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:05,745 INFO L87 Difference]: Start difference. First operand 315 states and 936 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:06,893 INFO L93 Difference]: Finished difference Result 667 states and 1998 transitions. [2021-03-10 21:52:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 21:52:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:06,894 INFO L225 Difference]: With dead ends: 667 [2021-03-10 21:52:06,894 INFO L226 Difference]: Without dead ends: 637 [2021-03-10 21:52:06,895 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 977.1ms TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2021-03-10 21:52:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-03-10 21:52:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 321. [2021-03-10 21:52:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 2.990625) internal successors, (957), 320 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 957 transitions. [2021-03-10 21:52:06,900 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 957 transitions. Word has length 20 [2021-03-10 21:52:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:06,900 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 957 transitions. [2021-03-10 21:52:06,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 957 transitions. [2021-03-10 21:52:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:06,901 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:06,901 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:07,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826,72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:07,101 INFO L428 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:07,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1019734144, now seen corresponding path program 72 times [2021-03-10 21:52:07,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:07,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503284585] [2021-03-10 21:52:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:07,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503284585] [2021-03-10 21:52:07,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187761191] [2021-03-10 21:52:07,218 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:07,245 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:52:07,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:07,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:07,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:07,376 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:07,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:07,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:07,382 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:07,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:07,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:07,400 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:49 [2021-03-10 21:52:07,447 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:07,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:07,452 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:07,453 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:07,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:07,505 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:07,508 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:07,509 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:07,511 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:07,512 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:07,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:07,548 INFO L518 ElimStorePlain]: Eliminatee v_prenex_128 vanished before elimination [2021-03-10 21:52:07,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:07,549 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:85 [2021-03-10 21:52:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:07,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:07,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:07,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438720942] [2021-03-10 21:52:07,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:07,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:07,718 INFO L87 Difference]: Start difference. First operand 321 states and 957 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:08,750 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-03-10 21:52:09,004 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-03-10 21:52:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:09,044 INFO L93 Difference]: Finished difference Result 667 states and 1988 transitions. [2021-03-10 21:52:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-03-10 21:52:09,045 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:09,046 INFO L225 Difference]: With dead ends: 667 [2021-03-10 21:52:09,046 INFO L226 Difference]: Without dead ends: 637 [2021-03-10 21:52:09,046 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1256.0ms TimeCoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2021-03-10 21:52:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-03-10 21:52:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 318. [2021-03-10 21:52:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.9810725552050474) internal successors, (945), 317 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 945 transitions. [2021-03-10 21:52:09,054 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 945 transitions. Word has length 20 [2021-03-10 21:52:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:09,054 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 945 transitions. [2021-03-10 21:52:09,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 945 transitions. [2021-03-10 21:52:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:09,055 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:09,055 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:09,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:09,264 INFO L428 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1168449032, now seen corresponding path program 73 times [2021-03-10 21:52:09,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:09,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000638785] [2021-03-10 21:52:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:09,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000638785] [2021-03-10 21:52:09,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669900474] [2021-03-10 21:52:09,367 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:09,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:09,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:09,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:09,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:09,496 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:09,497 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:09,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:09,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:09,512 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:49 [2021-03-10 21:52:09,563 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:09,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:09,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:09,582 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:09,583 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:09,596 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:09,596 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:52:09,596 INFO L518 ElimStorePlain]: Eliminatee v_prenex_130 vanished before elimination [2021-03-10 21:52:09,596 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:09,597 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:33 [2021-03-10 21:52:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:09,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:09,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:09,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613561917] [2021-03-10 21:52:09,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:09,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:09,691 INFO L87 Difference]: Start difference. First operand 318 states and 945 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:10,837 INFO L93 Difference]: Finished difference Result 638 states and 1912 transitions. [2021-03-10 21:52:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 21:52:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:10,838 INFO L225 Difference]: With dead ends: 638 [2021-03-10 21:52:10,838 INFO L226 Difference]: Without dead ends: 608 [2021-03-10 21:52:10,839 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1009.3ms TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2021-03-10 21:52:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-03-10 21:52:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 312. [2021-03-10 21:52:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.9807073954983925) internal successors, (927), 311 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 927 transitions. [2021-03-10 21:52:10,844 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 927 transitions. Word has length 20 [2021-03-10 21:52:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:10,844 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 927 transitions. [2021-03-10 21:52:10,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 927 transitions. [2021-03-10 21:52:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:10,845 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:10,845 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:11,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:11,046 INFO L428 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2087081584, now seen corresponding path program 74 times [2021-03-10 21:52:11,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:11,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409590480] [2021-03-10 21:52:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:11,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409590480] [2021-03-10 21:52:11,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798228690] [2021-03-10 21:52:11,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:11,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:11,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:11,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:11,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:11,288 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:11,289 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:11,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:11,292 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:11,306 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:11,307 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:11,307 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:49 [2021-03-10 21:52:11,414 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:11,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:11,418 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:11,419 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:11,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:11,460 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:11,463 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:11,464 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:11,466 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:11,467 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:11,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:11,498 INFO L518 ElimStorePlain]: Eliminatee v_prenex_132 vanished before elimination [2021-03-10 21:52:11,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:11,499 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:73 [2021-03-10 21:52:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:11,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:11,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:11,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864024457] [2021-03-10 21:52:11,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:11,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:11,640 INFO L87 Difference]: Start difference. First operand 312 states and 927 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:12,766 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-03-10 21:52:13,019 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-03-10 21:52:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:13,044 INFO L93 Difference]: Finished difference Result 670 states and 2009 transitions. [2021-03-10 21:52:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-03-10 21:52:13,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:13,045 INFO L225 Difference]: With dead ends: 670 [2021-03-10 21:52:13,045 INFO L226 Difference]: Without dead ends: 640 [2021-03-10 21:52:13,046 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1210.0ms TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2021-03-10 21:52:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2021-03-10 21:52:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 322. [2021-03-10 21:52:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 2.9906542056074765) internal successors, (960), 321 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 960 transitions. [2021-03-10 21:52:13,054 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 960 transitions. Word has length 20 [2021-03-10 21:52:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:13,054 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 960 transitions. [2021-03-10 21:52:13,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 960 transitions. [2021-03-10 21:52:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:13,055 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:13,055 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:13,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable858 [2021-03-10 21:52:13,255 INFO L428 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1585290248, now seen corresponding path program 75 times [2021-03-10 21:52:13,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:13,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355850939] [2021-03-10 21:52:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:13,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355850939] [2021-03-10 21:52:13,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130282486] [2021-03-10 21:52:13,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:13,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:52:13,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:13,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:13,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:13,480 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:13,481 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:13,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:13,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:13,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:13,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:13,499 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:49 [2021-03-10 21:52:13,538 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:13,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:13,542 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:13,543 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:13,594 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:13,595 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:13,597 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:13,598 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:13,600 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:13,601 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:13,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:13,639 INFO L518 ElimStorePlain]: Eliminatee v_prenex_134 vanished before elimination [2021-03-10 21:52:13,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:13,640 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:85 [2021-03-10 21:52:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:13,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:13,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:13,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884673375] [2021-03-10 21:52:13,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:13,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:13,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:13,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:13,813 INFO L87 Difference]: Start difference. First operand 322 states and 960 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:14,566 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-03-10 21:52:14,804 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-03-10 21:52:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:14,838 INFO L93 Difference]: Finished difference Result 627 states and 1833 transitions. [2021-03-10 21:52:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-10 21:52:14,839 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:14,840 INFO L225 Difference]: With dead ends: 627 [2021-03-10 21:52:14,840 INFO L226 Difference]: Without dead ends: 597 [2021-03-10 21:52:14,840 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1029.8ms TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2021-03-10 21:52:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-03-10 21:52:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 328. [2021-03-10 21:52:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.9908256880733943) internal successors, (978), 327 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 978 transitions. [2021-03-10 21:52:14,846 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 978 transitions. Word has length 20 [2021-03-10 21:52:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:14,847 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 978 transitions. [2021-03-10 21:52:14,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 978 transitions. [2021-03-10 21:52:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:14,847 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:14,847 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:15,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:15,048 INFO L428 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash -521493872, now seen corresponding path program 76 times [2021-03-10 21:52:15,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:15,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053913998] [2021-03-10 21:52:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:15,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053913998] [2021-03-10 21:52:15,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839539664] [2021-03-10 21:52:15,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:15,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:15,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:15,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:15,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:15,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:15,279 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:15,280 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:15,294 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:15,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:15,295 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:49 [2021-03-10 21:52:15,333 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:15,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:15,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:15,350 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:52:15,352 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:15,353 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:15,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:15,366 INFO L518 ElimStorePlain]: Eliminatee v_prenex_136 vanished before elimination [2021-03-10 21:52:15,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:15,367 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:33 [2021-03-10 21:52:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:15,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:15,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:15,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341540280] [2021-03-10 21:52:15,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:15,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:15,459 INFO L87 Difference]: Start difference. First operand 328 states and 978 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:16,664 INFO L93 Difference]: Finished difference Result 674 states and 2023 transitions. [2021-03-10 21:52:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 21:52:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:16,666 INFO L225 Difference]: With dead ends: 674 [2021-03-10 21:52:16,666 INFO L226 Difference]: Without dead ends: 644 [2021-03-10 21:52:16,666 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 993.1ms TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2021-03-10 21:52:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-03-10 21:52:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 325. [2021-03-10 21:52:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.990740740740741) internal successors, (969), 324 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 969 transitions. [2021-03-10 21:52:16,673 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 969 transitions. Word has length 20 [2021-03-10 21:52:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:16,673 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 969 transitions. [2021-03-10 21:52:16,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 969 transitions. [2021-03-10 21:52:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:16,674 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:16,674 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:16,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878,77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:16,875 INFO L428 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash 518741926, now seen corresponding path program 77 times [2021-03-10 21:52:16,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:16,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220005822] [2021-03-10 21:52:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:16,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220005822] [2021-03-10 21:52:16,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110208563] [2021-03-10 21:52:16,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:16,989 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:52:16,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:16,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:16,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:17,072 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:17,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:17,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:17,076 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:17,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:17,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:17,088 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:43 [2021-03-10 21:52:17,146 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:17,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:17,150 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:17,150 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:17,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:17,164 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:52:17,165 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:17,165 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:52:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:17,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:17,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 21:52:17,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535242196] [2021-03-10 21:52:17,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 21:52:17,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 21:52:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:17,280 INFO L87 Difference]: Start difference. First operand 325 states and 969 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:18,601 INFO L93 Difference]: Finished difference Result 864 states and 2572 transitions. [2021-03-10 21:52:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 21:52:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:18,603 INFO L225 Difference]: With dead ends: 864 [2021-03-10 21:52:18,603 INFO L226 Difference]: Without dead ends: 834 [2021-03-10 21:52:18,603 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1074.1ms TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2021-03-10 21:52:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2021-03-10 21:52:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 334. [2021-03-10 21:52:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.990990990990991) internal successors, (996), 333 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 996 transitions. [2021-03-10 21:52:18,609 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 996 transitions. Word has length 20 [2021-03-10 21:52:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:18,609 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 996 transitions. [2021-03-10 21:52:18,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 996 transitions. [2021-03-10 21:52:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:18,610 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:18,610 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:18,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable886 [2021-03-10 21:52:18,810 INFO L428 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 409447658, now seen corresponding path program 78 times [2021-03-10 21:52:18,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:18,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355600860] [2021-03-10 21:52:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:18,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355600860] [2021-03-10 21:52:18,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118657138] [2021-03-10 21:52:18,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:18,943 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:52:18,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:18,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:18,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:18,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:18,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:18,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:18,970 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:18,988 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:18,989 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:18,989 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:52:19,125 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:19,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:19,128 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:19,129 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:19,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:19,139 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:19,140 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:19,140 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:52:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:19,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:19,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:19,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062533726] [2021-03-10 21:52:19,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:19,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:19,196 INFO L87 Difference]: Start difference. First operand 334 states and 996 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:19,978 INFO L93 Difference]: Finished difference Result 662 states and 1969 transitions. [2021-03-10 21:52:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 21:52:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:19,979 INFO L225 Difference]: With dead ends: 662 [2021-03-10 21:52:19,979 INFO L226 Difference]: Without dead ends: 632 [2021-03-10 21:52:19,979 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 733.3ms TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2021-03-10 21:52:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-03-10 21:52:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 338. [2021-03-10 21:52:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9910979228486645) internal successors, (1008), 337 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1008 transitions. [2021-03-10 21:52:19,985 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1008 transitions. Word has length 20 [2021-03-10 21:52:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:19,985 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1008 transitions. [2021-03-10 21:52:19,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1008 transitions. [2021-03-10 21:52:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:19,985 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:19,985 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:20,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable894 [2021-03-10 21:52:20,186 INFO L428 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1272688656, now seen corresponding path program 79 times [2021-03-10 21:52:20,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:20,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705531159] [2021-03-10 21:52:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:20,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705531159] [2021-03-10 21:52:20,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815743606] [2021-03-10 21:52:20,275 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:20,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:20,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:20,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:20,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:20,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:20,337 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:20,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:20,357 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:20,357 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:52:20,421 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:20,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:20,423 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:20,424 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:20,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:20,435 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:20,436 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:20,436 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:52:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:20,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:20,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:52:20,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919428829] [2021-03-10 21:52:20,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:52:20,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:52:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:52:20,491 INFO L87 Difference]: Start difference. First operand 338 states and 1008 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:20,677 INFO L93 Difference]: Finished difference Result 422 states and 1248 transitions. [2021-03-10 21:52:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:52:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:20,679 INFO L225 Difference]: With dead ends: 422 [2021-03-10 21:52:20,679 INFO L226 Difference]: Without dead ends: 407 [2021-03-10 21:52:20,679 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 232.9ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-03-10 21:52:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2021-03-10 21:52:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 2.997093023255814) internal successors, (1031), 344 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1031 transitions. [2021-03-10 21:52:20,683 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1031 transitions. Word has length 20 [2021-03-10 21:52:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:20,684 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 1031 transitions. [2021-03-10 21:52:20,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1031 transitions. [2021-03-10 21:52:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:20,684 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:20,684 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:20,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:20,885 INFO L428 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1538106478, now seen corresponding path program 80 times [2021-03-10 21:52:20,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:20,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419840440] [2021-03-10 21:52:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:20,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419840440] [2021-03-10 21:52:20,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376051066] [2021-03-10 21:52:20,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:20,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:20,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:21,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:21,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:21,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:21,036 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:21,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:21,039 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:21,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:21,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:21,060 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 21:52:21,102 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:21,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:21,106 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:21,106 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:21,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:21,157 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:21,160 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:21,161 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:21,163 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:21,164 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:21,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:21,207 INFO L518 ElimStorePlain]: Eliminatee v_prenex_138 vanished before elimination [2021-03-10 21:52:21,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:21,208 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:89 [2021-03-10 21:52:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:21,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:21,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:52:21,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763262234] [2021-03-10 21:52:21,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:52:21,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:52:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:52:21,363 INFO L87 Difference]: Start difference. First operand 345 states and 1031 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:21,748 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-03-10 21:52:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:21,758 INFO L93 Difference]: Finished difference Result 453 states and 1318 transitions. [2021-03-10 21:52:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:52:21,759 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 20 [2021-03-10 21:52:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:21,760 INFO L225 Difference]: With dead ends: 453 [2021-03-10 21:52:21,760 INFO L226 Difference]: Without dead ends: 423 [2021-03-10 21:52:21,760 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 451.9ms TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-03-10 21:52:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 342. [2021-03-10 21:52:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.9912023460410557) internal successors, (1020), 341 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1020 transitions. [2021-03-10 21:52:21,764 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1020 transitions. Word has length 20 [2021-03-10 21:52:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:21,765 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1020 transitions. [2021-03-10 21:52:21,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1020 transitions. [2021-03-10 21:52:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:21,765 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:21,765 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:21,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable909 [2021-03-10 21:52:21,966 INFO L428 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash 608064282, now seen corresponding path program 81 times [2021-03-10 21:52:21,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:21,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706259392] [2021-03-10 21:52:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:22,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706259392] [2021-03-10 21:52:22,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098287167] [2021-03-10 21:52:22,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:22,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:52:22,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:22,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:52:22,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:22,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:22,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:22,126 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,126 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2021-03-10 21:52:22,144 INFO L388 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 20 treesize of output 16 [2021-03-10 21:52:22,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:22,149 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:22,150 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,150 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2021-03-10 21:52:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:22,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:22,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 21:52:22,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109848641] [2021-03-10 21:52:22,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 21:52:22,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 21:52:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:52:22,167 INFO L87 Difference]: Start difference. First operand 342 states and 1020 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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) [2021-03-10 21:52:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:22,326 INFO L93 Difference]: Finished difference Result 423 states and 1250 transitions. [2021-03-10 21:52:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:52:22,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 20 [2021-03-10 21:52:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:22,327 INFO L225 Difference]: With dead ends: 423 [2021-03-10 21:52:22,328 INFO L226 Difference]: Without dead ends: 408 [2021-03-10 21:52:22,328 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 128.3ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:52:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-03-10 21:52:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 339. [2021-03-10 21:52:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.0059171597633134) internal successors, (1016), 338 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1016 transitions. [2021-03-10 21:52:22,331 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1016 transitions. Word has length 20 [2021-03-10 21:52:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:22,332 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 1016 transitions. [2021-03-10 21:52:22,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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) [2021-03-10 21:52:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1016 transitions. [2021-03-10 21:52:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:22,332 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:22,332 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:22,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:22,533 INFO L428 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash -18031684, now seen corresponding path program 82 times [2021-03-10 21:52:22,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:22,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481321123] [2021-03-10 21:52:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:22,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481321123] [2021-03-10 21:52:22,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110875488] [2021-03-10 21:52:22,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:22,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:22,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:22,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:22,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:22,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:22,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:22,713 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:22,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:22,736 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:52:22,836 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:22,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,839 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:22,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:22,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:22,851 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:22,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:22,852 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2021-03-10 21:52:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:22,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:22,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:22,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586739084] [2021-03-10 21:52:22,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:22,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:22,908 INFO L87 Difference]: Start difference. First operand 339 states and 1016 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:23,166 INFO L93 Difference]: Finished difference Result 460 states and 1352 transitions. [2021-03-10 21:52:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:52:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:23,167 INFO L225 Difference]: With dead ends: 460 [2021-03-10 21:52:23,167 INFO L226 Difference]: Without dead ends: 445 [2021-03-10 21:52:23,168 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 277.3ms TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-03-10 21:52:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 343. [2021-03-10 21:52:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.017543859649123) internal successors, (1032), 342 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1032 transitions. [2021-03-10 21:52:23,171 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1032 transitions. Word has length 20 [2021-03-10 21:52:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:23,172 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 1032 transitions. [2021-03-10 21:52:23,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1032 transitions. [2021-03-10 21:52:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:23,172 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:23,172 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:23,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918,83 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:23,373 INFO L428 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -519823020, now seen corresponding path program 83 times [2021-03-10 21:52:23,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:23,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201150138] [2021-03-10 21:52:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:23,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201150138] [2021-03-10 21:52:23,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932024907] [2021-03-10 21:52:23,522 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:23,549 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:52:23,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:23,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:23,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:23,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:23,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:23,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:23,610 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:23,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:23,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:23,639 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:52:23,728 INFO L388 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 30 treesize of output 24 [2021-03-10 21:52:23,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:23,732 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:23,733 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:23,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:23,750 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:23,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:23,751 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:52:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:23,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:23,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:23,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121699072] [2021-03-10 21:52:23,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:23,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:23,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:23,854 INFO L87 Difference]: Start difference. First operand 343 states and 1032 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:24,156 INFO L93 Difference]: Finished difference Result 510 states and 1509 transitions. [2021-03-10 21:52:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:24,157 INFO L225 Difference]: With dead ends: 510 [2021-03-10 21:52:24,157 INFO L226 Difference]: Without dead ends: 495 [2021-03-10 21:52:24,157 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 361.5ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-03-10 21:52:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 343. [2021-03-10 21:52:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.017543859649123) internal successors, (1032), 342 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1032 transitions. [2021-03-10 21:52:24,162 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1032 transitions. Word has length 20 [2021-03-10 21:52:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:24,162 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 1032 transitions. [2021-03-10 21:52:24,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1032 transitions. [2021-03-10 21:52:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:24,163 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:24,163 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:24,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:24,364 INFO L428 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2051668164, now seen corresponding path program 84 times [2021-03-10 21:52:24,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:24,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071203469] [2021-03-10 21:52:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:24,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071203469] [2021-03-10 21:52:24,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108510731] [2021-03-10 21:52:24,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:24,515 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:52:24,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:24,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:24,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:24,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:24,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:24,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:24,575 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:24,596 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:24,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:24,597 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:52:24,681 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:24,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:24,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:24,701 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:24,703 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:24,704 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:24,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:24,722 INFO L518 ElimStorePlain]: Eliminatee v_prenex_139 vanished before elimination [2021-03-10 21:52:24,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:24,723 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2021-03-10 21:52:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:24,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:24,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:24,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403950930] [2021-03-10 21:52:24,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:24,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:24,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:24,813 INFO L87 Difference]: Start difference. First operand 343 states and 1032 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:25,060 INFO L93 Difference]: Finished difference Result 531 states and 1574 transitions. [2021-03-10 21:52:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:25,061 INFO L225 Difference]: With dead ends: 531 [2021-03-10 21:52:25,061 INFO L226 Difference]: Without dead ends: 516 [2021-03-10 21:52:25,062 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 311.5ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-03-10 21:52:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 340. [2021-03-10 21:52:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.0117994100294987) internal successors, (1021), 339 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1021 transitions. [2021-03-10 21:52:25,066 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1021 transitions. Word has length 20 [2021-03-10 21:52:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:25,067 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 1021 transitions. [2021-03-10 21:52:25,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1021 transitions. [2021-03-10 21:52:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:25,067 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:25,067 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:25,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable934 [2021-03-10 21:52:25,268 INFO L428 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash -547366286, now seen corresponding path program 85 times [2021-03-10 21:52:25,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:25,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931581640] [2021-03-10 21:52:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:25,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931581640] [2021-03-10 21:52:25,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463027879] [2021-03-10 21:52:25,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:25,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:25,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:25,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:25,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:25,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:25,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:25,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:25,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:25,506 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:52:25,550 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:25,551 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:25,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:25,574 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:25,576 INFO L388 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 21 treesize of output 17 [2021-03-10 21:52:25,577 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:25,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:25,600 INFO L518 ElimStorePlain]: Eliminatee v_prenex_142 vanished before elimination [2021-03-10 21:52:25,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:25,601 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:52:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:25,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:25,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:25,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892786509] [2021-03-10 21:52:25,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:25,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:25,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:25,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:25,720 INFO L87 Difference]: Start difference. First operand 340 states and 1021 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:26,026 INFO L93 Difference]: Finished difference Result 528 states and 1563 transitions. [2021-03-10 21:52:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:26,028 INFO L225 Difference]: With dead ends: 528 [2021-03-10 21:52:26,028 INFO L226 Difference]: Without dead ends: 513 [2021-03-10 21:52:26,028 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 339.8ms TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-03-10 21:52:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 339. [2021-03-10 21:52:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.0059171597633134) internal successors, (1016), 338 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1016 transitions. [2021-03-10 21:52:26,032 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1016 transitions. Word has length 20 [2021-03-10 21:52:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:26,033 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 1016 transitions. [2021-03-10 21:52:26,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1016 transitions. [2021-03-10 21:52:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:26,033 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:26,033 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:26,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942,86 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:26,234 INFO L428 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1142576618, now seen corresponding path program 86 times [2021-03-10 21:52:26,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:26,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47698198] [2021-03-10 21:52:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:26,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47698198] [2021-03-10 21:52:26,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634862188] [2021-03-10 21:52:26,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:26,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:26,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:26,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:26,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:26,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:26,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:26,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:26,425 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:26,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:26,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:26,449 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:51 [2021-03-10 21:52:26,511 INFO L388 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 20 treesize of output 16 [2021-03-10 21:52:26,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:26,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:26,540 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:52:26,543 INFO L388 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 20 treesize of output 16 [2021-03-10 21:52:26,544 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:26,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:26,571 INFO L518 ElimStorePlain]: Eliminatee v_prenex_144 vanished before elimination [2021-03-10 21:52:26,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:26,572 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:41 [2021-03-10 21:52:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:26,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:26,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:52:26,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62611306] [2021-03-10 21:52:26,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:52:26,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:52:26,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:52:26,724 INFO L87 Difference]: Start difference. First operand 339 states and 1016 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:27,054 INFO L93 Difference]: Finished difference Result 526 states and 1528 transitions. [2021-03-10 21:52:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:52:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:52:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:27,055 INFO L225 Difference]: With dead ends: 526 [2021-03-10 21:52:27,055 INFO L226 Difference]: Without dead ends: 496 [2021-03-10 21:52:27,055 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 386.6ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-03-10 21:52:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 334. [2021-03-10 21:52:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.990990990990991) internal successors, (996), 333 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 996 transitions. [2021-03-10 21:52:27,060 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 996 transitions. Word has length 20 [2021-03-10 21:52:27,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:27,060 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 996 transitions. [2021-03-10 21:52:27,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 996 transitions. [2021-03-10 21:52:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:27,061 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:27,061 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:27,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949,87 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:27,261 INFO L428 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1692812560, now seen corresponding path program 87 times [2021-03-10 21:52:27,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:27,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287816878] [2021-03-10 21:52:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:27,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287816878] [2021-03-10 21:52:27,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28466311] [2021-03-10 21:52:27,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:27,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:52:27,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:27,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:27,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:27,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:27,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:27,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:52:27,640 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:27,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:27,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:27,674 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:81 [2021-03-10 21:52:27,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:27,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:27,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:27,890 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:27,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:27,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:27,974 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:27,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:27,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:27,978 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:28,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:28,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:28,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:28,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:28,060 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:28,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:28,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:28,064 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:28,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:28,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:28,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:28,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:28,139 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:28,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:28,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:28,144 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:28,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:28,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:28,213 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:197, output treesize:73 [2021-03-10 21:52:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:28,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:28,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:28,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643687896] [2021-03-10 21:52:28,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:28,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:28,316 INFO L87 Difference]: Start difference. First operand 334 states and 996 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:28,686 INFO L93 Difference]: Finished difference Result 401 states and 1186 transitions. [2021-03-10 21:52:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:28,688 INFO L225 Difference]: With dead ends: 401 [2021-03-10 21:52:28,688 INFO L226 Difference]: Without dead ends: 386 [2021-03-10 21:52:28,688 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 549.6ms TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-03-10 21:52:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 338. [2021-03-10 21:52:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9910979228486645) internal successors, (1008), 337 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1008 transitions. [2021-03-10 21:52:28,692 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1008 transitions. Word has length 20 [2021-03-10 21:52:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:28,692 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1008 transitions. [2021-03-10 21:52:28,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1008 transitions. [2021-03-10 21:52:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:28,693 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:28,693 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:28,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable960 [2021-03-10 21:52:28,895 INFO L428 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:28,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2100363400, now seen corresponding path program 88 times [2021-03-10 21:52:28,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:28,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569334806] [2021-03-10 21:52:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:29,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569334806] [2021-03-10 21:52:29,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136386299] [2021-03-10 21:52:29,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:29,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:29,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:29,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:29,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:29,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:29,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:29,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:52:29,235 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:29,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:29,268 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:29,268 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:81 [2021-03-10 21:52:29,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:29,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:29,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:29,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:29,387 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:29,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:29,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:29,420 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:29,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:29,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:29,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:29,450 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:29,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:29,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:29,477 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:99, output treesize:33 [2021-03-10 21:52:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:29,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:29,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:29,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370794911] [2021-03-10 21:52:29,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:29,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:29,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:29,586 INFO L87 Difference]: Start difference. First operand 338 states and 1008 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:29,927 INFO L93 Difference]: Finished difference Result 407 states and 1199 transitions. [2021-03-10 21:52:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:29,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:29,928 INFO L225 Difference]: With dead ends: 407 [2021-03-10 21:52:29,928 INFO L226 Difference]: Without dead ends: 392 [2021-03-10 21:52:29,928 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 409.5ms TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-03-10 21:52:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 338. [2021-03-10 21:52:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9910979228486645) internal successors, (1008), 337 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1008 transitions. [2021-03-10 21:52:29,933 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1008 transitions. Word has length 20 [2021-03-10 21:52:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:29,934 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1008 transitions. [2021-03-10 21:52:29,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1008 transitions. [2021-03-10 21:52:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:29,934 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:29,934 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:30,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976,89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:30,135 INFO L428 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -6420720, now seen corresponding path program 89 times [2021-03-10 21:52:30,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:30,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713149890] [2021-03-10 21:52:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:30,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713149890] [2021-03-10 21:52:30,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093719130] [2021-03-10 21:52:30,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:30,281 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:52:30,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:30,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:30,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:30,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:30,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:30,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:30,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:52:30,535 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:30,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:30,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:30,557 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:61 [2021-03-10 21:52:30,622 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:52:30,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:30,628 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:30,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:30,632 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:30,658 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:30,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:30,662 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:30,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:30,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:30,666 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:30,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:30,691 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:30,691 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:89, output treesize:33 [2021-03-10 21:52:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:30,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:30,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:30,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770634138] [2021-03-10 21:52:30,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:30,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:30,794 INFO L87 Difference]: Start difference. First operand 338 states and 1008 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:31,152 INFO L93 Difference]: Finished difference Result 398 states and 1177 transitions. [2021-03-10 21:52:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:31,153 INFO L225 Difference]: With dead ends: 398 [2021-03-10 21:52:31,153 INFO L226 Difference]: Without dead ends: 383 [2021-03-10 21:52:31,153 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 424.0ms TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-03-10 21:52:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 336. [2021-03-10 21:52:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.994029850746269) internal successors, (1003), 335 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1003 transitions. [2021-03-10 21:52:31,158 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1003 transitions. Word has length 20 [2021-03-10 21:52:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:31,158 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1003 transitions. [2021-03-10 21:52:31,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1003 transitions. [2021-03-10 21:52:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:31,159 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:31,159 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:31,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable994 [2021-03-10 21:52:31,359 INFO L428 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:31,360 INFO L82 PathProgramCache]: Analyzing trace with hash 29087378, now seen corresponding path program 90 times [2021-03-10 21:52:31,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:31,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46830732] [2021-03-10 21:52:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:31,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46830732] [2021-03-10 21:52:31,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596878525] [2021-03-10 21:52:31,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:31,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:52:31,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:31,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:31,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:31,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:31,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:31,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:31,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:31,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:31,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:31,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:31,679 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:31,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:31,686 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:52:32,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:32,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:32,242 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:32,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:32,344 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:32,348 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:32,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:32,432 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:32,436 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:32,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:32,511 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:32,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:32,515 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:32,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:32,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:32,583 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:197, output treesize:73 [2021-03-10 21:52:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:32,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:32,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:32,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824066833] [2021-03-10 21:52:32,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:32,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:32,686 INFO L87 Difference]: Start difference. First operand 336 states and 1003 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:33,251 INFO L93 Difference]: Finished difference Result 421 states and 1236 transitions. [2021-03-10 21:52:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:33,252 INFO L225 Difference]: With dead ends: 421 [2021-03-10 21:52:33,252 INFO L226 Difference]: Without dead ends: 406 [2021-03-10 21:52:33,253 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 606.7ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-03-10 21:52:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 340. [2021-03-10 21:52:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.005899705014749) internal successors, (1019), 339 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1019 transitions. [2021-03-10 21:52:33,257 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1019 transitions. Word has length 20 [2021-03-10 21:52:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:33,257 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 1019 transitions. [2021-03-10 21:52:33,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1019 transitions. [2021-03-10 21:52:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:33,257 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:33,257 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:33,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018,91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:33,458 INFO L428 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -472703958, now seen corresponding path program 91 times [2021-03-10 21:52:33,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:33,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430918150] [2021-03-10 21:52:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:33,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430918150] [2021-03-10 21:52:33,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465075583] [2021-03-10 21:52:33,617 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:33,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:33,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:33,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:33,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:33,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:33,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:33,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:33,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:33,732 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:33,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:33,771 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:33,771 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:52:34,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:34,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:34,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:34,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:34,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:34,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:34,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:34,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:34,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:34,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:34,225 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:34,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:34,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:34,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:34,253 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:34,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:34,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:34,281 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:89, output treesize:33 [2021-03-10 21:52:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:34,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:34,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:34,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357239120] [2021-03-10 21:52:34,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:34,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:34,384 INFO L87 Difference]: Start difference. First operand 340 states and 1019 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:34,823 INFO L93 Difference]: Finished difference Result 483 states and 1419 transitions. [2021-03-10 21:52:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:34,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:34,824 INFO L225 Difference]: With dead ends: 483 [2021-03-10 21:52:34,824 INFO L226 Difference]: Without dead ends: 468 [2021-03-10 21:52:34,824 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 506.6ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-03-10 21:52:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 340. [2021-03-10 21:52:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.005899705014749) internal successors, (1019), 339 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1019 transitions. [2021-03-10 21:52:34,834 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1019 transitions. Word has length 20 [2021-03-10 21:52:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:34,834 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 1019 transitions. [2021-03-10 21:52:34,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1019 transitions. [2021-03-10 21:52:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:34,834 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:34,835 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:35,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1078 [2021-03-10 21:52:35,038 INFO L428 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2004549102, now seen corresponding path program 92 times [2021-03-10 21:52:35,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:35,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133401438] [2021-03-10 21:52:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:35,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133401438] [2021-03-10 21:52:35,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185001702] [2021-03-10 21:52:35,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:35,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:35,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:35,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:35,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:35,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:35,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:35,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:35,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:35,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:35,336 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:35,336 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:52:35,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:35,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:35,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:35,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:35,793 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:35,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:35,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:35,832 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:35,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:35,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:35,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:35,868 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:35,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:35,900 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:35,900 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:97, output treesize:41 [2021-03-10 21:52:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:35,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:35,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:35,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014955697] [2021-03-10 21:52:35,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:35,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:35,996 INFO L87 Difference]: Start difference. First operand 340 states and 1019 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:36,265 INFO L93 Difference]: Finished difference Result 413 states and 1216 transitions. [2021-03-10 21:52:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:52:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:36,266 INFO L225 Difference]: With dead ends: 413 [2021-03-10 21:52:36,266 INFO L226 Difference]: Without dead ends: 398 [2021-03-10 21:52:36,266 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 399.4ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-03-10 21:52:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 337. [2021-03-10 21:52:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.0) internal successors, (1008), 336 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1008 transitions. [2021-03-10 21:52:36,270 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1008 transitions. Word has length 20 [2021-03-10 21:52:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:36,270 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 1008 transitions. [2021-03-10 21:52:36,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1008 transitions. [2021-03-10 21:52:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:36,271 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:36,271 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:36,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:36,474 INFO L428 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash -500247224, now seen corresponding path program 93 times [2021-03-10 21:52:36,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:36,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895087402] [2021-03-10 21:52:36,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:36,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895087402] [2021-03-10 21:52:36,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21147353] [2021-03-10 21:52:36,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:36,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:52:36,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:36,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:36,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:36,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:36,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:36,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:36,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:36,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:36,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:36,769 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:36,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:36,812 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:36,812 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:52:36,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:36,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:36,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:36,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:36,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:36,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:36,914 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,023 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-10 21:52:37,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:37,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:37,029 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:37,034 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,139 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-03-10 21:52:37,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:37,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:37,146 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:37,150 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:37,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:37,255 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:37,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:37,259 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:37,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:37,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:37,356 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:233, output treesize:107 [2021-03-10 21:52:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:37,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:37,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:37,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466808875] [2021-03-10 21:52:37,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:37,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:37,592 INFO L87 Difference]: Start difference. First operand 337 states and 1008 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:38,008 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 21:52:38,250 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2021-03-10 21:52:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:38,273 INFO L93 Difference]: Finished difference Result 513 states and 1499 transitions. [2021-03-10 21:52:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:38,275 INFO L225 Difference]: With dead ends: 513 [2021-03-10 21:52:38,275 INFO L226 Difference]: Without dead ends: 483 [2021-03-10 21:52:38,275 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 728.7ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:52:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-03-10 21:52:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 336. [2021-03-10 21:52:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.994029850746269) internal successors, (1003), 335 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1003 transitions. [2021-03-10 21:52:38,280 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1003 transitions. Word has length 20 [2021-03-10 21:52:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:38,280 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1003 transitions. [2021-03-10 21:52:38,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1003 transitions. [2021-03-10 21:52:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:38,280 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:38,280 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:38,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175,94 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:38,481 INFO L428 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -860261966, now seen corresponding path program 94 times [2021-03-10 21:52:38,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:38,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060215417] [2021-03-10 21:52:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:38,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060215417] [2021-03-10 21:52:38,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645049882] [2021-03-10 21:52:38,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:38,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:38,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:38,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:38,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:38,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:38,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:38,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:38,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:38,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:38,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:38,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:38,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:38,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:38,846 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:52:39,018 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:52:39,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:39,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:39,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:39,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:39,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:39,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:39,028 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:39,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:39,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:39,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:39,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:39,064 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:39,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:39,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:39,068 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:39,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:39,096 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:39,096 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:52:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:39,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:39,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:39,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526717587] [2021-03-10 21:52:39,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:39,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:39,196 INFO L87 Difference]: Start difference. First operand 336 states and 1003 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:39,562 INFO L93 Difference]: Finished difference Result 471 states and 1388 transitions. [2021-03-10 21:52:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:39,562 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:39,563 INFO L225 Difference]: With dead ends: 471 [2021-03-10 21:52:39,563 INFO L226 Difference]: Without dead ends: 456 [2021-03-10 21:52:39,563 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 467.4ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-03-10 21:52:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 339. [2021-03-10 21:52:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 3.002958579881657) internal successors, (1015), 338 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1015 transitions. [2021-03-10 21:52:39,568 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1015 transitions. Word has length 20 [2021-03-10 21:52:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:39,568 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 1015 transitions. [2021-03-10 21:52:39,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1015 transitions. [2021-03-10 21:52:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:39,568 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:39,568 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:39,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190,95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:39,769 INFO L428 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2104777168, now seen corresponding path program 95 times [2021-03-10 21:52:39,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:39,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188329577] [2021-03-10 21:52:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:39,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188329577] [2021-03-10 21:52:39,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84681384] [2021-03-10 21:52:39,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:39,947 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:39,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:39,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:39,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:40,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:40,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:40,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:40,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:40,077 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:40,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:40,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:40,109 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:69 [2021-03-10 21:52:40,189 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:52:40,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:40,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:40,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:40,199 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:40,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:40,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:40,238 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:40,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:40,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:40,242 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:40,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:40,276 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:40,276 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:41 [2021-03-10 21:52:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:40,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:40,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:40,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226830618] [2021-03-10 21:52:40,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:40,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:40,411 INFO L87 Difference]: Start difference. First operand 339 states and 1015 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:40,813 INFO L93 Difference]: Finished difference Result 475 states and 1412 transitions. [2021-03-10 21:52:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:40,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:40,815 INFO L225 Difference]: With dead ends: 475 [2021-03-10 21:52:40,815 INFO L226 Difference]: Without dead ends: 460 [2021-03-10 21:52:40,815 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 408.1ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-03-10 21:52:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 335. [2021-03-10 21:52:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.9910179640718564) internal successors, (999), 334 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 999 transitions. [2021-03-10 21:52:40,819 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 999 transitions. Word has length 20 [2021-03-10 21:52:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:40,819 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 999 transitions. [2021-03-10 21:52:40,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 999 transitions. [2021-03-10 21:52:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:40,820 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:40,820 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:41,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208,96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:41,021 INFO L428 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1726332322, now seen corresponding path program 96 times [2021-03-10 21:52:41,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:41,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480896289] [2021-03-10 21:52:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:41,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480896289] [2021-03-10 21:52:41,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816628080] [2021-03-10 21:52:41,188 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:41,216 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:52:41,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:41,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:41,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:41,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:41,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:41,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:41,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:41,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:41,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:41,355 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:83 [2021-03-10 21:52:41,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:41,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:41,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:41,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:41,896 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:41,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:41,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:41,924 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:41,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:41,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:41,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:41,950 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:41,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:41,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:41,973 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:83, output treesize:27 [2021-03-10 21:52:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:42,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:42,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:42,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290402567] [2021-03-10 21:52:42,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:42,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:42,045 INFO L87 Difference]: Start difference. First operand 335 states and 999 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:42,526 INFO L93 Difference]: Finished difference Result 402 states and 1189 transitions. [2021-03-10 21:52:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:52:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:42,527 INFO L225 Difference]: With dead ends: 402 [2021-03-10 21:52:42,527 INFO L226 Difference]: Without dead ends: 387 [2021-03-10 21:52:42,527 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 509.5ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-03-10 21:52:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 343. [2021-03-10 21:52:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.002923976608187) internal successors, (1027), 342 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1027 transitions. [2021-03-10 21:52:42,531 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1027 transitions. Word has length 20 [2021-03-10 21:52:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:42,531 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 1027 transitions. [2021-03-10 21:52:42,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1027 transitions. [2021-03-10 21:52:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:42,532 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:42,532 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:42,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1217 [2021-03-10 21:52:42,735 INFO L428 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1224540986, now seen corresponding path program 97 times [2021-03-10 21:52:42,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:42,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051158708] [2021-03-10 21:52:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:42,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051158708] [2021-03-10 21:52:42,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986227326] [2021-03-10 21:52:42,892 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:42,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:42,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:42,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:42,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:42,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:42,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:42,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:42,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:43,000 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:43,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:43,047 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:43,047 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:89 [2021-03-10 21:52:43,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:43,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:43,414 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:43,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:43,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:43,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:43,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:43,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:43,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:43,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:43,483 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:43,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:43,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:43,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:43,515 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:43,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:43,544 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:43,544 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:99, output treesize:39 [2021-03-10 21:52:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:43,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:43,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:43,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860242666] [2021-03-10 21:52:43,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:43,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:43,649 INFO L87 Difference]: Start difference. First operand 343 states and 1027 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:44,001 INFO L93 Difference]: Finished difference Result 464 states and 1372 transitions. [2021-03-10 21:52:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:44,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:44,007 INFO L225 Difference]: With dead ends: 464 [2021-03-10 21:52:44,007 INFO L226 Difference]: Without dead ends: 449 [2021-03-10 21:52:44,007 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 490.8ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-03-10 21:52:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 343. [2021-03-10 21:52:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.002923976608187) internal successors, (1027), 342 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1027 transitions. [2021-03-10 21:52:44,012 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1027 transitions. Word has length 20 [2021-03-10 21:52:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:44,012 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 1027 transitions. [2021-03-10 21:52:44,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1027 transitions. [2021-03-10 21:52:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:44,012 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:44,013 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:44,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1258 [2021-03-10 21:52:44,231 INFO L428 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash -307304158, now seen corresponding path program 98 times [2021-03-10 21:52:44,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:44,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879798196] [2021-03-10 21:52:44,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:44,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879798196] [2021-03-10 21:52:44,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450458425] [2021-03-10 21:52:44,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:44,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:44,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:44,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:44,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:44,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:44,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:44,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:44,472 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:44,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:44,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:44,476 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:44,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:44,518 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:44,518 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:83 [2021-03-10 21:52:44,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:44,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:44,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:44,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:44,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:44,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:44,935 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,044 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-03-10 21:52:45,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:45,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:45,052 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:45,058 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,164 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-03-10 21:52:45,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:45,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:45,172 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:45,177 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:45,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:45,281 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:45,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:45,287 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:45,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:45,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:45,383 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:201, output treesize:89 [2021-03-10 21:52:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:45,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:45,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:45,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817505650] [2021-03-10 21:52:45,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:45,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:45,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:45,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:45,573 INFO L87 Difference]: Start difference. First operand 343 states and 1027 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:46,110 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-03-10 21:52:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:46,132 INFO L93 Difference]: Finished difference Result 433 states and 1255 transitions. [2021-03-10 21:52:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:52:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:46,134 INFO L225 Difference]: With dead ends: 433 [2021-03-10 21:52:46,134 INFO L226 Difference]: Without dead ends: 403 [2021-03-10 21:52:46,134 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 649.8ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-03-10 21:52:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 340. [2021-03-10 21:52:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.9970501474926254) internal successors, (1016), 339 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1016 transitions. [2021-03-10 21:52:46,138 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1016 transitions. Word has length 20 [2021-03-10 21:52:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:46,138 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 1016 transitions. [2021-03-10 21:52:46,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1016 transitions. [2021-03-10 21:52:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:46,139 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:46,139 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:46,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:46,343 INFO L428 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1196997720, now seen corresponding path program 99 times [2021-03-10 21:52:46,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:46,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628342383] [2021-03-10 21:52:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:46,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628342383] [2021-03-10 21:52:46,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048346965] [2021-03-10 21:52:46,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:46,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:52:46,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:46,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:46,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:46,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:46,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:46,612 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:46,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:46,658 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:89 [2021-03-10 21:52:46,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:46,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:46,757 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,867 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-10 21:52:46,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:46,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:46,873 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:46,878 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,984 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-03-10 21:52:46,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:46,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:46,990 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:46,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:46,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:46,995 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:47,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:47,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:47,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:47,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:47,099 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:47,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:47,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:47,104 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:47,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:47,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:47,201 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:233, output treesize:107 [2021-03-10 21:52:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:47,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:47,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:47,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740689527] [2021-03-10 21:52:47,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:47,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:47,447 INFO L87 Difference]: Start difference. First operand 340 states and 1016 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:47,884 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-03-10 21:52:48,118 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-03-10 21:52:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:48,143 INFO L93 Difference]: Finished difference Result 514 states and 1502 transitions. [2021-03-10 21:52:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:48,144 INFO L225 Difference]: With dead ends: 514 [2021-03-10 21:52:48,144 INFO L226 Difference]: Without dead ends: 484 [2021-03-10 21:52:48,145 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 719.8ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:52:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-03-10 21:52:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 339. [2021-03-10 21:52:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.9911242603550297) internal successors, (1011), 338 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1011 transitions. [2021-03-10 21:52:48,149 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1011 transitions. Word has length 20 [2021-03-10 21:52:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:48,149 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 1011 transitions. [2021-03-10 21:52:48,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1011 transitions. [2021-03-10 21:52:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:48,149 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:48,150 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:48,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1349 [2021-03-10 21:52:48,350 INFO L428 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:48,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash 310958010, now seen corresponding path program 100 times [2021-03-10 21:52:48,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:48,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270027841] [2021-03-10 21:52:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:48,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270027841] [2021-03-10 21:52:48,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948906673] [2021-03-10 21:52:48,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:48,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:48,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:48,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:48,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:48,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:48,623 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:48,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:48,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:52:48,633 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2021-03-10 21:52:48,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:52:48,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:48,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:52:48,673 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:48,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:48,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:48,714 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:48,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:48,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:48,718 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:48,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:48,755 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:48,755 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:35 [2021-03-10 21:52:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:48,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:48,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:48,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257226645] [2021-03-10 21:52:48,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:48,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:48,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:48,854 INFO L87 Difference]: Start difference. First operand 339 states and 1011 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:49,151 INFO L93 Difference]: Finished difference Result 403 states and 1191 transitions. [2021-03-10 21:52:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:52:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:49,153 INFO L225 Difference]: With dead ends: 403 [2021-03-10 21:52:49,154 INFO L226 Difference]: Without dead ends: 388 [2021-03-10 21:52:49,154 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 319.6ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-03-10 21:52:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 336. [2021-03-10 21:52:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.994029850746269) internal successors, (1003), 335 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1003 transitions. [2021-03-10 21:52:49,158 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1003 transitions. Word has length 20 [2021-03-10 21:52:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:49,158 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1003 transitions. [2021-03-10 21:52:49,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1003 transitions. [2021-03-10 21:52:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:49,158 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:49,159 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:49,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1361,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:49,359 INFO L428 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1408026672, now seen corresponding path program 101 times [2021-03-10 21:52:49,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:49,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316672821] [2021-03-10 21:52:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:49,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316672821] [2021-03-10 21:52:49,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907672545] [2021-03-10 21:52:49,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:49,513 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:52:49,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:49,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:49,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:49,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:49,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:49,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:49,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:52:49,600 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-03-10 21:52:49,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:52:49,637 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:49,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:52:49,641 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:49,680 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:49,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:49,685 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:49,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:49,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:49,689 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:49,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:49,727 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:49,727 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:41 [2021-03-10 21:52:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:49,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:49,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:49,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178366467] [2021-03-10 21:52:49,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:49,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:49,863 INFO L87 Difference]: Start difference. First operand 336 states and 1003 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:50,175 INFO L93 Difference]: Finished difference Result 494 states and 1464 transitions. [2021-03-10 21:52:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:50,176 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:50,177 INFO L225 Difference]: With dead ends: 494 [2021-03-10 21:52:50,177 INFO L226 Difference]: Without dead ends: 479 [2021-03-10 21:52:50,177 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 343.6ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-03-10 21:52:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 335. [2021-03-10 21:52:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.9910179640718564) internal successors, (999), 334 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 999 transitions. [2021-03-10 21:52:50,181 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 999 transitions. Word has length 20 [2021-03-10 21:52:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:50,182 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 999 transitions. [2021-03-10 21:52:50,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 999 transitions. [2021-03-10 21:52:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:50,182 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:50,182 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:50,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1369 [2021-03-10 21:52:50,387 INFO L428 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash -11639494, now seen corresponding path program 102 times [2021-03-10 21:52:50,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:50,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609195778] [2021-03-10 21:52:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:50,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609195778] [2021-03-10 21:52:50,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043664246] [2021-03-10 21:52:50,566 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:50,611 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:52:50,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:50,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:50,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:50,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:50,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:50,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:50,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:50,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:50,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:50,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:50,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:50,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:50,741 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:52:50,964 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:52:50,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:50,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:50,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:50,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:50,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:50,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:50,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:51,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:51,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:51,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:51,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:51,023 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:51,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:51,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:51,029 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:51,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:51,067 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:51,067 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:33 [2021-03-10 21:52:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:51,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:51,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:51,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559121862] [2021-03-10 21:52:51,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:51,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:51,196 INFO L87 Difference]: Start difference. First operand 335 states and 999 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:51,616 INFO L93 Difference]: Finished difference Result 453 states and 1343 transitions. [2021-03-10 21:52:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:51,617 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:51,618 INFO L225 Difference]: With dead ends: 453 [2021-03-10 21:52:51,618 INFO L226 Difference]: Without dead ends: 438 [2021-03-10 21:52:51,618 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 517.9ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-03-10 21:52:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 341. [2021-03-10 21:52:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.0) internal successors, (1020), 340 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1020 transitions. [2021-03-10 21:52:51,622 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1020 transitions. Word has length 20 [2021-03-10 21:52:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:51,622 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 1020 transitions. [2021-03-10 21:52:51,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1020 transitions. [2021-03-10 21:52:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:51,623 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:51,623 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:51,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1374 [2021-03-10 21:52:51,827 INFO L428 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1341567656, now seen corresponding path program 103 times [2021-03-10 21:52:51,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:51,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003426106] [2021-03-10 21:52:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:51,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003426106] [2021-03-10 21:52:51,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129038895] [2021-03-10 21:52:51,976 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:51,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:51,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:52,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:52,062 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:52,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:52,067 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:52,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:52,106 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:52,106 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:52:52,184 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:52:52,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:52,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:52,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:52,194 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:52,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:52,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:52,239 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:52,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:52,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:52,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:52,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:52,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:52,283 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:52:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:52,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:52,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:52,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306074748] [2021-03-10 21:52:52,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:52,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:52,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:52,420 INFO L87 Difference]: Start difference. First operand 341 states and 1020 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:52,808 INFO L93 Difference]: Finished difference Result 475 states and 1412 transitions. [2021-03-10 21:52:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:52,810 INFO L225 Difference]: With dead ends: 475 [2021-03-10 21:52:52,810 INFO L226 Difference]: Without dead ends: 460 [2021-03-10 21:52:52,810 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 382.3ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-03-10 21:52:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 338. [2021-03-10 21:52:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9910979228486645) internal successors, (1008), 337 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1008 transitions. [2021-03-10 21:52:52,814 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1008 transitions. Word has length 20 [2021-03-10 21:52:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:52,814 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1008 transitions. [2021-03-10 21:52:52,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1008 transitions. [2021-03-10 21:52:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:52,815 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:52,815 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:53,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1393,104 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:53,016 INFO L428 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2038318152, now seen corresponding path program 104 times [2021-03-10 21:52:53,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:53,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734267133] [2021-03-10 21:52:53,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:53,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734267133] [2021-03-10 21:52:53,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794406545] [2021-03-10 21:52:53,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:53,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:53,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:53,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:52:53,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:53,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:53,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:53,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:53,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:53,233 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:52:53,233 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-03-10 21:52:53,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:53,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:52:53,266 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:53,277 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:53,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:53,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:53,281 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:53,291 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:53,292 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:52:53,292 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2021-03-10 21:52:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:53,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:53,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:53,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361788096] [2021-03-10 21:52:53,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:53,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:53,369 INFO L87 Difference]: Start difference. First operand 338 states and 1008 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:53,646 INFO L93 Difference]: Finished difference Result 454 states and 1342 transitions. [2021-03-10 21:52:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:52:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:53,648 INFO L225 Difference]: With dead ends: 454 [2021-03-10 21:52:53,648 INFO L226 Difference]: Without dead ends: 439 [2021-03-10 21:52:53,648 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 228.2ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-03-10 21:52:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 333. [2021-03-10 21:52:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9909638554216866) internal successors, (993), 332 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 993 transitions. [2021-03-10 21:52:53,653 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 993 transitions. Word has length 20 [2021-03-10 21:52:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:53,653 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 993 transitions. [2021-03-10 21:52:53,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 993 transitions. [2021-03-10 21:52:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:53,654 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:53,654 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:53,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1400 [2021-03-10 21:52:53,854 INFO L428 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1082146900, now seen corresponding path program 105 times [2021-03-10 21:52:53,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:53,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608061601] [2021-03-10 21:52:53,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:53,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608061601] [2021-03-10 21:52:53,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588000890] [2021-03-10 21:52:53,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:52:54,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:52:54,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:54,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:54,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:54,165 INFO L388 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 26 treesize of output 20 [2021-03-10 21:52:54,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:54,171 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:54,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:54,196 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:55 [2021-03-10 21:52:54,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:54,275 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:54,281 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:54,288 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:54,294 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:54,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:54,376 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:54,383 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:54,389 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:54,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:54,394 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:54,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:54,462 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:54,462 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:185, output treesize:85 [2021-03-10 21:52:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:54,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:54,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:54,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626192389] [2021-03-10 21:52:54,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:54,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:54,654 INFO L87 Difference]: Start difference. First operand 333 states and 993 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:55,513 INFO L93 Difference]: Finished difference Result 552 states and 1612 transitions. [2021-03-10 21:52:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:52:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:55,515 INFO L225 Difference]: With dead ends: 552 [2021-03-10 21:52:55,515 INFO L226 Difference]: Without dead ends: 522 [2021-03-10 21:52:55,515 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 956.8ms TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-03-10 21:52:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-03-10 21:52:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 327. [2021-03-10 21:52:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9938650306748467) internal successors, (976), 326 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 976 transitions. [2021-03-10 21:52:55,520 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 976 transitions. Word has length 20 [2021-03-10 21:52:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:55,520 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 976 transitions. [2021-03-10 21:52:55,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 976 transitions. [2021-03-10 21:52:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:55,520 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:55,520 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:55,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1401 [2021-03-10 21:52:55,721 INFO L428 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 955468146, now seen corresponding path program 106 times [2021-03-10 21:52:55,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:55,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792828986] [2021-03-10 21:52:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:55,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792828986] [2021-03-10 21:52:55,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761033517] [2021-03-10 21:52:55,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:55,902 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:52:55,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:55,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:55,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:56,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:56,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:56,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:56,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:56,070 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:56,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:56,105 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:56,105 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:52:56,185 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:52:56,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:56,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:56,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:56,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:56,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:56,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:56,237 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:56,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:56,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:56,242 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:56,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:56,280 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:56,280 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:44 [2021-03-10 21:52:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:56,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:56,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:56,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203092903] [2021-03-10 21:52:56,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:56,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:56,421 INFO L87 Difference]: Start difference. First operand 327 states and 976 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:56,965 INFO L93 Difference]: Finished difference Result 523 states and 1547 transitions. [2021-03-10 21:52:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:56,967 INFO L225 Difference]: With dead ends: 523 [2021-03-10 21:52:56,967 INFO L226 Difference]: Without dead ends: 508 [2021-03-10 21:52:56,967 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 493.2ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:52:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-03-10 21:52:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 324. [2021-03-10 21:52:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.981424148606811) internal successors, (963), 323 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 963 transitions. [2021-03-10 21:52:56,971 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 963 transitions. Word has length 20 [2021-03-10 21:52:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:56,971 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 963 transitions. [2021-03-10 21:52:56,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 963 transitions. [2021-03-10 21:52:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:56,972 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:56,972 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:57,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1411,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:57,172 INFO L428 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1175221912, now seen corresponding path program 107 times [2021-03-10 21:52:57,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:57,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513223609] [2021-03-10 21:52:57,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:57,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513223609] [2021-03-10 21:52:57,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430978746] [2021-03-10 21:52:57,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:57,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:52:57,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:57,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:52:57,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:57,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:52:57,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:57,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:57,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:57,559 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:57,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:57,586 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:57,586 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:71 [2021-03-10 21:52:57,725 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:52:57,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:57,733 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:57,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:57,739 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:57,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:57,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:57,770 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:57,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:57,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:57,774 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:57,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:57,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:52:57,800 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:27 [2021-03-10 21:52:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:57,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:57,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:57,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010792100] [2021-03-10 21:52:57,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:57,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:57,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:57,863 INFO L87 Difference]: Start difference. First operand 324 states and 963 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:58,282 INFO L93 Difference]: Finished difference Result 396 states and 1168 transitions. [2021-03-10 21:52:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:52:58,283 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:58,283 INFO L225 Difference]: With dead ends: 396 [2021-03-10 21:52:58,283 INFO L226 Difference]: Without dead ends: 381 [2021-03-10 21:52:58,284 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 428.6ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:52:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-03-10 21:52:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 330. [2021-03-10 21:52:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9848024316109423) internal successors, (982), 329 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 982 transitions. [2021-03-10 21:52:58,287 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 982 transitions. Word has length 20 [2021-03-10 21:52:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:58,287 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 982 transitions. [2021-03-10 21:52:58,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 982 transitions. [2021-03-10 21:52:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:58,288 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:58,288 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:52:58,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1420 [2021-03-10 21:52:58,488 INFO L428 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:52:58,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:52:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1677013248, now seen corresponding path program 108 times [2021-03-10 21:52:58,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:52:58,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531197332] [2021-03-10 21:52:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:52:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:52:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:58,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531197332] [2021-03-10 21:52:58,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990055587] [2021-03-10 21:52:58,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:52:58,652 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:52:58,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:52:58,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:52:58,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:52:58,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:52:58,851 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:58,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:58,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:52:58,883 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:58,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:58,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:52:58,910 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:71 [2021-03-10 21:52:58,979 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:52:58,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:58,985 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:58,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:58,991 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:58,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:58,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:52:58,996 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:59,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:52:59,001 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:59,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:59,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:59,094 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:59,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:52:59,099 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:59,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:59,104 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:59,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:52:59,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:52:59,108 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:52:59,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:52:59,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:52:59,193 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:217, output treesize:85 [2021-03-10 21:52:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:52:59,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:52:59,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:52:59,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228022562] [2021-03-10 21:52:59,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:52:59,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:52:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:52:59,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:52:59,380 INFO L87 Difference]: Start difference. First operand 330 states and 982 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:52:59,860 INFO L93 Difference]: Finished difference Result 402 states and 1181 transitions. [2021-03-10 21:52:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:52:59,860 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:52:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:52:59,861 INFO L225 Difference]: With dead ends: 402 [2021-03-10 21:52:59,861 INFO L226 Difference]: Without dead ends: 387 [2021-03-10 21:52:59,862 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 581.4ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:52:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-03-10 21:52:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 328. [2021-03-10 21:52:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.981651376146789) internal successors, (975), 327 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:52:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 975 transitions. [2021-03-10 21:52:59,866 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 975 transitions. Word has length 20 [2021-03-10 21:52:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:52:59,866 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 975 transitions. [2021-03-10 21:52:59,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:52:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 975 transitions. [2021-03-10 21:52:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:52:59,866 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:52:59,866 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:00,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1435,109 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:00,067 INFO L428 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash 511169928, now seen corresponding path program 109 times [2021-03-10 21:53:00,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:00,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032814623] [2021-03-10 21:53:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:00,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032814623] [2021-03-10 21:53:00,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53716698] [2021-03-10 21:53:00,195 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:00,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:00,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:00,336 INFO L388 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 26 treesize of output 20 [2021-03-10 21:53:00,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:00,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:00,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:00,365 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:00,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:00,367 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:65 [2021-03-10 21:53:00,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:00,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:00,434 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:00,458 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:00,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:00,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:00,462 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:00,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:00,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:00,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:00,488 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:00,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:00,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:00,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:00,513 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:00,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:00,535 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:00,536 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:83, output treesize:33 [2021-03-10 21:53:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:00,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:00,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:00,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608743637] [2021-03-10 21:53:00,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:00,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:00,640 INFO L87 Difference]: Start difference. First operand 328 states and 975 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:01,036 INFO L93 Difference]: Finished difference Result 393 states and 1159 transitions. [2021-03-10 21:53:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:01,038 INFO L225 Difference]: With dead ends: 393 [2021-03-10 21:53:01,038 INFO L226 Difference]: Without dead ends: 378 [2021-03-10 21:53:01,038 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 343.9ms TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-03-10 21:53:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 326. [2021-03-10 21:53:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.9846153846153847) internal successors, (970), 325 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 970 transitions. [2021-03-10 21:53:01,042 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 970 transitions. Word has length 20 [2021-03-10 21:53:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:01,042 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 970 transitions. [2021-03-10 21:53:01,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 970 transitions. [2021-03-10 21:53:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:01,042 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:01,042 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:01,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1455 [2021-03-10 21:53:01,243 INFO L428 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash 546678026, now seen corresponding path program 110 times [2021-03-10 21:53:01,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:01,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161896924] [2021-03-10 21:53:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:01,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161896924] [2021-03-10 21:53:01,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637428597] [2021-03-10 21:53:01,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:01,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:01,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:01,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:01,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:01,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:01,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:01,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:01,535 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:01,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:01,570 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:01,845 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:01,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:01,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:01,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:01,863 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:01,868 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:01,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:01,952 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:01,957 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:01,962 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:01,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:01,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:01,966 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:02,039 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:02,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:02,056 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:205, output treesize:73 [2021-03-10 21:53:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:02,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:02,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:02,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899413806] [2021-03-10 21:53:02,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:02,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:02,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:02,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:02,171 INFO L87 Difference]: Start difference. First operand 326 states and 970 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:02,587 INFO L93 Difference]: Finished difference Result 416 states and 1218 transitions. [2021-03-10 21:53:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:02,589 INFO L225 Difference]: With dead ends: 416 [2021-03-10 21:53:02,589 INFO L226 Difference]: Without dead ends: 401 [2021-03-10 21:53:02,589 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 552.6ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-03-10 21:53:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 332. [2021-03-10 21:53:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 3.0) internal successors, (993), 331 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 993 transitions. [2021-03-10 21:53:02,593 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 993 transitions. Word has length 20 [2021-03-10 21:53:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:02,593 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 993 transitions. [2021-03-10 21:53:02,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 993 transitions. [2021-03-10 21:53:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:02,594 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:02,594 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:02,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1469,111 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:02,794 INFO L428 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash 44886690, now seen corresponding path program 111 times [2021-03-10 21:53:02,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:02,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577193627] [2021-03-10 21:53:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:02,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577193627] [2021-03-10 21:53:02,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267332384] [2021-03-10 21:53:02,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:02,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:53:02,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:02,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:02,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:03,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:03,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:03,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:03,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:26 [2021-03-10 21:53:03,105 INFO L446 ElimStorePlain]: Different costs {0=[o_4], 1=[o_2]} [2021-03-10 21:53:03,107 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:03,108 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:03,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:03,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:03,118 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:03,126 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,126 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:12 [2021-03-10 21:53:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:03,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:03,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:03,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782507987] [2021-03-10 21:53:03,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:03,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:03,184 INFO L87 Difference]: Start difference. First operand 332 states and 993 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:03,405 INFO L93 Difference]: Finished difference Result 463 states and 1362 transitions. [2021-03-10 21:53:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:03,405 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:03,406 INFO L225 Difference]: With dead ends: 463 [2021-03-10 21:53:03,406 INFO L226 Difference]: Without dead ends: 448 [2021-03-10 21:53:03,407 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 264.8ms TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-03-10 21:53:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 330. [2021-03-10 21:53:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9969604863221884) internal successors, (986), 329 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 986 transitions. [2021-03-10 21:53:03,411 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 986 transitions. Word has length 20 [2021-03-10 21:53:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:03,411 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 986 transitions. [2021-03-10 21:53:03,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 986 transitions. [2021-03-10 21:53:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:03,412 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:03,412 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:03,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1491 [2021-03-10 21:53:03,612 INFO L428 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1486958454, now seen corresponding path program 112 times [2021-03-10 21:53:03,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:03,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251905570] [2021-03-10 21:53:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:03,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251905570] [2021-03-10 21:53:03,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505256178] [2021-03-10 21:53:03,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:03,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:03,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:03,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:03,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:03,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:03,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:03,858 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:03,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:03,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:03,897 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:03,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:03,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:03,933 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:04,101 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:04,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:04,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:04,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:04,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:04,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:04,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:04,111 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:04,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:04,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:04,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:04,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:04,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:04,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:04,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:04,160 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:04,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:04,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:04,195 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:101, output treesize:35 [2021-03-10 21:53:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:04,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:04,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:04,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820816286] [2021-03-10 21:53:04,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:04,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:04,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:04,296 INFO L87 Difference]: Start difference. First operand 330 states and 986 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:04,669 INFO L93 Difference]: Finished difference Result 408 states and 1198 transitions. [2021-03-10 21:53:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:04,669 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:04,670 INFO L225 Difference]: With dead ends: 408 [2021-03-10 21:53:04,670 INFO L226 Difference]: Without dead ends: 393 [2021-03-10 21:53:04,670 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 368.7ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-03-10 21:53:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 327. [2021-03-10 21:53:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9907975460122698) internal successors, (975), 326 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 975 transitions. [2021-03-10 21:53:04,674 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 975 transitions. Word has length 20 [2021-03-10 21:53:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:04,674 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 975 transitions. [2021-03-10 21:53:04,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 975 transitions. [2021-03-10 21:53:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:04,674 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:04,674 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:04,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1495 [2021-03-10 21:53:04,875 INFO L428 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 17343424, now seen corresponding path program 113 times [2021-03-10 21:53:04,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:04,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093947235] [2021-03-10 21:53:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:05,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093947235] [2021-03-10 21:53:05,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830179668] [2021-03-10 21:53:05,036 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:05,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:05,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:05,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:05,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:05,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:05,153 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:05,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:05,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:05,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:05,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:05,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:05,229 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:05,303 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:05,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:05,309 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:05,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:05,313 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:05,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:05,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:05,356 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:05,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:05,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:05,360 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:05,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:05,398 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:05,399 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:47 [2021-03-10 21:53:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:05,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:05,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:05,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177068432] [2021-03-10 21:53:05,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:05,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:05,538 INFO L87 Difference]: Start difference. First operand 327 states and 975 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:05,922 INFO L93 Difference]: Finished difference Result 490 states and 1448 transitions. [2021-03-10 21:53:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:05,923 INFO L225 Difference]: With dead ends: 490 [2021-03-10 21:53:05,923 INFO L226 Difference]: Without dead ends: 475 [2021-03-10 21:53:05,924 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 416.8ms TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-03-10 21:53:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 326. [2021-03-10 21:53:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.9846153846153847) internal successors, (970), 325 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 970 transitions. [2021-03-10 21:53:05,928 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 970 transitions. Word has length 20 [2021-03-10 21:53:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:05,928 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 970 transitions. [2021-03-10 21:53:05,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 970 transitions. [2021-03-10 21:53:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:05,929 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:05,929 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:06,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1511 [2021-03-10 21:53:06,129 INFO L428 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -342671318, now seen corresponding path program 114 times [2021-03-10 21:53:06,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:06,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284498028] [2021-03-10 21:53:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:06,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284498028] [2021-03-10 21:53:06,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298641378] [2021-03-10 21:53:06,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:06,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:53:06,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:06,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:06,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:06,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:06,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:06,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:06,384 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:06,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:06,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:06,419 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:06,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:06,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:06,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:06,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:06,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:06,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:06,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:06,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:06,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:06,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:06,618 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:06,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:06,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:06,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:06,648 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:06,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:06,674 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:06,675 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:81, output treesize:35 [2021-03-10 21:53:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:06,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:06,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:06,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852347011] [2021-03-10 21:53:06,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:06,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:06,787 INFO L87 Difference]: Start difference. First operand 326 states and 970 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:07,150 INFO L93 Difference]: Finished difference Result 496 states and 1436 transitions. [2021-03-10 21:53:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:53:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:07,152 INFO L225 Difference]: With dead ends: 496 [2021-03-10 21:53:07,152 INFO L226 Difference]: Without dead ends: 466 [2021-03-10 21:53:07,152 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 406.8ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-03-10 21:53:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 329. [2021-03-10 21:53:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.9939024390243905) internal successors, (982), 328 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 982 transitions. [2021-03-10 21:53:07,156 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 982 transitions. Word has length 20 [2021-03-10 21:53:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:07,156 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 982 transitions. [2021-03-10 21:53:07,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 982 transitions. [2021-03-10 21:53:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:07,157 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:07,157 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:07,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1520,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:07,357 INFO L428 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1672599480, now seen corresponding path program 115 times [2021-03-10 21:53:07,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:07,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394571305] [2021-03-10 21:53:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:07,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394571305] [2021-03-10 21:53:07,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529190203] [2021-03-10 21:53:07,525 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:07,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:07,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:07,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:07,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:07,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:07,623 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:07,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:07,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:07,659 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:07,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:07,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:07,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:07,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:07,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:07,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:07,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:07,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:07,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:07,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:07,804 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:07,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:07,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:07,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:07,838 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:07,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:07,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:07,869 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:41 [2021-03-10 21:53:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:08,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:08,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:08,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386156042] [2021-03-10 21:53:08,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:08,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:08,010 INFO L87 Difference]: Start difference. First operand 329 states and 982 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:08,333 INFO L93 Difference]: Finished difference Result 471 states and 1397 transitions. [2021-03-10 21:53:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:08,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:08,335 INFO L225 Difference]: With dead ends: 471 [2021-03-10 21:53:08,335 INFO L226 Difference]: Without dead ends: 456 [2021-03-10 21:53:08,335 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 416.9ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-03-10 21:53:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 325. [2021-03-10 21:53:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.9814814814814814) internal successors, (966), 324 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 966 transitions. [2021-03-10 21:53:08,339 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 966 transitions. Word has length 20 [2021-03-10 21:53:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 966 transitions. [2021-03-10 21:53:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 966 transitions. [2021-03-10 21:53:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:08,340 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:08,340 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:08,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1531 [2021-03-10 21:53:08,543 INFO L428 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2051044326, now seen corresponding path program 116 times [2021-03-10 21:53:08,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:08,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902630980] [2021-03-10 21:53:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:08,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902630980] [2021-03-10 21:53:08,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328432965] [2021-03-10 21:53:08,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:08,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:08,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:08,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:08,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:08,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:08,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:08,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:08,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:08,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:08,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:08,762 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:08,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:08,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:08,803 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:53:09,066 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:09,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:09,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:09,078 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:09,084 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:09,088 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:09,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:09,169 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:09,174 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:09,180 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:09,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:09,184 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:09,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:09,255 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:09,255 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:197, output treesize:73 [2021-03-10 21:53:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:09,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:09,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:09,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368026029] [2021-03-10 21:53:09,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:09,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:09,371 INFO L87 Difference]: Start difference. First operand 325 states and 966 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:09,868 INFO L93 Difference]: Finished difference Result 397 states and 1171 transitions. [2021-03-10 21:53:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:09,869 INFO L225 Difference]: With dead ends: 397 [2021-03-10 21:53:09,869 INFO L226 Difference]: Without dead ends: 382 [2021-03-10 21:53:09,870 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 569.2ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-03-10 21:53:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 335. [2021-03-10 21:53:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.997005988023952) internal successors, (1001), 334 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1001 transitions. [2021-03-10 21:53:09,874 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1001 transitions. Word has length 20 [2021-03-10 21:53:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:09,874 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 1001 transitions. [2021-03-10 21:53:09,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1001 transitions. [2021-03-10 21:53:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:09,875 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:09,875 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:10,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1538,117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:10,079 INFO L428 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:10,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1742131634, now seen corresponding path program 117 times [2021-03-10 21:53:10,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:10,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747565630] [2021-03-10 21:53:10,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:10,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747565630] [2021-03-10 21:53:10,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915188148] [2021-03-10 21:53:10,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:10,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:53:10,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:10,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:10,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:10,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:10,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:10,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:10,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:10,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:10,376 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2021-03-10 21:53:10,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:10,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:10,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:10,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:10,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:10,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:10,514 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:10,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:10,527 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:10,528 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2021-03-10 21:53:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:10,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:10,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:10,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671835126] [2021-03-10 21:53:10,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:10,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:10,604 INFO L87 Difference]: Start difference. First operand 335 states and 1001 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:10,948 INFO L93 Difference]: Finished difference Result 456 states and 1341 transitions. [2021-03-10 21:53:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:10,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:10,950 INFO L225 Difference]: With dead ends: 456 [2021-03-10 21:53:10,950 INFO L226 Difference]: Without dead ends: 441 [2021-03-10 21:53:10,950 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 322.3ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-03-10 21:53:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 333. [2021-03-10 21:53:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9939759036144578) internal successors, (994), 332 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 994 transitions. [2021-03-10 21:53:10,955 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 994 transitions. Word has length 20 [2021-03-10 21:53:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:10,955 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 994 transitions. [2021-03-10 21:53:10,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 994 transitions. [2021-03-10 21:53:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:10,955 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:10,955 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:11,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1557,118 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:11,156 INFO L428 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash 210286490, now seen corresponding path program 118 times [2021-03-10 21:53:11,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:11,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769092230] [2021-03-10 21:53:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:11,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769092230] [2021-03-10 21:53:11,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141704932] [2021-03-10 21:53:11,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:11,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:11,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:11,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:11,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:11,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:11,397 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:11,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:11,401 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:11,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:11,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:11,441 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:53:11,608 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:11,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:11,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:11,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:11,618 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:11,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:11,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:11,660 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:11,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:11,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:11,664 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:11,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:11,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:11,701 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:35 [2021-03-10 21:53:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:11,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:11,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:11,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480402073] [2021-03-10 21:53:11,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:11,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:11,804 INFO L87 Difference]: Start difference. First operand 333 states and 994 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:12,222 INFO L93 Difference]: Finished difference Result 409 states and 1201 transitions. [2021-03-10 21:53:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:12,224 INFO L225 Difference]: With dead ends: 409 [2021-03-10 21:53:12,224 INFO L226 Difference]: Without dead ends: 394 [2021-03-10 21:53:12,224 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 382.5ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-03-10 21:53:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 330. [2021-03-10 21:53:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.987841945288754) internal successors, (983), 329 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 983 transitions. [2021-03-10 21:53:12,228 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 983 transitions. Word has length 20 [2021-03-10 21:53:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:12,228 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 983 transitions. [2021-03-10 21:53:12,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 983 transitions. [2021-03-10 21:53:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:12,228 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:12,229 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:12,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1562 [2021-03-10 21:53:12,429 INFO L428 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1714588368, now seen corresponding path program 119 times [2021-03-10 21:53:12,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:12,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275289850] [2021-03-10 21:53:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:12,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275289850] [2021-03-10 21:53:12,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583519294] [2021-03-10 21:53:12,579 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:12,602 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:53:12,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:12,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:12,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:12,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:12,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:12,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:12,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:12,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:12,713 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:12,714 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:53:12,801 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:12,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:12,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:12,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:12,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:12,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:12,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:12,857 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:12,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:12,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:12,869 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:12,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:12,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:12,910 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:53:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:13,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:13,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:13,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920941086] [2021-03-10 21:53:13,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:13,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:13,054 INFO L87 Difference]: Start difference. First operand 330 states and 983 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:13,458 INFO L93 Difference]: Finished difference Result 491 states and 1451 transitions. [2021-03-10 21:53:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:13,459 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:13,460 INFO L225 Difference]: With dead ends: 491 [2021-03-10 21:53:13,460 INFO L226 Difference]: Without dead ends: 476 [2021-03-10 21:53:13,460 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 398.5ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-03-10 21:53:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 329. [2021-03-10 21:53:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.981707317073171) internal successors, (978), 328 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 978 transitions. [2021-03-10 21:53:13,464 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 978 transitions. Word has length 20 [2021-03-10 21:53:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:13,464 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 978 transitions. [2021-03-10 21:53:13,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 978 transitions. [2021-03-10 21:53:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:13,465 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:13,465 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:13,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1571,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:13,665 INFO L428 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash 828548658, now seen corresponding path program 120 times [2021-03-10 21:53:13,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:13,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801684184] [2021-03-10 21:53:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:13,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801684184] [2021-03-10 21:53:13,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399399017] [2021-03-10 21:53:13,793 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:13,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:53:13,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:13,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:13,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:13,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:13,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:13,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:13,911 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:13,911 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2021-03-10 21:53:13,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:13,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:13,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:13,951 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:13,991 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:13,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:13,996 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:13,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:13,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:14,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:14,038 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:14,039 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:14,039 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:35 [2021-03-10 21:53:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:14,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:14,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:14,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350789770] [2021-03-10 21:53:14,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:14,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:14,141 INFO L87 Difference]: Start difference. First operand 329 states and 978 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:14,442 INFO L93 Difference]: Finished difference Result 398 states and 1173 transitions. [2021-03-10 21:53:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:14,444 INFO L225 Difference]: With dead ends: 398 [2021-03-10 21:53:14,444 INFO L226 Difference]: Without dead ends: 383 [2021-03-10 21:53:14,444 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 310.2ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-03-10 21:53:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 326. [2021-03-10 21:53:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.9846153846153847) internal successors, (970), 325 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 970 transitions. [2021-03-10 21:53:14,448 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 970 transitions. Word has length 20 [2021-03-10 21:53:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:14,448 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 970 transitions. [2021-03-10 21:53:14,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 970 transitions. [2021-03-10 21:53:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:14,448 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:14,448 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:14,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1578,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:14,649 INFO L428 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -890436024, now seen corresponding path program 121 times [2021-03-10 21:53:14,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:14,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015677568] [2021-03-10 21:53:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:14,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015677568] [2021-03-10 21:53:14,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657866169] [2021-03-10 21:53:14,789 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:14,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:14,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:14,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:14,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:14,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:14,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:14,884 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-03-10 21:53:14,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:14,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:14,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:14,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:14,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:14,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:14,976 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:14,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:14,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:14,980 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:15,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:15,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:15,032 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:41 [2021-03-10 21:53:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:15,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:15,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:15,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152678861] [2021-03-10 21:53:15,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:15,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:15,174 INFO L87 Difference]: Start difference. First operand 326 states and 970 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:15,500 INFO L93 Difference]: Finished difference Result 490 states and 1449 transitions. [2021-03-10 21:53:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:15,501 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:15,502 INFO L225 Difference]: With dead ends: 490 [2021-03-10 21:53:15,502 INFO L226 Difference]: Without dead ends: 475 [2021-03-10 21:53:15,502 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 362.3ms TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-03-10 21:53:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 325. [2021-03-10 21:53:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.9814814814814814) internal successors, (966), 324 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 966 transitions. [2021-03-10 21:53:15,507 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 966 transitions. Word has length 20 [2021-03-10 21:53:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:15,507 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 966 transitions. [2021-03-10 21:53:15,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 966 transitions. [2021-03-10 21:53:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:15,508 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:15,508 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:15,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1582,122 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:15,730 INFO L428 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 505951154, now seen corresponding path program 122 times [2021-03-10 21:53:15,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:15,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847614647] [2021-03-10 21:53:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:15,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847614647] [2021-03-10 21:53:15,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483096554] [2021-03-10 21:53:15,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:15,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:15,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:15,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:15,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:15,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:15,997 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:16,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:16,008 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:16,008 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2021-03-10 21:53:16,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:16,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:16,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:16,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:16,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:16,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:16,091 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:16,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:16,099 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:16,099 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:12 [2021-03-10 21:53:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:16,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:16,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:16,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115551075] [2021-03-10 21:53:16,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:16,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:16,161 INFO L87 Difference]: Start difference. First operand 325 states and 966 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:16,445 INFO L93 Difference]: Finished difference Result 446 states and 1316 transitions. [2021-03-10 21:53:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:16,446 INFO L225 Difference]: With dead ends: 446 [2021-03-10 21:53:16,446 INFO L226 Difference]: Without dead ends: 431 [2021-03-10 21:53:16,446 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 280.3ms TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-03-10 21:53:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 331. [2021-03-10 21:53:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.9909090909090907) internal successors, (987), 330 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 987 transitions. [2021-03-10 21:53:16,450 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 987 transitions. Word has length 20 [2021-03-10 21:53:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:16,450 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 987 transitions. [2021-03-10 21:53:16,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 987 transitions. [2021-03-10 21:53:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:16,451 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:16,451 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:16,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1587,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:16,651 INFO L428 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash -823977008, now seen corresponding path program 123 times [2021-03-10 21:53:16,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:16,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291017970] [2021-03-10 21:53:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:16,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291017970] [2021-03-10 21:53:16,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314149412] [2021-03-10 21:53:16,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:16,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:53:16,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:16,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:16,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:16,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:16,894 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:16,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:16,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:16,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:16,933 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:16,933 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:17,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:17,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:17,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:17,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:17,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:17,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:17,047 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:17,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:17,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:17,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:17,084 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:17,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:17,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:17,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:17,119 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:17,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:17,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:17,151 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:41 [2021-03-10 21:53:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:17,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:17,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:17,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740333410] [2021-03-10 21:53:17,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:17,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:17,304 INFO L87 Difference]: Start difference. First operand 331 states and 987 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:17,684 INFO L93 Difference]: Finished difference Result 471 states and 1397 transitions. [2021-03-10 21:53:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:17,685 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:17,686 INFO L225 Difference]: With dead ends: 471 [2021-03-10 21:53:17,686 INFO L226 Difference]: Without dead ends: 456 [2021-03-10 21:53:17,686 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 395.6ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-03-10 21:53:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 328. [2021-03-10 21:53:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.981651376146789) internal successors, (975), 327 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 975 transitions. [2021-03-10 21:53:17,690 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 975 transitions. Word has length 20 [2021-03-10 21:53:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:17,690 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 975 transitions. [2021-03-10 21:53:17,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 975 transitions. [2021-03-10 21:53:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:17,691 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:17,691 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:17,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1592,124 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:17,891 INFO L428 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:17,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1739058496, now seen corresponding path program 124 times [2021-03-10 21:53:17,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:17,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231592750] [2021-03-10 21:53:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:18,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231592750] [2021-03-10 21:53:18,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086871643] [2021-03-10 21:53:18,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:18,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:18,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:18,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:18,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:18,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:18,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:18,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:18,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:18,133 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-03-10 21:53:18,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:18,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:18,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:18,175 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:18,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:18,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:18,220 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:18,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:18,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:18,224 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:18,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:18,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:18,263 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:41 [2021-03-10 21:53:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:18,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:18,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:18,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499005285] [2021-03-10 21:53:18,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:18,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:18,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:18,405 INFO L87 Difference]: Start difference. First operand 328 states and 975 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:18,717 INFO L93 Difference]: Finished difference Result 463 states and 1378 transitions. [2021-03-10 21:53:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:18,719 INFO L225 Difference]: With dead ends: 463 [2021-03-10 21:53:18,719 INFO L226 Difference]: Without dead ends: 448 [2021-03-10 21:53:18,719 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 364.9ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-03-10 21:53:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 324. [2021-03-10 21:53:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.981424148606811) internal successors, (963), 323 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 963 transitions. [2021-03-10 21:53:18,723 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 963 transitions. Word has length 20 [2021-03-10 21:53:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:18,724 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 963 transitions. [2021-03-10 21:53:18,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 963 transitions. [2021-03-10 21:53:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:18,724 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:18,724 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:18,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1599 [2021-03-10 21:53:18,925 INFO L428 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -146183416, now seen corresponding path program 125 times [2021-03-10 21:53:18,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:18,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341540268] [2021-03-10 21:53:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:19,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341540268] [2021-03-10 21:53:19,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382892415] [2021-03-10 21:53:19,038 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:19,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:53:19,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:19,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:19,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:19,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:19,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:19,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:19,092 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:19,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:19,114 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:19,114 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:53:19,214 INFO L388 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 30 treesize of output 24 [2021-03-10 21:53:19,216 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:19,218 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:19,219 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:19,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:19,235 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:53:19,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:19,236 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:53:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:19,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:19,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:53:19,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446730631] [2021-03-10 21:53:19,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:53:19,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:53:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:53:19,342 INFO L87 Difference]: Start difference. First operand 324 states and 963 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:20,167 INFO L93 Difference]: Finished difference Result 635 states and 1888 transitions. [2021-03-10 21:53:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:53:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:53:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:20,169 INFO L225 Difference]: With dead ends: 635 [2021-03-10 21:53:20,169 INFO L226 Difference]: Without dead ends: 605 [2021-03-10 21:53:20,169 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 767.8ms TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:53:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-03-10 21:53:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 327. [2021-03-10 21:53:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.98159509202454) internal successors, (972), 326 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 972 transitions. [2021-03-10 21:53:20,176 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 972 transitions. Word has length 20 [2021-03-10 21:53:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:20,176 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 972 transitions. [2021-03-10 21:53:20,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 972 transitions. [2021-03-10 21:53:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:20,177 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:20,177 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:20,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1604 [2021-03-10 21:53:20,379 INFO L428 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1981568732, now seen corresponding path program 126 times [2021-03-10 21:53:20,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:20,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074330554] [2021-03-10 21:53:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:20,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074330554] [2021-03-10 21:53:20,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761573952] [2021-03-10 21:53:20,504 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:20,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:53:20,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:20,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:20,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:20,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:20,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:20,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:20,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:20,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:20,609 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:20,609 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:53:20,693 INFO L388 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 30 treesize of output 24 [2021-03-10 21:53:20,695 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:20,697 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:20,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:20,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:20,714 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:53:20,715 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:20,715 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:53:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:20,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:20,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:53:20,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571357479] [2021-03-10 21:53:20,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:53:20,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:20,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:53:20,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:53:20,826 INFO L87 Difference]: Start difference. First operand 327 states and 972 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:21,243 INFO L93 Difference]: Finished difference Result 480 states and 1419 transitions. [2021-03-10 21:53:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:53:21,244 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:53:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:21,245 INFO L225 Difference]: With dead ends: 480 [2021-03-10 21:53:21,245 INFO L226 Difference]: Without dead ends: 465 [2021-03-10 21:53:21,245 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 349.4ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-03-10 21:53:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 333. [2021-03-10 21:53:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9909638554216866) internal successors, (993), 332 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 993 transitions. [2021-03-10 21:53:21,249 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 993 transitions. Word has length 20 [2021-03-10 21:53:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:21,249 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 993 transitions. [2021-03-10 21:53:21,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 993 transitions. [2021-03-10 21:53:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:21,250 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:21,250 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:21,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1615,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:21,451 INFO L428 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash 651640570, now seen corresponding path program 127 times [2021-03-10 21:53:21,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:21,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244589581] [2021-03-10 21:53:21,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:21,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244589581] [2021-03-10 21:53:21,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099654672] [2021-03-10 21:53:21,583 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:21,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:21,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:21,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:21,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:21,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:21,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:21,680 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:21,681 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:21,681 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:53:21,731 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:21,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:21,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:21,759 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:53:21,761 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:21,762 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:21,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:21,787 INFO L518 ElimStorePlain]: Eliminatee v_prenex_264 vanished before elimination [2021-03-10 21:53:21,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:21,788 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:53:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:21,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:21,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:53:21,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221984499] [2021-03-10 21:53:21,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:53:21,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:21,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:53:21,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:53:21,935 INFO L87 Difference]: Start difference. First operand 333 states and 993 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:22,342 INFO L93 Difference]: Finished difference Result 502 states and 1488 transitions. [2021-03-10 21:53:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:22,342 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:53:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:22,343 INFO L225 Difference]: With dead ends: 502 [2021-03-10 21:53:22,344 INFO L226 Difference]: Without dead ends: 487 [2021-03-10 21:53:22,344 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 355.4ms TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-03-10 21:53:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 330. [2021-03-10 21:53:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9817629179331306) internal successors, (981), 329 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 981 transitions. [2021-03-10 21:53:22,348 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 981 transitions. Word has length 20 [2021-03-10 21:53:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:22,348 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 981 transitions. [2021-03-10 21:53:22,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 981 transitions. [2021-03-10 21:53:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:22,349 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:22,349 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:22,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1625 [2021-03-10 21:53:22,550 INFO L428 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -263440918, now seen corresponding path program 128 times [2021-03-10 21:53:22,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:22,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452826087] [2021-03-10 21:53:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:22,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452826087] [2021-03-10 21:53:22,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175597332] [2021-03-10 21:53:22,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:22,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:22,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:22,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:22,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:22,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:22,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:22,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:22,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:22,765 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:53:22,787 INFO L388 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 20 treesize of output 16 [2021-03-10 21:53:22,788 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:22,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:22,794 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:53:22,795 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:22,795 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:15 [2021-03-10 21:53:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:22,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:22,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:53:22,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891636905] [2021-03-10 21:53:22,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:53:22,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:53:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:53:22,873 INFO L87 Difference]: Start difference. First operand 330 states and 981 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:23,182 INFO L93 Difference]: Finished difference Result 481 states and 1418 transitions. [2021-03-10 21:53:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:23,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:53:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:23,184 INFO L225 Difference]: With dead ends: 481 [2021-03-10 21:53:23,184 INFO L226 Difference]: Without dead ends: 466 [2021-03-10 21:53:23,184 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 228.6ms TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-03-10 21:53:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 327. [2021-03-10 21:53:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.98159509202454) internal successors, (972), 326 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 972 transitions. [2021-03-10 21:53:23,190 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 972 transitions. Word has length 20 [2021-03-10 21:53:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:23,190 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 972 transitions. [2021-03-10 21:53:23,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 972 transitions. [2021-03-10 21:53:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:23,191 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:23,191 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:23,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1632 [2021-03-10 21:53:23,399 INFO L428 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1576469964, now seen corresponding path program 129 times [2021-03-10 21:53:23,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:23,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322932337] [2021-03-10 21:53:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:23,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322932337] [2021-03-10 21:53:23,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458575369] [2021-03-10 21:53:23,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:23,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:53:23,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:23,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:23,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:23,669 INFO L388 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 26 treesize of output 20 [2021-03-10 21:53:23,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:23,674 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:23,695 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:23,695 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:59 [2021-03-10 21:53:23,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:23,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:23,804 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:23,810 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:23,824 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,883 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:23,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:23,888 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:23,893 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:23,898 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:23,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:23,903 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:23,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:23,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:23,956 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:181, output treesize:73 [2021-03-10 21:53:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:24,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:24,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:24,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543237160] [2021-03-10 21:53:24,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:24,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:24,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:24,074 INFO L87 Difference]: Start difference. First operand 327 states and 972 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:25,222 INFO L93 Difference]: Finished difference Result 570 states and 1676 transitions. [2021-03-10 21:53:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 21:53:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:25,224 INFO L225 Difference]: With dead ends: 570 [2021-03-10 21:53:25,224 INFO L226 Difference]: Without dead ends: 540 [2021-03-10 21:53:25,224 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1161.5ms TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2021-03-10 21:53:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-03-10 21:53:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 339. [2021-03-10 21:53:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.997041420118343) internal successors, (1013), 338 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1013 transitions. [2021-03-10 21:53:25,229 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1013 transitions. Word has length 20 [2021-03-10 21:53:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:25,229 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 1013 transitions. [2021-03-10 21:53:25,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1013 transitions. [2021-03-10 21:53:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:25,230 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:25,230 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:25,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1633 [2021-03-10 21:53:25,430 INFO L428 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2078261300, now seen corresponding path program 130 times [2021-03-10 21:53:25,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:25,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267152297] [2021-03-10 21:53:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:25,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267152297] [2021-03-10 21:53:25,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150401958] [2021-03-10 21:53:25,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:25,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:25,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:25,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:25,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:25,696 INFO L388 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 26 treesize of output 20 [2021-03-10 21:53:25,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:25,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:25,701 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:25,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:25,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:25,722 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:59 [2021-03-10 21:53:25,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:25,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:25,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:25,779 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:25,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:25,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:25,784 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:25,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:25,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:25,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:25,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:25,815 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:25,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:25,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:25,819 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:25,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:25,847 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:25,847 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:33 [2021-03-10 21:53:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:25,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:25,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:25,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134973219] [2021-03-10 21:53:25,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:25,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:25,957 INFO L87 Difference]: Start difference. First operand 339 states and 1013 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:27,002 INFO L93 Difference]: Finished difference Result 582 states and 1702 transitions. [2021-03-10 21:53:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:53:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:27,003 INFO L225 Difference]: With dead ends: 582 [2021-03-10 21:53:27,003 INFO L226 Difference]: Without dead ends: 552 [2021-03-10 21:53:27,004 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1014.2ms TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2021-03-10 21:53:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-03-10 21:53:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 337. [2021-03-10 21:53:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.994047619047619) internal successors, (1006), 336 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1006 transitions. [2021-03-10 21:53:27,009 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1006 transitions. Word has length 20 [2021-03-10 21:53:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:27,010 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 1006 transitions. [2021-03-10 21:53:27,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1006 transitions. [2021-03-10 21:53:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:27,010 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:27,010 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:27,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1643,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:27,223 INFO L428 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash 109921876, now seen corresponding path program 131 times [2021-03-10 21:53:27,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:27,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864330534] [2021-03-10 21:53:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:27,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864330534] [2021-03-10 21:53:27,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315852717] [2021-03-10 21:53:27,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:27,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:53:27,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:27,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:27,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:27,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:27,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:27,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:53:27,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:27,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:27,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:27,512 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:27,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:27,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:27,538 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2021-03-10 21:53:27,602 INFO L446 ElimStorePlain]: Different costs {0=[o_0, v_prenex_266], 1=[o_2, v_prenex_267]} [2021-03-10 21:53:27,606 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:27,607 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:27,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:27,635 INFO L388 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 30 treesize of output 24 [2021-03-10 21:53:27,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:27,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:27,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:27,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:27,664 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:27,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:27,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:27,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:27,692 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:27,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:27,716 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:27,716 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:87, output treesize:33 [2021-03-10 21:53:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:27,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:27,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:27,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678774794] [2021-03-10 21:53:27,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:27,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:27,828 INFO L87 Difference]: Start difference. First operand 337 states and 1006 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:28,780 INFO L93 Difference]: Finished difference Result 556 states and 1654 transitions. [2021-03-10 21:53:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:53:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:28,782 INFO L225 Difference]: With dead ends: 556 [2021-03-10 21:53:28,782 INFO L226 Difference]: Without dead ends: 541 [2021-03-10 21:53:28,782 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 764.1ms TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2021-03-10 21:53:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-03-10 21:53:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 339. [2021-03-10 21:53:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.997041420118343) internal successors, (1013), 338 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1013 transitions. [2021-03-10 21:53:28,787 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1013 transitions. Word has length 20 [2021-03-10 21:53:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:28,787 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 1013 transitions. [2021-03-10 21:53:28,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1013 transitions. [2021-03-10 21:53:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:28,788 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:28,788 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:28,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1653 [2021-03-10 21:53:28,988 INFO L428 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1150157674, now seen corresponding path program 132 times [2021-03-10 21:53:28,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:28,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373607260] [2021-03-10 21:53:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:29,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373607260] [2021-03-10 21:53:29,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379132650] [2021-03-10 21:53:29,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:29,138 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:53:29,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:29,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:29,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:29,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:29,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:29,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:29,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:53:29,243 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:29,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:29,268 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:29,268 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:63 [2021-03-10 21:53:29,372 INFO L446 ElimStorePlain]: Different costs {0=[o_0, v_prenex_269], 1=[v_prenex_270, o_2]} [2021-03-10 21:53:29,375 INFO L388 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 30 treesize of output 24 [2021-03-10 21:53:29,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:29,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:29,406 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:29,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:29,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:29,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:29,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:29,436 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:29,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:29,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:29,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:29,463 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:29,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:29,487 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:29,487 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:87, output treesize:33 [2021-03-10 21:53:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:29,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:29,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:29,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80139762] [2021-03-10 21:53:29,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:29,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:29,603 INFO L87 Difference]: Start difference. First operand 339 states and 1013 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:30,720 INFO L93 Difference]: Finished difference Result 675 states and 2009 transitions. [2021-03-10 21:53:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:53:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:30,722 INFO L225 Difference]: With dead ends: 675 [2021-03-10 21:53:30,722 INFO L226 Difference]: Without dead ends: 660 [2021-03-10 21:53:30,722 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 918.1ms TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2021-03-10 21:53:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-03-10 21:53:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 337. [2021-03-10 21:53:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.0) internal successors, (1008), 336 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1008 transitions. [2021-03-10 21:53:30,727 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1008 transitions. Word has length 20 [2021-03-10 21:53:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:30,727 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 1008 transitions. [2021-03-10 21:53:30,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1008 transitions. [2021-03-10 21:53:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:30,728 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:30,728 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:30,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1664 [2021-03-10 21:53:30,929 INFO L428 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 585725364, now seen corresponding path program 133 times [2021-03-10 21:53:30,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:30,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087106930] [2021-03-10 21:53:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:31,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087106930] [2021-03-10 21:53:31,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542401586] [2021-03-10 21:53:31,051 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:31,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:31,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:31,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:31,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:31,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:31,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:31,263 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:31,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:31,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:31,302 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:31,490 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:31,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:31,496 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:31,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:31,500 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:31,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:31,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:31,542 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:31,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:31,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:31,547 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:31,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:31,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:31,584 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:101, output treesize:41 [2021-03-10 21:53:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:31,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:31,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:31,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736082202] [2021-03-10 21:53:31,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:31,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:31,694 INFO L87 Difference]: Start difference. First operand 337 states and 1008 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:32,134 INFO L93 Difference]: Finished difference Result 446 states and 1313 transitions. [2021-03-10 21:53:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:32,136 INFO L225 Difference]: With dead ends: 446 [2021-03-10 21:53:32,136 INFO L226 Difference]: Without dead ends: 431 [2021-03-10 21:53:32,136 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 476.6ms TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-03-10 21:53:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 334. [2021-03-10 21:53:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.993993993993994) internal successors, (997), 333 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 997 transitions. [2021-03-10 21:53:32,142 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 997 transitions. Word has length 20 [2021-03-10 21:53:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:32,142 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 997 transitions. [2021-03-10 21:53:32,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 997 transitions. [2021-03-10 21:53:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:32,143 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:32,143 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:32,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1677 [2021-03-10 21:53:32,343 INFO L428 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2090027242, now seen corresponding path program 134 times [2021-03-10 21:53:32,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:32,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289137013] [2021-03-10 21:53:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:32,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289137013] [2021-03-10 21:53:32,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168333891] [2021-03-10 21:53:32,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:32,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:32,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:32,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:32,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:32,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:32,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:32,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:32,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:32,807 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:32,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:32,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:32,846 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:32,929 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:32,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:32,936 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:32,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:32,942 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:32,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:32,948 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:32,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:32,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:32,953 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:33,064 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-03-10 21:53:33,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:33,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:33,070 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:33,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:33,076 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:33,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:33,081 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:33,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:33,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:33,086 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:33,190 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:53:33,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:33,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:33,193 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:233, output treesize:113 [2021-03-10 21:53:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:33,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:33,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:33,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979833434] [2021-03-10 21:53:33,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:33,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:33,472 INFO L87 Difference]: Start difference. First operand 334 states and 997 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:34,142 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-03-10 21:53:34,369 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-03-10 21:53:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:34,386 INFO L93 Difference]: Finished difference Result 585 states and 1711 transitions. [2021-03-10 21:53:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 21:53:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:34,387 INFO L225 Difference]: With dead ends: 585 [2021-03-10 21:53:34,388 INFO L226 Difference]: Without dead ends: 555 [2021-03-10 21:53:34,388 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1121.3ms TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2021-03-10 21:53:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-03-10 21:53:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 333. [2021-03-10 21:53:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9879518072289155) internal successors, (992), 332 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 992 transitions. [2021-03-10 21:53:34,392 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 992 transitions. Word has length 20 [2021-03-10 21:53:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:34,392 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 992 transitions. [2021-03-10 21:53:34,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 992 transitions. [2021-03-10 21:53:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:34,393 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:34,393 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:34,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1693 [2021-03-10 21:53:34,593 INFO L428 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1730012500, now seen corresponding path program 135 times [2021-03-10 21:53:34,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:34,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685977287] [2021-03-10 21:53:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:34,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685977287] [2021-03-10 21:53:34,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552270280] [2021-03-10 21:53:34,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:34,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:53:34,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:34,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:34,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:34,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:34,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:34,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:34,852 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:34,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:34,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:34,890 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:35,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:35,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:35,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:35,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:35,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:35,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:35,099 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:35,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:35,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:35,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:35,134 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:35,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:35,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:35,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:35,166 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:35,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:35,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:35,196 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:81, output treesize:35 [2021-03-10 21:53:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:35,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:35,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:35,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739962078] [2021-03-10 21:53:35,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:35,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:35,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:35,323 INFO L87 Difference]: Start difference. First operand 333 states and 992 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:36,023 INFO L93 Difference]: Finished difference Result 595 states and 1730 transitions. [2021-03-10 21:53:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-10 21:53:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:36,024 INFO L225 Difference]: With dead ends: 595 [2021-03-10 21:53:36,024 INFO L226 Difference]: Without dead ends: 565 [2021-03-10 21:53:36,025 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 693.6ms TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:53:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-03-10 21:53:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 336. [2021-03-10 21:53:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.997014925373134) internal successors, (1004), 335 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1004 transitions. [2021-03-10 21:53:36,029 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1004 transitions. Word has length 20 [2021-03-10 21:53:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:36,029 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1004 transitions. [2021-03-10 21:53:36,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1004 transitions. [2021-03-10 21:53:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:36,030 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:36,030 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:36,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1708,136 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:36,231 INFO L428 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:36,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 400084338, now seen corresponding path program 136 times [2021-03-10 21:53:36,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:36,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154754215] [2021-03-10 21:53:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:36,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154754215] [2021-03-10 21:53:36,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864138153] [2021-03-10 21:53:36,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:36,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:36,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:36,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:36,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:36,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:36,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:36,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:36,520 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:36,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:36,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:36,558 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:36,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:36,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:36,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:36,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:36,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:36,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:36,680 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:36,713 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:36,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:36,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:36,717 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:36,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:36,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:36,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:36,753 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:36,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:36,786 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:36,786 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:41 [2021-03-10 21:53:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:36,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:36,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:36,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050674676] [2021-03-10 21:53:36,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:36,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:36,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:36,937 INFO L87 Difference]: Start difference. First operand 336 states and 1004 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:37,800 INFO L93 Difference]: Finished difference Result 570 states and 1691 transitions. [2021-03-10 21:53:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:53:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:37,802 INFO L225 Difference]: With dead ends: 570 [2021-03-10 21:53:37,802 INFO L226 Difference]: Without dead ends: 555 [2021-03-10 21:53:37,802 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 709.5ms TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:53:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-03-10 21:53:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 332. [2021-03-10 21:53:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.984894259818731) internal successors, (988), 331 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 988 transitions. [2021-03-10 21:53:37,813 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 988 transitions. Word has length 20 [2021-03-10 21:53:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:37,813 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 988 transitions. [2021-03-10 21:53:37,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 988 transitions. [2021-03-10 21:53:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:37,813 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:37,813 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:38,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1729,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:38,014 INFO L428 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash 450882824, now seen corresponding path program 137 times [2021-03-10 21:53:38,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:38,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441923030] [2021-03-10 21:53:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:38,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441923030] [2021-03-10 21:53:38,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980806344] [2021-03-10 21:53:38,150 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:38,174 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:38,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:38,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:38,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:38,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:38,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:38,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:38,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:38,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:38,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:38,254 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:53:38,363 INFO L388 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 30 treesize of output 24 [2021-03-10 21:53:38,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:38,367 INFO L388 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 21 treesize of output 17 [2021-03-10 21:53:38,369 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:38,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:38,385 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:53:38,386 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:38,386 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:53:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:38,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:38,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:38,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618497312] [2021-03-10 21:53:38,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:38,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:38,495 INFO L87 Difference]: Start difference. First operand 332 states and 988 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:39,792 INFO L93 Difference]: Finished difference Result 764 states and 2237 transitions. [2021-03-10 21:53:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 21:53:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:39,794 INFO L225 Difference]: With dead ends: 764 [2021-03-10 21:53:39,794 INFO L226 Difference]: Without dead ends: 734 [2021-03-10 21:53:39,794 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1040.1ms TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2021-03-10 21:53:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-03-10 21:53:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 331. [2021-03-10 21:53:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.981818181818182) internal successors, (984), 330 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 984 transitions. [2021-03-10 21:53:39,799 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 984 transitions. Word has length 20 [2021-03-10 21:53:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:39,800 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 984 transitions. [2021-03-10 21:53:39,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 984 transitions. [2021-03-10 21:53:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:39,800 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:39,800 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:40,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1736 [2021-03-10 21:53:40,001 INFO L428 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:40,001 INFO L82 PathProgramCache]: Analyzing trace with hash -40662816, now seen corresponding path program 138 times [2021-03-10 21:53:40,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:40,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335206921] [2021-03-10 21:53:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:40,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335206921] [2021-03-10 21:53:40,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087981246] [2021-03-10 21:53:40,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:40,157 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:53:40,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:40,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:40,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:40,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:53:40,394 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:40,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:40,427 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:40,455 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:40,456 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:71 [2021-03-10 21:53:40,621 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:40,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:40,627 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:40,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:40,639 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:40,644 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:40,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:40,733 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:40,739 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:40,744 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:40,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:40,749 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:40,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:40,826 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:40,826 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:205, output treesize:73 [2021-03-10 21:53:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:40,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:40,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:40,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199618582] [2021-03-10 21:53:40,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:40,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:40,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:40,947 INFO L87 Difference]: Start difference. First operand 331 states and 984 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:41,535 INFO L93 Difference]: Finished difference Result 398 states and 1175 transitions. [2021-03-10 21:53:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:53:41,536 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:41,537 INFO L225 Difference]: With dead ends: 398 [2021-03-10 21:53:41,537 INFO L226 Difference]: Without dead ends: 383 [2021-03-10 21:53:41,537 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 621.0ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:53:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-03-10 21:53:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 333. [2021-03-10 21:53:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9849397590361444) internal successors, (991), 332 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 991 transitions. [2021-03-10 21:53:41,543 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 991 transitions. Word has length 20 [2021-03-10 21:53:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:41,543 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 991 transitions. [2021-03-10 21:53:41,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 991 transitions. [2021-03-10 21:53:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:41,544 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:41,544 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:41,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1744,139 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:41,766 INFO L428 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:41,766 INFO L82 PathProgramCache]: Analyzing trace with hash -542454152, now seen corresponding path program 139 times [2021-03-10 21:53:41,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:41,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599994441] [2021-03-10 21:53:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:41,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599994441] [2021-03-10 21:53:41,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178605910] [2021-03-10 21:53:41,900 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:41,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:41,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:42,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:42,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:42,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:42,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:53:42,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:42,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:42,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:42,209 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:71 [2021-03-10 21:53:42,285 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:42,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:42,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:42,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:42,296 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:42,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:42,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:42,332 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:42,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:42,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:42,337 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:42,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:42,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:42,369 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:53:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:42,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:42,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:42,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346843208] [2021-03-10 21:53:42,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:42,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:42,485 INFO L87 Difference]: Start difference. First operand 333 states and 991 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:42,950 INFO L93 Difference]: Finished difference Result 404 states and 1188 transitions. [2021-03-10 21:53:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:42,951 INFO L225 Difference]: With dead ends: 404 [2021-03-10 21:53:42,951 INFO L226 Difference]: Without dead ends: 389 [2021-03-10 21:53:42,951 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 462.2ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-03-10 21:53:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 329. [2021-03-10 21:53:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.9847560975609757) internal successors, (979), 328 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 979 transitions. [2021-03-10 21:53:42,956 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 979 transitions. Word has length 20 [2021-03-10 21:53:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:42,956 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 979 transitions. [2021-03-10 21:53:42,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 979 transitions. [2021-03-10 21:53:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:42,956 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:42,956 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:43,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1770 [2021-03-10 21:53:43,159 INFO L428 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1681237122, now seen corresponding path program 140 times [2021-03-10 21:53:43,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:43,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864012466] [2021-03-10 21:53:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:43,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864012466] [2021-03-10 21:53:43,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825589609] [2021-03-10 21:53:43,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:43,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:43,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:43,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:43,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:43,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:43,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:43,551 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:43,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:43,556 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:43,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:43,594 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:43,594 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:43,899 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:43,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:43,905 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:43,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:43,911 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:43,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:43,917 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:43,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:43,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:43,922 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:44,007 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:44,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:44,014 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:44,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:44,019 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:44,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:44,025 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:44,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:44,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:44,030 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:44,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:44,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:44,108 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:205, output treesize:73 [2021-03-10 21:53:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:44,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:44,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:44,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423596722] [2021-03-10 21:53:44,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:44,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:44,236 INFO L87 Difference]: Start difference. First operand 329 states and 979 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:44,898 INFO L93 Difference]: Finished difference Result 513 states and 1510 transitions. [2021-03-10 21:53:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:53:44,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:44,900 INFO L225 Difference]: With dead ends: 513 [2021-03-10 21:53:44,900 INFO L226 Difference]: Without dead ends: 498 [2021-03-10 21:53:44,900 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 840.9ms TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:53:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-03-10 21:53:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 335. [2021-03-10 21:53:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.0) internal successors, (1002), 334 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1002 transitions. [2021-03-10 21:53:44,905 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1002 transitions. Word has length 20 [2021-03-10 21:53:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:44,905 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 1002 transitions. [2021-03-10 21:53:44,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1002 transitions. [2021-03-10 21:53:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:44,905 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:44,905 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:45,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1791,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:45,106 INFO L428 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:45,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1179445786, now seen corresponding path program 141 times [2021-03-10 21:53:45,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:45,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509369179] [2021-03-10 21:53:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:45,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509369179] [2021-03-10 21:53:45,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470036435] [2021-03-10 21:53:45,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:45,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:53:45,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:45,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:45,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:45,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:45,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:45,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:45,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:45,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:45,393 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2021-03-10 21:53:45,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:45,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:45,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:45,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:45,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:45,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:45,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:45,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:45,501 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:45,501 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2021-03-10 21:53:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:45,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:45,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:45,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004320589] [2021-03-10 21:53:45,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:45,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:45,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:45,565 INFO L87 Difference]: Start difference. First operand 335 states and 1002 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:46,024 INFO L93 Difference]: Finished difference Result 503 states and 1481 transitions. [2021-03-10 21:53:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:53:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:46,026 INFO L225 Difference]: With dead ends: 503 [2021-03-10 21:53:46,026 INFO L226 Difference]: Without dead ends: 488 [2021-03-10 21:53:46,026 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 404.2ms TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:53:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-03-10 21:53:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 333. [2021-03-10 21:53:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.996987951807229) internal successors, (995), 332 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 995 transitions. [2021-03-10 21:53:46,031 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 995 transitions. Word has length 20 [2021-03-10 21:53:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:46,031 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 995 transitions. [2021-03-10 21:53:46,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 995 transitions. [2021-03-10 21:53:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:46,031 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:46,032 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:46,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1814,142 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:46,232 INFO L428 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -352399358, now seen corresponding path program 142 times [2021-03-10 21:53:46,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:46,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895968165] [2021-03-10 21:53:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:46,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895968165] [2021-03-10 21:53:46,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828773929] [2021-03-10 21:53:46,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:46,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:46,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:46,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:46,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:46,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:46,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:46,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:46,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:46,536 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:46,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:46,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:46,574 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:46,752 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:46,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:46,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:46,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:46,762 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:46,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:46,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:46,806 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:46,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:46,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:46,812 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:46,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:46,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:46,850 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:101, output treesize:38 [2021-03-10 21:53:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:46,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:46,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:46,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529619693] [2021-03-10 21:53:46,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:46,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:46,959 INFO L87 Difference]: Start difference. First operand 333 states and 995 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:47,338 INFO L93 Difference]: Finished difference Result 410 states and 1205 transitions. [2021-03-10 21:53:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:47,338 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:47,339 INFO L225 Difference]: With dead ends: 410 [2021-03-10 21:53:47,339 INFO L226 Difference]: Without dead ends: 395 [2021-03-10 21:53:47,339 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 395.1ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-03-10 21:53:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 330. [2021-03-10 21:53:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9908814589665655) internal successors, (984), 329 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 984 transitions. [2021-03-10 21:53:47,343 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 984 transitions. Word has length 20 [2021-03-10 21:53:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:47,343 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 984 transitions. [2021-03-10 21:53:47,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 984 transitions. [2021-03-10 21:53:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:47,343 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:47,343 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:47,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1819 [2021-03-10 21:53:47,544 INFO L428 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1151902520, now seen corresponding path program 143 times [2021-03-10 21:53:47,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:47,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112095722] [2021-03-10 21:53:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:47,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112095722] [2021-03-10 21:53:47,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417156404] [2021-03-10 21:53:47,764 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:47,796 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:47,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:47,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:47,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:47,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:47,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:47,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:47,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:47,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:47,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:47,940 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:47,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:47,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:47,977 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:53:48,054 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:48,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:48,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:48,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:48,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:48,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:48,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:48,064 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:48,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:48,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:48,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:48,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:48,110 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:48,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:48,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:48,114 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:48,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:48,155 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:48,155 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:41 [2021-03-10 21:53:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:48,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:48,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:48,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742542009] [2021-03-10 21:53:48,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:48,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:48,303 INFO L87 Difference]: Start difference. First operand 330 states and 984 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:48,896 INFO L93 Difference]: Finished difference Result 530 states and 1567 transitions. [2021-03-10 21:53:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:53:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:48,898 INFO L225 Difference]: With dead ends: 530 [2021-03-10 21:53:48,898 INFO L226 Difference]: Without dead ends: 515 [2021-03-10 21:53:48,898 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 606.1ms TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:53:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-03-10 21:53:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 329. [2021-03-10 21:53:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.9847560975609757) internal successors, (979), 328 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 979 transitions. [2021-03-10 21:53:48,902 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 979 transitions. Word has length 20 [2021-03-10 21:53:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:48,903 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 979 transitions. [2021-03-10 21:53:48,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 979 transitions. [2021-03-10 21:53:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:48,903 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:48,903 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:49,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1831,144 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:49,104 INFO L428 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash 791887778, now seen corresponding path program 144 times [2021-03-10 21:53:49,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:49,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709865633] [2021-03-10 21:53:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:49,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709865633] [2021-03-10 21:53:49,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017578121] [2021-03-10 21:53:49,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:49,313 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:53:49,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:49,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:49,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:49,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:49,376 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:49,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:49,380 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:49,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:49,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:49,417 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:49,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:49,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:49,580 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:49,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:49,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:49,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:49,615 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:49,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:49,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:49,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:49,650 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:49,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:49,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:49,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:49,682 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:49,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:49,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:49,711 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:81, output treesize:35 [2021-03-10 21:53:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:49,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:49,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:49,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344052453] [2021-03-10 21:53:49,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:49,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:49,833 INFO L87 Difference]: Start difference. First operand 329 states and 979 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:50,206 INFO L93 Difference]: Finished difference Result 497 states and 1440 transitions. [2021-03-10 21:53:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:53:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:50,207 INFO L225 Difference]: With dead ends: 497 [2021-03-10 21:53:50,207 INFO L226 Difference]: Without dead ends: 467 [2021-03-10 21:53:50,208 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 457.6ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-03-10 21:53:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 332. [2021-03-10 21:53:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.9939577039274923) internal successors, (991), 331 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 991 transitions. [2021-03-10 21:53:50,212 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 991 transitions. Word has length 20 [2021-03-10 21:53:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:50,212 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 991 transitions. [2021-03-10 21:53:50,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 991 transitions. [2021-03-10 21:53:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:50,212 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:50,212 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:50,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1840 [2021-03-10 21:53:50,414 INFO L428 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:50,414 INFO L82 PathProgramCache]: Analyzing trace with hash -538040384, now seen corresponding path program 145 times [2021-03-10 21:53:50,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:50,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224297336] [2021-03-10 21:53:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:50,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224297336] [2021-03-10 21:53:50,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306972996] [2021-03-10 21:53:50,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:50,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:50,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:50,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:50,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:50,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:50,707 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:50,743 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:50,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:50,745 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:53:50,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:50,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:50,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:50,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:50,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:50,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:50,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:50,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:50,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:50,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:50,897 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:50,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:50,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:50,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:50,940 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:50,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:50,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:50,973 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:41 [2021-03-10 21:53:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:51,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:51,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:51,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443749843] [2021-03-10 21:53:51,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:51,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:51,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:51,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:51,134 INFO L87 Difference]: Start difference. First operand 332 states and 991 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:51,471 INFO L93 Difference]: Finished difference Result 472 states and 1401 transitions. [2021-03-10 21:53:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:53:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:51,472 INFO L225 Difference]: With dead ends: 472 [2021-03-10 21:53:51,472 INFO L226 Difference]: Without dead ends: 457 [2021-03-10 21:53:51,472 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 474.3ms TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-03-10 21:53:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 328. [2021-03-10 21:53:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.981651376146789) internal successors, (975), 327 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 975 transitions. [2021-03-10 21:53:51,477 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 975 transitions. Word has length 20 [2021-03-10 21:53:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:51,477 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 975 transitions. [2021-03-10 21:53:51,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 975 transitions. [2021-03-10 21:53:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:51,477 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:51,477 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:51,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1857,146 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:51,678 INFO L428 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash -916485230, now seen corresponding path program 146 times [2021-03-10 21:53:51,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:51,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781394948] [2021-03-10 21:53:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:51,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781394948] [2021-03-10 21:53:51,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184529477] [2021-03-10 21:53:51,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:51,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:51,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:51,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:53:51,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:51,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:51,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:51,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:51,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:51,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:51,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:51,921 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:51,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:51,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:51,964 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:53:52,250 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:52,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:52,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:52,262 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:52,268 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:53:52,273 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:52,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:52,361 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:52,366 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:52,372 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:52,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:53:52,377 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:52,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:52,452 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:53:52,452 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:197, output treesize:73 [2021-03-10 21:53:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:52,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:52,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:52,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100122114] [2021-03-10 21:53:52,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:52,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:52,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:52,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:52,573 INFO L87 Difference]: Start difference. First operand 328 states and 975 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:53,255 INFO L93 Difference]: Finished difference Result 490 states and 1451 transitions. [2021-03-10 21:53:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:53:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:53,257 INFO L225 Difference]: With dead ends: 490 [2021-03-10 21:53:53,257 INFO L226 Difference]: Without dead ends: 475 [2021-03-10 21:53:53,257 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 700.6ms TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:53:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-03-10 21:53:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 338. [2021-03-10 21:53:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9970326409495547) internal successors, (1010), 337 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1010 transitions. [2021-03-10 21:53:53,261 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1010 transitions. Word has length 20 [2021-03-10 21:53:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:53,261 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1010 transitions. [2021-03-10 21:53:53,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1010 transitions. [2021-03-10 21:53:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:53,262 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:53,262 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:53,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1864 [2021-03-10 21:53:53,463 INFO L428 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:53,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1418276566, now seen corresponding path program 147 times [2021-03-10 21:53:53,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:53,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650128424] [2021-03-10 21:53:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:53,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650128424] [2021-03-10 21:53:53,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141035060] [2021-03-10 21:53:53,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:53,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:53:53,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:53,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:53,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:53,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:53,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:53,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:53,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:53,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:53,718 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2021-03-10 21:53:53,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:53,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:53,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:53,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:53,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:53,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:53,815 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:53,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:53,827 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:53,827 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2021-03-10 21:53:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:53,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:53,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:53,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727852483] [2021-03-10 21:53:53,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:53,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:53,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:53,890 INFO L87 Difference]: Start difference. First operand 338 states and 1010 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:54,166 INFO L93 Difference]: Finished difference Result 457 states and 1345 transitions. [2021-03-10 21:53:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:53:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:54,168 INFO L225 Difference]: With dead ends: 457 [2021-03-10 21:53:54,168 INFO L226 Difference]: Without dead ends: 442 [2021-03-10 21:53:54,168 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 287.0ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-03-10 21:53:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 336. [2021-03-10 21:53:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.994029850746269) internal successors, (1003), 335 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1003 transitions. [2021-03-10 21:53:54,172 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1003 transitions. Word has length 20 [2021-03-10 21:53:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:54,172 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1003 transitions. [2021-03-10 21:53:54,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1003 transitions. [2021-03-10 21:53:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:54,173 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:54,173 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:54,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1886,148 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:54,374 INFO L428 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1344845586, now seen corresponding path program 148 times [2021-03-10 21:53:54,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:54,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314959918] [2021-03-10 21:53:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:54,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314959918] [2021-03-10 21:53:54,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671908414] [2021-03-10 21:53:54,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:54,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:53:54,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:54,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:54,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:54,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:54,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:54,601 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:54,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:54,644 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:54,644 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:53:54,819 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:54,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:54,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:54,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:54,829 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:54,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:54,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:54,874 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:54,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:54,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:54,878 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:54,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:54,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:54,917 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:35 [2021-03-10 21:53:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:55,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:55,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:55,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964686382] [2021-03-10 21:53:55,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:55,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:55,026 INFO L87 Difference]: Start difference. First operand 336 states and 1003 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:55,500 INFO L93 Difference]: Finished difference Result 411 states and 1208 transitions. [2021-03-10 21:53:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:55,501 INFO L225 Difference]: With dead ends: 411 [2021-03-10 21:53:55,501 INFO L226 Difference]: Without dead ends: 396 [2021-03-10 21:53:55,501 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 397.8ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-03-10 21:53:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 333. [2021-03-10 21:53:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9879518072289155) internal successors, (992), 332 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 992 transitions. [2021-03-10 21:53:55,505 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 992 transitions. Word has length 20 [2021-03-10 21:53:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:55,505 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 992 transitions. [2021-03-10 21:53:55,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 992 transitions. [2021-03-10 21:53:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:55,506 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:55,506 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:55,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1891 [2021-03-10 21:53:55,707 INFO L428 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:55,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:55,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1445819832, now seen corresponding path program 149 times [2021-03-10 21:53:55,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:55,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953624893] [2021-03-10 21:53:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:55,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953624893] [2021-03-10 21:53:55,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339487370] [2021-03-10 21:53:55,872 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:55,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:53:55,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:55,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:55,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:55,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:55,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:55,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:55,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:55,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:55,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:55,970 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:56,011 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:56,014 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:53:56,014 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:53:56,100 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_4]} [2021-03-10 21:53:56,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:56,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:56,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:56,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:56,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:56,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:56,110 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:56,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:56,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:56,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:56,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:56,160 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:56,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:56,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:56,164 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:56,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:56,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:56,208 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:53:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:56,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:56,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:56,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16633246] [2021-03-10 21:53:56,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:56,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:56,359 INFO L87 Difference]: Start difference. First operand 333 states and 992 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:56,768 INFO L93 Difference]: Finished difference Result 492 states and 1455 transitions. [2021-03-10 21:53:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:53:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:56,770 INFO L225 Difference]: With dead ends: 492 [2021-03-10 21:53:56,770 INFO L226 Difference]: Without dead ends: 477 [2021-03-10 21:53:56,770 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 445.1ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-03-10 21:53:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 332. [2021-03-10 21:53:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.9818731117824773) internal successors, (987), 331 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 987 transitions. [2021-03-10 21:53:56,776 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 987 transitions. Word has length 20 [2021-03-10 21:53:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:56,776 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 987 transitions. [2021-03-10 21:53:56,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 987 transitions. [2021-03-10 21:53:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:56,777 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:56,777 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:57,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1900 [2021-03-10 21:53:57,000 INFO L428 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1963107754, now seen corresponding path program 150 times [2021-03-10 21:53:57,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:57,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4556810] [2021-03-10 21:53:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:57,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4556810] [2021-03-10 21:53:57,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380940088] [2021-03-10 21:53:57,132 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:57,154 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:53:57,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:57,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:57,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:57,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:57,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:57,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:57,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:57,257 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2021-03-10 21:53:57,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:57,295 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:57,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:57,299 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:57,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:57,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:57,348 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:57,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:57,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:57,352 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:57,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:57,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:57,393 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:35 [2021-03-10 21:53:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:57,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:57,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:57,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27904415] [2021-03-10 21:53:57,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:57,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:57,500 INFO L87 Difference]: Start difference. First operand 332 states and 987 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:57,853 INFO L93 Difference]: Finished difference Result 400 states and 1180 transitions. [2021-03-10 21:53:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:53:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:57,854 INFO L225 Difference]: With dead ends: 400 [2021-03-10 21:53:57,854 INFO L226 Difference]: Without dead ends: 385 [2021-03-10 21:53:57,855 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 337.4ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:53:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-03-10 21:53:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 329. [2021-03-10 21:53:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.9847560975609757) internal successors, (979), 328 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 979 transitions. [2021-03-10 21:53:57,858 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 979 transitions. Word has length 20 [2021-03-10 21:53:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:57,859 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 979 transitions. [2021-03-10 21:53:57,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 979 transitions. [2021-03-10 21:53:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:57,859 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:57,859 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:58,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 151 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1907 [2021-03-10 21:53:58,060 INFO L428 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 244123072, now seen corresponding path program 151 times [2021-03-10 21:53:58,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:58,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806567066] [2021-03-10 21:53:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:58,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806567066] [2021-03-10 21:53:58,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910601298] [2021-03-10 21:53:58,212 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:58,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:53:58,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:58,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:58,300 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:58,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:58,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:58,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-03-10 21:53:58,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:58,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:58,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:53:58,356 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:58,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:58,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:58,410 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:58,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:58,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:58,415 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:58,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:58,461 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:53:58,461 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:41 [2021-03-10 21:53:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:58,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:58,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:58,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244424206] [2021-03-10 21:53:58,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:58,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:58,611 INFO L87 Difference]: Start difference. First operand 329 states and 979 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:53:59,116 INFO L93 Difference]: Finished difference Result 491 states and 1453 transitions. [2021-03-10 21:53:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:53:59,116 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:53:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:53:59,117 INFO L225 Difference]: With dead ends: 491 [2021-03-10 21:53:59,117 INFO L226 Difference]: Without dead ends: 476 [2021-03-10 21:53:59,118 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 407.6ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:53:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-03-10 21:53:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 328. [2021-03-10 21:53:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.981651376146789) internal successors, (975), 327 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:53:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 975 transitions. [2021-03-10 21:53:59,122 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 975 transitions. Word has length 20 [2021-03-10 21:53:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:53:59,122 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 975 transitions. [2021-03-10 21:53:59,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:53:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 975 transitions. [2021-03-10 21:53:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:53:59,123 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:53:59,123 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:53:59,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1911 [2021-03-10 21:53:59,323 INFO L428 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:53:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:53:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1640510250, now seen corresponding path program 152 times [2021-03-10 21:53:59,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:53:59,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440249308] [2021-03-10 21:53:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:53:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:53:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:59,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440249308] [2021-03-10 21:53:59,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760498149] [2021-03-10 21:53:59,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:53:59,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:53:59,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:53:59,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:53:59,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:53:59,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:53:59,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:59,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:59,644 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:53:59,644 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2021-03-10 21:53:59,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:59,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:53:59,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:59,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:59,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:53:59,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:53:59,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:53:59,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:53:59,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:53:59,761 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:12 [2021-03-10 21:53:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:53:59,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:53:59,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:53:59,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3929164] [2021-03-10 21:53:59,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:53:59,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:53:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:53:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:53:59,825 INFO L87 Difference]: Start difference. First operand 328 states and 975 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:00,046 INFO L93 Difference]: Finished difference Result 447 states and 1320 transitions. [2021-03-10 21:54:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:54:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:00,048 INFO L225 Difference]: With dead ends: 447 [2021-03-10 21:54:00,048 INFO L226 Difference]: Without dead ends: 432 [2021-03-10 21:54:00,048 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 323.1ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-03-10 21:54:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 334. [2021-03-10 21:54:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.990990990990991) internal successors, (996), 333 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 996 transitions. [2021-03-10 21:54:00,052 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 996 transitions. Word has length 20 [2021-03-10 21:54:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:00,052 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 996 transitions. [2021-03-10 21:54:00,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 996 transitions. [2021-03-10 21:54:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:00,053 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:00,053 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:00,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1916,153 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:00,254 INFO L428 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 310582088, now seen corresponding path program 153 times [2021-03-10 21:54:00,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:00,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082462300] [2021-03-10 21:54:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:00,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082462300] [2021-03-10 21:54:00,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145120570] [2021-03-10 21:54:00,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:00,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:54:00,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:00,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:00,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:00,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:00,514 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:00,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:00,518 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:00,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:00,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:00,557 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:54:00,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:00,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:00,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:00,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:00,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:00,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:00,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:00,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:00,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:00,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:00,713 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:00,745 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:00,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:00,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:00,750 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:00,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:00,783 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:00,783 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:41 [2021-03-10 21:54:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:00,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:00,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:00,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362156161] [2021-03-10 21:54:00,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:00,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:00,941 INFO L87 Difference]: Start difference. First operand 334 states and 996 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:01,360 INFO L93 Difference]: Finished difference Result 472 states and 1401 transitions. [2021-03-10 21:54:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:01,361 INFO L225 Difference]: With dead ends: 472 [2021-03-10 21:54:01,361 INFO L226 Difference]: Without dead ends: 457 [2021-03-10 21:54:01,361 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 445.3ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:54:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-03-10 21:54:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 331. [2021-03-10 21:54:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.981818181818182) internal successors, (984), 330 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 984 transitions. [2021-03-10 21:54:01,366 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 984 transitions. Word has length 20 [2021-03-10 21:54:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:01,366 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 984 transitions. [2021-03-10 21:54:01,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 984 transitions. [2021-03-10 21:54:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:01,366 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:01,366 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:01,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1921,154 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:01,567 INFO L428 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:01,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash -604499400, now seen corresponding path program 154 times [2021-03-10 21:54:01,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:01,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145423533] [2021-03-10 21:54:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:01,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145423533] [2021-03-10 21:54:01,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855800031] [2021-03-10 21:54:01,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:01,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:01,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:01,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:01,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:01,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:01,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:01,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:01,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:01,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:01,830 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:25 [2021-03-10 21:54:01,859 INFO L446 ElimStorePlain]: Different costs {0=[o_4], 1=[o_0]} [2021-03-10 21:54:01,863 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:01,864 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:01,867 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:01,872 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:01,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:01,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:01,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:01,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:01,918 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:01,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:01,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:01,922 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:01,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:01,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:01,961 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:41 [2021-03-10 21:54:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:02,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:02,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:02,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558700244] [2021-03-10 21:54:02,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:02,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:02,123 INFO L87 Difference]: Start difference. First operand 331 states and 984 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:02,531 INFO L93 Difference]: Finished difference Result 464 states and 1382 transitions. [2021-03-10 21:54:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:02,532 INFO L225 Difference]: With dead ends: 464 [2021-03-10 21:54:02,532 INFO L226 Difference]: Without dead ends: 449 [2021-03-10 21:54:02,532 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 427.2ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:54:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-03-10 21:54:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 327. [2021-03-10 21:54:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.98159509202454) internal successors, (972), 326 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 972 transitions. [2021-03-10 21:54:02,536 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 972 transitions. Word has length 20 [2021-03-10 21:54:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 972 transitions. [2021-03-10 21:54:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 972 transitions. [2021-03-10 21:54:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:02,537 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:02,537 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:02,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1928,155 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:02,737 INFO L428 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:02,738 INFO L82 PathProgramCache]: Analyzing trace with hash 988375680, now seen corresponding path program 155 times [2021-03-10 21:54:02,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:02,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032368324] [2021-03-10 21:54:02,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:02,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032368324] [2021-03-10 21:54:02,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610362262] [2021-03-10 21:54:02,872 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:02,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:54:02,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:02,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:02,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:02,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:02,923 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:02,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:02,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:02,950 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:02,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:02,952 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:54:03,064 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:03,066 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:03,068 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:03,069 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:03,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:03,087 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:03,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:03,087 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:03,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:03,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:03,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069187823] [2021-03-10 21:54:03,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:03,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:03,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:03,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:03,216 INFO L87 Difference]: Start difference. First operand 327 states and 972 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:04,389 INFO L93 Difference]: Finished difference Result 641 states and 1907 transitions. [2021-03-10 21:54:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 21:54:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:04,391 INFO L225 Difference]: With dead ends: 641 [2021-03-10 21:54:04,391 INFO L226 Difference]: Without dead ends: 611 [2021-03-10 21:54:04,392 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 989.3ms TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2021-03-10 21:54:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-03-10 21:54:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 330. [2021-03-10 21:54:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9817629179331306) internal successors, (981), 329 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 981 transitions. [2021-03-10 21:54:04,397 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 981 transitions. Word has length 20 [2021-03-10 21:54:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:04,397 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 981 transitions. [2021-03-10 21:54:04,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 981 transitions. [2021-03-10 21:54:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:04,398 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:04,398 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:04,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1933,156 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:04,598 INFO L428 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1178839468, now seen corresponding path program 156 times [2021-03-10 21:54:04,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:04,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786902209] [2021-03-10 21:54:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:04,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786902209] [2021-03-10 21:54:04,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011330917] [2021-03-10 21:54:04,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:04,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:54:04,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:04,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:04,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:04,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:04,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:04,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:04,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:04,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:04,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:04,838 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:04,926 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:04,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:04,930 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:04,932 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:04,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:04,948 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:04,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:04,949 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:05,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:05,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:05,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732958851] [2021-03-10 21:54:05,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:05,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:05,067 INFO L87 Difference]: Start difference. First operand 330 states and 981 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:05,506 INFO L93 Difference]: Finished difference Result 485 states and 1435 transitions. [2021-03-10 21:54:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:54:05,507 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:05,508 INFO L225 Difference]: With dead ends: 485 [2021-03-10 21:54:05,508 INFO L226 Difference]: Without dead ends: 470 [2021-03-10 21:54:05,508 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 382.9ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-03-10 21:54:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 336. [2021-03-10 21:54:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.991044776119403) internal successors, (1002), 335 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1002 transitions. [2021-03-10 21:54:05,513 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1002 transitions. Word has length 20 [2021-03-10 21:54:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:05,513 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1002 transitions. [2021-03-10 21:54:05,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1002 transitions. [2021-03-10 21:54:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:05,513 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:05,514 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:05,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1945,157 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:05,714 INFO L428 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1786199666, now seen corresponding path program 157 times [2021-03-10 21:54:05,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:05,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633207962] [2021-03-10 21:54:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:05,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633207962] [2021-03-10 21:54:05,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929051379] [2021-03-10 21:54:05,866 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:05,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:05,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:05,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:05,937 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:05,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:05,941 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:05,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:05,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:05,974 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:06,029 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:06,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:06,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:06,059 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:06,062 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:06,063 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:06,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:06,091 INFO L518 ElimStorePlain]: Eliminatee v_prenex_310 vanished before elimination [2021-03-10 21:54:06,092 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:06,092 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:54:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:06,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:06,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:06,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739851553] [2021-03-10 21:54:06,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:06,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:06,247 INFO L87 Difference]: Start difference. First operand 336 states and 1002 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:06,595 INFO L93 Difference]: Finished difference Result 507 states and 1504 transitions. [2021-03-10 21:54:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:06,596 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:06,597 INFO L225 Difference]: With dead ends: 507 [2021-03-10 21:54:06,597 INFO L226 Difference]: Without dead ends: 492 [2021-03-10 21:54:06,597 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 406.0ms TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-03-10 21:54:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 333. [2021-03-10 21:54:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9819277108433737) internal successors, (990), 332 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 990 transitions. [2021-03-10 21:54:06,601 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 990 transitions. Word has length 20 [2021-03-10 21:54:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:06,602 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 990 transitions. [2021-03-10 21:54:06,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 990 transitions. [2021-03-10 21:54:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:06,602 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:06,602 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:06,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1956,158 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:06,803 INFO L428 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:06,803 INFO L82 PathProgramCache]: Analyzing trace with hash 871118178, now seen corresponding path program 158 times [2021-03-10 21:54:06,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:06,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985952710] [2021-03-10 21:54:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:06,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985952710] [2021-03-10 21:54:06,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158630861] [2021-03-10 21:54:06,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:06,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:06,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:06,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:54:06,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:07,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:07,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:07,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:07,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:07,021 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:54:07,044 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:07,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:07,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:07,052 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:07,053 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:07,053 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:15 [2021-03-10 21:54:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:07,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:07,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:07,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191696579] [2021-03-10 21:54:07,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:07,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:07,138 INFO L87 Difference]: Start difference. First operand 333 states and 990 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:07,435 INFO L93 Difference]: Finished difference Result 486 states and 1434 transitions. [2021-03-10 21:54:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:54:07,436 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:07,436 INFO L225 Difference]: With dead ends: 486 [2021-03-10 21:54:07,436 INFO L226 Difference]: Without dead ends: 471 [2021-03-10 21:54:07,437 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 253.9ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-03-10 21:54:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 326. [2021-03-10 21:54:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.9815384615384617) internal successors, (969), 325 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 969 transitions. [2021-03-10 21:54:07,441 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 969 transitions. Word has length 20 [2021-03-10 21:54:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:07,441 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 969 transitions. [2021-03-10 21:54:07,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 969 transitions. [2021-03-10 21:54:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:07,442 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:07,442 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:07,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1963 [2021-03-10 21:54:07,642 INFO L428 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1075844112, now seen corresponding path program 159 times [2021-03-10 21:54:07,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:07,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792573499] [2021-03-10 21:54:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:07,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792573499] [2021-03-10 21:54:07,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366521561] [2021-03-10 21:54:07,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:07,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:54:07,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:07,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:54:07,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:07,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:07,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:07,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:07,936 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:07,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:07,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:54:07,941 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:07,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:07,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:07,973 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2021-03-10 21:54:08,147 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:08,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:08,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:08,161 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:08,167 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:08,172 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:08,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:08,264 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:08,270 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:08,275 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:08,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:08,280 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:08,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:08,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:54:08,358 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:197, output treesize:73 [2021-03-10 21:54:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:08,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:08,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:08,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438863195] [2021-03-10 21:54:08,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:08,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:08,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:08,481 INFO L87 Difference]: Start difference. First operand 326 states and 969 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:09,013 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 21:54:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:09,036 INFO L93 Difference]: Finished difference Result 394 states and 1163 transitions. [2021-03-10 21:54:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:09,036 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:09,037 INFO L225 Difference]: With dead ends: 394 [2021-03-10 21:54:09,037 INFO L226 Difference]: Without dead ends: 379 [2021-03-10 21:54:09,037 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 584.1ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:54:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-03-10 21:54:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 331. [2021-03-10 21:54:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.984848484848485) internal successors, (985), 330 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 985 transitions. [2021-03-10 21:54:09,044 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 985 transitions. Word has length 20 [2021-03-10 21:54:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:09,044 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 985 transitions. [2021-03-10 21:54:09,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 985 transitions. [2021-03-10 21:54:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:09,045 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:09,045 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:09,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1964,160 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:09,246 INFO L428 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1577635448, now seen corresponding path program 160 times [2021-03-10 21:54:09,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:09,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618586121] [2021-03-10 21:54:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:09,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618586121] [2021-03-10 21:54:09,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075646380] [2021-03-10 21:54:09,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:09,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:09,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:09,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:09,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:09,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:09,539 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:09,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:54:09,544 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:09,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:09,577 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:09,577 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2021-03-10 21:54:09,659 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:09,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:09,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:09,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:09,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:09,706 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:09,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:09,712 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:09,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:09,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:09,717 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:09,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:09,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:09,752 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:54:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:09,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:09,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:09,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097990390] [2021-03-10 21:54:09,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:09,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:09,873 INFO L87 Difference]: Start difference. First operand 331 states and 985 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:10,237 INFO L93 Difference]: Finished difference Result 400 states and 1176 transitions. [2021-03-10 21:54:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:54:10,238 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:10,238 INFO L225 Difference]: With dead ends: 400 [2021-03-10 21:54:10,239 INFO L226 Difference]: Without dead ends: 385 [2021-03-10 21:54:10,239 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 408.1ms TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:54:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-03-10 21:54:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 329. [2021-03-10 21:54:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.981707317073171) internal successors, (978), 328 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 978 transitions. [2021-03-10 21:54:10,242 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 978 transitions. Word has length 20 [2021-03-10 21:54:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:10,242 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 978 transitions. [2021-03-10 21:54:10,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 978 transitions. [2021-03-10 21:54:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:10,243 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:10,243 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:10,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1977 [2021-03-10 21:54:10,444 INFO L428 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:10,444 INFO L82 PathProgramCache]: Analyzing trace with hash 610547728, now seen corresponding path program 161 times [2021-03-10 21:54:10,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:10,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115255260] [2021-03-10 21:54:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:10,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115255260] [2021-03-10 21:54:10,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215125204] [2021-03-10 21:54:10,581 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:10,605 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:54:10,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:10,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:10,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:10,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:10,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:10,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:54:10,743 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:10,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:10,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:10,776 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2021-03-10 21:54:10,856 INFO L446 ElimStorePlain]: Different costs {1=[o_0], 3=[o_2]} [2021-03-10 21:54:10,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:10,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:10,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:10,872 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:10,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:10,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:10,917 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:10,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:10,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:10,921 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:10,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:10,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:10,956 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:54:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:11,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:11,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:11,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567732133] [2021-03-10 21:54:11,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:11,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:11,077 INFO L87 Difference]: Start difference. First operand 329 states and 978 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:11,440 INFO L93 Difference]: Finished difference Result 391 states and 1154 transitions. [2021-03-10 21:54:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:54:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:11,441 INFO L225 Difference]: With dead ends: 391 [2021-03-10 21:54:11,441 INFO L226 Difference]: Without dead ends: 376 [2021-03-10 21:54:11,441 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 388.5ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-03-10 21:54:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 327. [2021-03-10 21:54:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9846625766871164) internal successors, (973), 326 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 973 transitions. [2021-03-10 21:54:11,447 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 973 transitions. Word has length 20 [2021-03-10 21:54:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:11,447 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 973 transitions. [2021-03-10 21:54:11,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 973 transitions. [2021-03-10 21:54:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:11,448 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:11,448 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:11,669 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1989,162 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:11,669 INFO L428 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash 646055826, now seen corresponding path program 162 times [2021-03-10 21:54:11,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:11,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732474129] [2021-03-10 21:54:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:11,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732474129] [2021-03-10 21:54:11,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779738159] [2021-03-10 21:54:11,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:11,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:54:11,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:11,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:54:11,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:11,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:11,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:11,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:11,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:11,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:11,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:11,914 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:11,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:11,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:11,960 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:54:12,291 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:12,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:12,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:12,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:12,311 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:12,316 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:12,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:12,409 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:12,416 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:12,422 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:12,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:12,427 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:12,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:12,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:54:12,506 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:197, output treesize:73 [2021-03-10 21:54:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:12,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:12,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:12,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451289629] [2021-03-10 21:54:12,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:12,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:12,632 INFO L87 Difference]: Start difference. First operand 327 states and 973 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:13,111 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 21:54:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:13,129 INFO L93 Difference]: Finished difference Result 414 states and 1213 transitions. [2021-03-10 21:54:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:54:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:13,131 INFO L225 Difference]: With dead ends: 414 [2021-03-10 21:54:13,131 INFO L226 Difference]: Without dead ends: 399 [2021-03-10 21:54:13,131 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 652.1ms TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:54:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-03-10 21:54:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 333. [2021-03-10 21:54:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.0) internal successors, (996), 332 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 996 transitions. [2021-03-10 21:54:13,135 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 996 transitions. Word has length 20 [2021-03-10 21:54:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:13,135 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 996 transitions. [2021-03-10 21:54:13,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 996 transitions. [2021-03-10 21:54:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:13,136 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:13,136 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:13,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2000,163 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:13,336 INFO L428 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 144264490, now seen corresponding path program 163 times [2021-03-10 21:54:13,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:13,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563232845] [2021-03-10 21:54:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:13,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563232845] [2021-03-10 21:54:13,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174731994] [2021-03-10 21:54:13,514 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:13,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:13,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:13,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:13,618 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:13,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:13,623 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:13,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:13,668 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:13,668 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:54:13,865 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:13,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:13,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:13,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:13,877 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:13,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:13,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:13,918 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:13,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:13,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:13,923 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:13,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:13,958 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:13,958 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:54:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:14,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:14,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:14,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784028543] [2021-03-10 21:54:14,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:14,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:14,081 INFO L87 Difference]: Start difference. First operand 333 states and 996 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:14,797 INFO L93 Difference]: Finished difference Result 517 states and 1517 transitions. [2021-03-10 21:54:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:14,799 INFO L225 Difference]: With dead ends: 517 [2021-03-10 21:54:14,799 INFO L226 Difference]: Without dead ends: 502 [2021-03-10 21:54:14,799 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 678.3ms TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:54:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-03-10 21:54:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 331. [2021-03-10 21:54:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.996969696969697) internal successors, (989), 330 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 989 transitions. [2021-03-10 21:54:14,803 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 989 transitions. Word has length 20 [2021-03-10 21:54:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:14,803 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 989 transitions. [2021-03-10 21:54:14,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 989 transitions. [2021-03-10 21:54:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:14,804 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:14,804 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:15,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2025 [2021-03-10 21:54:15,005 INFO L428 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1387580654, now seen corresponding path program 164 times [2021-03-10 21:54:15,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:15,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47009815] [2021-03-10 21:54:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:15,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47009815] [2021-03-10 21:54:15,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4741234] [2021-03-10 21:54:15,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:15,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:15,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:15,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:15,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:15,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:15,265 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:15,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:15,272 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:15,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:15,325 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:15,325 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:54:15,541 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:15,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:15,550 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:15,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:15,557 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:15,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:15,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:15,609 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:15,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:15,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:15,614 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:15,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:15,655 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:15,655 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:35 [2021-03-10 21:54:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:15,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:15,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:15,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543421462] [2021-03-10 21:54:15,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:15,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:15,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:15,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:15,769 INFO L87 Difference]: Start difference. First operand 331 states and 989 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:16,135 INFO L93 Difference]: Finished difference Result 406 states and 1193 transitions. [2021-03-10 21:54:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:54:16,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:16,137 INFO L225 Difference]: With dead ends: 406 [2021-03-10 21:54:16,137 INFO L226 Difference]: Without dead ends: 391 [2021-03-10 21:54:16,137 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 434.5ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-03-10 21:54:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 328. [2021-03-10 21:54:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.9908256880733943) internal successors, (978), 327 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 978 transitions. [2021-03-10 21:54:16,141 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 978 transitions. Word has length 20 [2021-03-10 21:54:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:16,141 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 978 transitions. [2021-03-10 21:54:16,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 978 transitions. [2021-03-10 21:54:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:16,141 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:16,141 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:16,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2041,165 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:16,342 INFO L428 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 116721224, now seen corresponding path program 165 times [2021-03-10 21:54:16,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:16,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549587890] [2021-03-10 21:54:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:16,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549587890] [2021-03-10 21:54:16,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430836529] [2021-03-10 21:54:16,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:16,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:54:16,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:16,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:54:16,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:16,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:16,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:16,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:16,678 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:16,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:16,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:16,738 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:54:16,858 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:16,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:16,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:16,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:16,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:16,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:16,884 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:16,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:16,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:16,891 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:17,019 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-03-10 21:54:17,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:17,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:17,025 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:17,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:17,032 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:17,037 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:17,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:17,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:17,042 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:17,147 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 21:54:17,148 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:17,150 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:54:17,150 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:225, output treesize:101 [2021-03-10 21:54:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:17,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:17,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:17,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223366312] [2021-03-10 21:54:17,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:17,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:17,424 INFO L87 Difference]: Start difference. First operand 328 states and 978 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:18,096 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-03-10 21:54:18,341 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-03-10 21:54:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:18,360 INFO L93 Difference]: Finished difference Result 552 states and 1612 transitions. [2021-03-10 21:54:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 21:54:18,361 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:18,362 INFO L225 Difference]: With dead ends: 552 [2021-03-10 21:54:18,362 INFO L226 Difference]: Without dead ends: 522 [2021-03-10 21:54:18,362 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1053.2ms TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:54:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-03-10 21:54:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 327. [2021-03-10 21:54:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9846625766871164) internal successors, (973), 326 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 973 transitions. [2021-03-10 21:54:18,366 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 973 transitions. Word has length 20 [2021-03-10 21:54:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:18,366 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 973 transitions. [2021-03-10 21:54:18,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 973 transitions. [2021-03-10 21:54:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:18,367 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:18,367 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:18,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2060,166 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:18,568 INFO L428 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -243293518, now seen corresponding path program 166 times [2021-03-10 21:54:18,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:18,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325732231] [2021-03-10 21:54:18,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:18,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325732231] [2021-03-10 21:54:18,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714923953] [2021-03-10 21:54:18,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:18,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:18,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:18,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:18,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:18,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:18,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:18,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:18,849 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:18,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:18,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:18,854 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:18,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:18,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:18,899 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:54:19,095 INFO L446 ElimStorePlain]: Different costs {1=[o_0], 3=[o_2]} [2021-03-10 21:54:19,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:19,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:19,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:19,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:19,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:19,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:19,115 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:19,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:19,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:19,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:19,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:19,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:19,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:19,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:19,161 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:19,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:19,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:19,197 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:33 [2021-03-10 21:54:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:19,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:19,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:19,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550742859] [2021-03-10 21:54:19,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:19,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:19,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:19,324 INFO L87 Difference]: Start difference. First operand 327 states and 973 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:20,015 INFO L93 Difference]: Finished difference Result 486 states and 1430 transitions. [2021-03-10 21:54:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:54:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:20,017 INFO L225 Difference]: With dead ends: 486 [2021-03-10 21:54:20,017 INFO L226 Difference]: Without dead ends: 471 [2021-03-10 21:54:20,017 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 639.3ms TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-03-10 21:54:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 330. [2021-03-10 21:54:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9939209726443767) internal successors, (985), 329 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 985 transitions. [2021-03-10 21:54:20,021 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 985 transitions. Word has length 20 [2021-03-10 21:54:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:20,021 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 985 transitions. [2021-03-10 21:54:20,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 985 transitions. [2021-03-10 21:54:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:20,022 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:20,022 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:20,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2071 [2021-03-10 21:54:20,224 INFO L428 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1573221680, now seen corresponding path program 167 times [2021-03-10 21:54:20,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:20,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336908179] [2021-03-10 21:54:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:20,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336908179] [2021-03-10 21:54:20,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093823797] [2021-03-10 21:54:20,477 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:20,503 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:20,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:20,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:20,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:20,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:20,621 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:20,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:20,628 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:20,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:20,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:20,689 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 21:54:20,818 INFO L446 ElimStorePlain]: Different costs {1=[o_0], 3=[o_2]} [2021-03-10 21:54:20,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:20,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:20,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:20,833 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:20,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:20,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:20,905 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:20,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:20,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:20,912 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:20,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:20,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:20,972 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:41 [2021-03-10 21:54:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:21,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:21,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:21,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341439374] [2021-03-10 21:54:21,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:21,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:21,147 INFO L87 Difference]: Start difference. First operand 330 states and 985 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:21,737 INFO L93 Difference]: Finished difference Result 490 states and 1454 transitions. [2021-03-10 21:54:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:54:21,738 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:21,738 INFO L225 Difference]: With dead ends: 490 [2021-03-10 21:54:21,738 INFO L226 Difference]: Without dead ends: 475 [2021-03-10 21:54:21,739 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 705.5ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-03-10 21:54:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 326. [2021-03-10 21:54:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.9815384615384617) internal successors, (969), 325 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 969 transitions. [2021-03-10 21:54:21,743 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 969 transitions. Word has length 20 [2021-03-10 21:54:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 969 transitions. [2021-03-10 21:54:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 969 transitions. [2021-03-10 21:54:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:21,744 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:21,744 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:21,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2087,168 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:21,944 INFO L428 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1951666526, now seen corresponding path program 168 times [2021-03-10 21:54:21,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:21,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698695501] [2021-03-10 21:54:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:22,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698695501] [2021-03-10 21:54:22,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816590993] [2021-03-10 21:54:22,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:22,122 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:54:22,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:22,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:22,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:22,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:22,199 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:22,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:22,203 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:22,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:22,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:22,246 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:54:22,554 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:22,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:22,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:22,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-03-10 21:54:22,566 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:22,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:22,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:22,599 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:22,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:22,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:22,604 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:22,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:22,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:22,631 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:87, output treesize:27 [2021-03-10 21:54:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:22,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:22,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:22,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688282566] [2021-03-10 21:54:22,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:22,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:22,705 INFO L87 Difference]: Start difference. First operand 326 states and 969 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:23,149 INFO L93 Difference]: Finished difference Result 395 states and 1166 transitions. [2021-03-10 21:54:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:54:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:23,151 INFO L225 Difference]: With dead ends: 395 [2021-03-10 21:54:23,151 INFO L226 Difference]: Without dead ends: 380 [2021-03-10 21:54:23,151 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 485.9ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-03-10 21:54:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 336. [2021-03-10 21:54:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.997014925373134) internal successors, (1004), 335 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1004 transitions. [2021-03-10 21:54:23,155 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1004 transitions. Word has length 20 [2021-03-10 21:54:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:23,155 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 1004 transitions. [2021-03-10 21:54:23,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1004 transitions. [2021-03-10 21:54:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:23,156 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:23,156 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:23,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2094 [2021-03-10 21:54:23,356 INFO L428 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1841509434, now seen corresponding path program 169 times [2021-03-10 21:54:23,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:23,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890677243] [2021-03-10 21:54:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:23,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890677243] [2021-03-10 21:54:23,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057447691] [2021-03-10 21:54:23,527 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:23,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:23,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:23,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:23,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:23,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:23,615 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:23,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:23,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:23,620 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:23,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:23,655 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:23,655 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-03-10 21:54:23,769 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[o_4]} [2021-03-10 21:54:23,773 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:23,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:23,777 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:23,778 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:23,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:23,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:23,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:23,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:23,812 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:23,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:23,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:23,816 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:23,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:23,844 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:23,844 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:33 [2021-03-10 21:54:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:23,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:23,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:23,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962727083] [2021-03-10 21:54:23,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:23,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:23,970 INFO L87 Difference]: Start difference. First operand 336 states and 1004 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:24,485 INFO L93 Difference]: Finished difference Result 462 states and 1364 transitions. [2021-03-10 21:54:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:54:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:24,486 INFO L225 Difference]: With dead ends: 462 [2021-03-10 21:54:24,486 INFO L226 Difference]: Without dead ends: 447 [2021-03-10 21:54:24,487 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 534.5ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-03-10 21:54:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 334. [2021-03-10 21:54:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.993993993993994) internal successors, (997), 333 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 997 transitions. [2021-03-10 21:54:24,491 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 997 transitions. Word has length 20 [2021-03-10 21:54:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:24,491 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 997 transitions. [2021-03-10 21:54:24,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 997 transitions. [2021-03-10 21:54:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:24,492 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:24,492 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:24,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 170 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2115 [2021-03-10 21:54:24,692 INFO L428 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 309664290, now seen corresponding path program 170 times [2021-03-10 21:54:24,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:24,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872155149] [2021-03-10 21:54:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:24,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872155149] [2021-03-10 21:54:24,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120651746] [2021-03-10 21:54:24,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:24,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:24,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:24,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:54:24,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:24,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:24,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:24,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:24,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:24,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:24,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:24,947 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:24,988 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:24,990 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:24,990 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:54:25,179 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:25,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:25,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:25,192 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:25,198 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:25,203 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:25,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:25,304 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:25,309 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:25,315 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:25,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:25,320 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:25,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:25,407 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:54:25,407 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:201, output treesize:89 [2021-03-10 21:54:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:25,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:25,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:25,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027226118] [2021-03-10 21:54:25,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:25,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:25,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:25,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:25,611 INFO L87 Difference]: Start difference. First operand 334 states and 997 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:25,937 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 21:54:26,145 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-03-10 21:54:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:26,160 INFO L93 Difference]: Finished difference Result 426 states and 1232 transitions. [2021-03-10 21:54:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:54:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:26,162 INFO L225 Difference]: With dead ends: 426 [2021-03-10 21:54:26,162 INFO L226 Difference]: Without dead ends: 396 [2021-03-10 21:54:26,162 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 710.5ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:54:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-03-10 21:54:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 331. [2021-03-10 21:54:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.987878787878788) internal successors, (986), 330 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 986 transitions. [2021-03-10 21:54:26,166 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 986 transitions. Word has length 20 [2021-03-10 21:54:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:26,166 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 986 transitions. [2021-03-10 21:54:26,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 986 transitions. [2021-03-10 21:54:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:26,167 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:26,167 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:26,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2127 [2021-03-10 21:54:26,380 INFO L428 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:26,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1813966168, now seen corresponding path program 171 times [2021-03-10 21:54:26,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:26,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820710416] [2021-03-10 21:54:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:26,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820710416] [2021-03-10 21:54:26,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859579109] [2021-03-10 21:54:26,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:26,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:54:26,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:26,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2021-03-10 21:54:26,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:26,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:26,693 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:26,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:26,739 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:26,739 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:73 [2021-03-10 21:54:26,827 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_2]} [2021-03-10 21:54:26,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:26,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:26,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:26,846 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:26,852 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,958 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:54:26,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:26,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:26,965 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:26,971 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:26,977 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:26,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:26,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:26,982 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:27,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:27,082 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:54:27,082 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:221, output treesize:101 [2021-03-10 21:54:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:27,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:27,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:27,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560044275] [2021-03-10 21:54:27,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:27,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:27,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:27,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:27,366 INFO L87 Difference]: Start difference. First operand 331 states and 986 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:27,962 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 21:54:28,240 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2021-03-10 21:54:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:28,263 INFO L93 Difference]: Finished difference Result 512 states and 1494 transitions. [2021-03-10 21:54:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:28,264 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:28,265 INFO L225 Difference]: With dead ends: 512 [2021-03-10 21:54:28,265 INFO L226 Difference]: Without dead ends: 482 [2021-03-10 21:54:28,265 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 914.1ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-03-10 21:54:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 330. [2021-03-10 21:54:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.9817629179331306) internal successors, (981), 329 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 981 transitions. [2021-03-10 21:54:28,269 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 981 transitions. Word has length 20 [2021-03-10 21:54:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:28,269 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 981 transitions. [2021-03-10 21:54:28,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 981 transitions. [2021-03-10 21:54:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:28,270 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:28,270 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:28,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2140,172 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:28,470 INFO L428 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 927926458, now seen corresponding path program 172 times [2021-03-10 21:54:28,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:28,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428703986] [2021-03-10 21:54:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:28,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428703986] [2021-03-10 21:54:28,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756763742] [2021-03-10 21:54:28,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:28,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:28,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:28,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:28,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:28,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:28,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:28,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:28,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:54:28,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2021-03-10 21:54:28,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:28,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:28,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:54:28,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:28,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:28,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:54:28,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:28,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:28,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:28,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:28,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:28,842 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:28,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:28,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:28,847 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:28,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:28,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:28,889 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:35 [2021-03-10 21:54:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:29,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:29,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:29,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409412635] [2021-03-10 21:54:29,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:29,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:29,008 INFO L87 Difference]: Start difference. First operand 330 states and 981 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:29,336 INFO L93 Difference]: Finished difference Result 396 states and 1168 transitions. [2021-03-10 21:54:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:54:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:29,337 INFO L225 Difference]: With dead ends: 396 [2021-03-10 21:54:29,338 INFO L226 Difference]: Without dead ends: 381 [2021-03-10 21:54:29,338 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 370.8ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-03-10 21:54:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 327. [2021-03-10 21:54:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9846625766871164) internal successors, (973), 326 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 973 transitions. [2021-03-10 21:54:29,342 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 973 transitions. Word has length 20 [2021-03-10 21:54:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:29,342 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 973 transitions. [2021-03-10 21:54:29,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 973 transitions. [2021-03-10 21:54:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:29,342 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:29,342 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:29,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2152,173 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:29,543 INFO L428 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash -791058224, now seen corresponding path program 173 times [2021-03-10 21:54:29,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:29,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333369111] [2021-03-10 21:54:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:29,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333369111] [2021-03-10 21:54:29,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63391146] [2021-03-10 21:54:29,713 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:29,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:54:29,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:29,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:29,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:29,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:29,805 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:29,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:29,817 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:54:29,818 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-03-10 21:54:29,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:29,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:29,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:54:29,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:29,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:29,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:54:29,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:29,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:29,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:29,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:29,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:29,908 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:29,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:29,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:29,912 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:29,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:29,952 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:29,952 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:41 [2021-03-10 21:54:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:30,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:30,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:30,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573392927] [2021-03-10 21:54:30,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:30,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:30,119 INFO L87 Difference]: Start difference. First operand 327 states and 973 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:30,601 INFO L93 Difference]: Finished difference Result 489 states and 1447 transitions. [2021-03-10 21:54:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:30,601 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:30,602 INFO L225 Difference]: With dead ends: 489 [2021-03-10 21:54:30,602 INFO L226 Difference]: Without dead ends: 474 [2021-03-10 21:54:30,603 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 472.1ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:54:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-03-10 21:54:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 326. [2021-03-10 21:54:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.9815384615384617) internal successors, (969), 325 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 969 transitions. [2021-03-10 21:54:30,607 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 969 transitions. Word has length 20 [2021-03-10 21:54:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:30,607 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 969 transitions. [2021-03-10 21:54:30,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 969 transitions. [2021-03-10 21:54:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:30,608 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:30,608 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:30,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2159,174 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:30,808 INFO L428 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash 605328954, now seen corresponding path program 174 times [2021-03-10 21:54:30,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:30,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587440533] [2021-03-10 21:54:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:30,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587440533] [2021-03-10 21:54:30,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389202849] [2021-03-10 21:54:30,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:31,003 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:54:31,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:31,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:31,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:31,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:31,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:31,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:31,076 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:31,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:31,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:31,082 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:31,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:31,121 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:31,121 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-03-10 21:54:31,242 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[o_0]} [2021-03-10 21:54:31,246 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:31,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:31,251 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:31,253 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:31,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:31,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:31,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:31,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:31,290 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:31,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:31,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-03-10 21:54:31,294 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:31,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:31,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:31,323 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:33 [2021-03-10 21:54:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:31,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:31,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:31,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142245243] [2021-03-10 21:54:31,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:31,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:31,462 INFO L87 Difference]: Start difference. First operand 326 states and 969 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:32,018 INFO L93 Difference]: Finished difference Result 452 states and 1338 transitions. [2021-03-10 21:54:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:32,019 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:32,020 INFO L225 Difference]: With dead ends: 452 [2021-03-10 21:54:32,020 INFO L226 Difference]: Without dead ends: 437 [2021-03-10 21:54:32,020 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 559.5ms TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-03-10 21:54:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 332. [2021-03-10 21:54:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.990936555891239) internal successors, (990), 331 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 990 transitions. [2021-03-10 21:54:32,024 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 990 transitions. Word has length 20 [2021-03-10 21:54:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:32,025 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 990 transitions. [2021-03-10 21:54:32,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 990 transitions. [2021-03-10 21:54:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:32,025 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:32,025 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:32,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2164,175 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:32,226 INFO L428 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:32,226 INFO L82 PathProgramCache]: Analyzing trace with hash -724599208, now seen corresponding path program 175 times [2021-03-10 21:54:32,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:32,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348391671] [2021-03-10 21:54:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:32,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348391671] [2021-03-10 21:54:32,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634785666] [2021-03-10 21:54:32,406 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:32,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:32,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:32,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:32,513 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:32,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:32,518 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:32,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:32,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:54:32,568 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:79 [2021-03-10 21:54:32,660 INFO L446 ElimStorePlain]: Different costs {1=[o_0], 3=[o_2]} [2021-03-10 21:54:32,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:32,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:32,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-03-10 21:54:32,673 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:32,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:32,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:32,726 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:32,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:32,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:32,731 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:32,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:32,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:32,776 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:47 [2021-03-10 21:54:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:32,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:32,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:32,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256484954] [2021-03-10 21:54:32,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:32,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:32,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:32,945 INFO L87 Difference]: Start difference. First operand 332 states and 990 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:33,623 INFO L93 Difference]: Finished difference Result 474 states and 1407 transitions. [2021-03-10 21:54:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:54:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:33,625 INFO L225 Difference]: With dead ends: 474 [2021-03-10 21:54:33,625 INFO L226 Difference]: Without dead ends: 459 [2021-03-10 21:54:33,625 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 563.7ms TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-03-10 21:54:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 329. [2021-03-10 21:54:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.981707317073171) internal successors, (978), 328 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 978 transitions. [2021-03-10 21:54:33,629 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 978 transitions. Word has length 20 [2021-03-10 21:54:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:33,630 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 978 transitions. [2021-03-10 21:54:33,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 978 transitions. [2021-03-10 21:54:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:33,630 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:33,630 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:33,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2175,176 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:33,853 INFO L428 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:33,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1639680696, now seen corresponding path program 176 times [2021-03-10 21:54:33,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:33,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964453657] [2021-03-10 21:54:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:34,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964453657] [2021-03-10 21:54:34,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625068825] [2021-03-10 21:54:34,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:34,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:34,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:34,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:54:34,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:34,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:34,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:34,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:34,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:54:34,132 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-03-10 21:54:34,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:34,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-03-10 21:54:34,168 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:34,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:34,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:54:34,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2021-03-10 21:54:34,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:34,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:34,194 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:34,194 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2021-03-10 21:54:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:34,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:34,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:54:34,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623913585] [2021-03-10 21:54:34,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:54:34,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:54:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:34,288 INFO L87 Difference]: Start difference. First operand 329 states and 978 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:34,770 INFO L93 Difference]: Finished difference Result 449 states and 1325 transitions. [2021-03-10 21:54:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:54:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 20 [2021-03-10 21:54:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:34,771 INFO L225 Difference]: With dead ends: 449 [2021-03-10 21:54:34,771 INFO L226 Difference]: Without dead ends: 434 [2021-03-10 21:54:34,771 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 337.5ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:54:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-03-10 21:54:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 325. [2021-03-10 21:54:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.9814814814814814) internal successors, (966), 324 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 966 transitions. [2021-03-10 21:54:34,778 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 966 transitions. Word has length 20 [2021-03-10 21:54:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:34,778 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 966 transitions. [2021-03-10 21:54:34,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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) [2021-03-10 21:54:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 966 transitions. [2021-03-10 21:54:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:34,778 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:34,779 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:35,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2182,177 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:35,001 INFO L428 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:35,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1136429620, now seen corresponding path program 177 times [2021-03-10 21:54:35,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:35,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865421123] [2021-03-10 21:54:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:35,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865421123] [2021-03-10 21:54:35,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535882645] [2021-03-10 21:54:35,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:35,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:54:35,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:35,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:54:35,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:35,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:35,232 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:35,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:35,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:35,240 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2021-03-10 21:54:35,314 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:35,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:35,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:35,320 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:35,320 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:35,321 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2021-03-10 21:54:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:35,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:35,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:35,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922977760] [2021-03-10 21:54:35,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:35,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:35,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:35,362 INFO L87 Difference]: Start difference. First operand 325 states and 966 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:35,849 INFO L93 Difference]: Finished difference Result 516 states and 1525 transitions. [2021-03-10 21:54:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:35,851 INFO L225 Difference]: With dead ends: 516 [2021-03-10 21:54:35,851 INFO L226 Difference]: Without dead ends: 501 [2021-03-10 21:54:35,851 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 382.6ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:54:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-03-10 21:54:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 342. [2021-03-10 21:54:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.997067448680352) internal successors, (1022), 341 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1022 transitions. [2021-03-10 21:54:35,856 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1022 transitions. Word has length 20 [2021-03-10 21:54:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:35,856 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1022 transitions. [2021-03-10 21:54:35,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1022 transitions. [2021-03-10 21:54:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:35,857 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:35,857 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:36,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 178 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2183 [2021-03-10 21:54:36,057 INFO L428 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 634638284, now seen corresponding path program 178 times [2021-03-10 21:54:36,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:36,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135900278] [2021-03-10 21:54:36,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:36,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135900278] [2021-03-10 21:54:36,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957139232] [2021-03-10 21:54:36,222 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:36,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:36,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:36,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:36,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:36,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:36,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:36,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:36,332 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:36,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:36,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:36,370 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:36,496 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:36,498 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:36,501 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:36,503 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:36,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:36,526 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:36,528 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:36,528 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:36,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:36,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:36,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203859905] [2021-03-10 21:54:36,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:36,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:36,679 INFO L87 Difference]: Start difference. First operand 342 states and 1022 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:37,225 INFO L93 Difference]: Finished difference Result 435 states and 1281 transitions. [2021-03-10 21:54:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:54:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:37,227 INFO L225 Difference]: With dead ends: 435 [2021-03-10 21:54:37,227 INFO L226 Difference]: Without dead ends: 420 [2021-03-10 21:54:37,227 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 534.3ms TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:54:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-03-10 21:54:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 340. [2021-03-10 21:54:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.994100294985251) internal successors, (1015), 339 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1015 transitions. [2021-03-10 21:54:37,231 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1015 transitions. Word has length 20 [2021-03-10 21:54:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:37,231 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 1015 transitions. [2021-03-10 21:54:37,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1015 transitions. [2021-03-10 21:54:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:37,232 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:37,232 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:37,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2184,179 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:37,455 INFO L428 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash -897206860, now seen corresponding path program 179 times [2021-03-10 21:54:37,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:37,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415133968] [2021-03-10 21:54:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:37,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415133968] [2021-03-10 21:54:37,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105359672] [2021-03-10 21:54:37,605 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:37,627 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:37,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:37,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:37,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:37,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:37,686 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:37,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:37,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:37,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:37,720 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:37,720 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:37,830 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:37,832 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:37,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:37,857 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:37,860 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:37,861 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:37,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:37,885 INFO L518 ElimStorePlain]: Eliminatee v_prenex_333 vanished before elimination [2021-03-10 21:54:37,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:37,886 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2021-03-10 21:54:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:37,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:37,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:37,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235179252] [2021-03-10 21:54:37,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:37,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:37,999 INFO L87 Difference]: Start difference. First operand 340 states and 1015 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:38,677 INFO L93 Difference]: Finished difference Result 541 states and 1606 transitions. [2021-03-10 21:54:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:38,678 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:38,679 INFO L225 Difference]: With dead ends: 541 [2021-03-10 21:54:38,679 INFO L226 Difference]: Without dead ends: 526 [2021-03-10 21:54:38,680 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 600.8ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-03-10 21:54:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 337. [2021-03-10 21:54:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.988095238095238) internal successors, (1004), 336 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1004 transitions. [2021-03-10 21:54:38,684 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1004 transitions. Word has length 20 [2021-03-10 21:54:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:38,684 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 1004 transitions. [2021-03-10 21:54:38,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1004 transitions. [2021-03-10 21:54:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:38,685 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:38,685 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:38,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2195,180 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:38,886 INFO L428 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash 607095018, now seen corresponding path program 180 times [2021-03-10 21:54:38,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:38,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633812529] [2021-03-10 21:54:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:39,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633812529] [2021-03-10 21:54:39,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184383618] [2021-03-10 21:54:39,041 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:39,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:54:39,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:39,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:39,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:39,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:39,127 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:39,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:39,131 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:39,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:39,163 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:39,163 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:39,223 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:39,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:39,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:39,257 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:39,259 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:39,261 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:39,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:39,290 INFO L518 ElimStorePlain]: Eliminatee v_prenex_335 vanished before elimination [2021-03-10 21:54:39,291 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:39,291 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:54:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:39,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:39,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:39,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668595048] [2021-03-10 21:54:39,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:39,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:39,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:39,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:39,464 INFO L87 Difference]: Start difference. First operand 337 states and 1004 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:40,205 INFO L93 Difference]: Finished difference Result 541 states and 1601 transitions. [2021-03-10 21:54:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:40,206 INFO L225 Difference]: With dead ends: 541 [2021-03-10 21:54:40,207 INFO L226 Difference]: Without dead ends: 526 [2021-03-10 21:54:40,207 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 602.4ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:54:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-03-10 21:54:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 336. [2021-03-10 21:54:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.982089552238806) internal successors, (999), 335 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 999 transitions. [2021-03-10 21:54:40,212 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 999 transitions. Word has length 20 [2021-03-10 21:54:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:40,213 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 999 transitions. [2021-03-10 21:54:40,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 999 transitions. [2021-03-10 21:54:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:40,213 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:40,213 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:40,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 181 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2204 [2021-03-10 21:54:40,414 INFO L428 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:40,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash -278944692, now seen corresponding path program 181 times [2021-03-10 21:54:40,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:40,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920374407] [2021-03-10 21:54:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:40,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920374407] [2021-03-10 21:54:40,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106661901] [2021-03-10 21:54:40,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:40,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:40,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:40,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:40,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:40,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:40,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:40,655 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:54:40,680 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:40,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:40,684 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:40,685 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:40,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:40,710 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:40,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:40,711 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:35 [2021-03-10 21:54:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:40,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:40,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:40,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902836935] [2021-03-10 21:54:40,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:40,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:40,830 INFO L87 Difference]: Start difference. First operand 336 states and 999 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:41,133 INFO L93 Difference]: Finished difference Result 430 states and 1270 transitions. [2021-03-10 21:54:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:54:41,134 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:41,135 INFO L225 Difference]: With dead ends: 430 [2021-03-10 21:54:41,135 INFO L226 Difference]: Without dead ends: 415 [2021-03-10 21:54:41,135 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 329.4ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:54:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-03-10 21:54:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 333. [2021-03-10 21:54:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9849397590361444) internal successors, (991), 332 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 991 transitions. [2021-03-10 21:54:41,139 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 991 transitions. Word has length 20 [2021-03-10 21:54:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:41,139 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 991 transitions. [2021-03-10 21:54:41,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 991 transitions. [2021-03-10 21:54:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:41,140 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:41,140 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:41,340 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2211,182 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:41,340 INFO L428 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1997929374, now seen corresponding path program 182 times [2021-03-10 21:54:41,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:41,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101964471] [2021-03-10 21:54:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:41,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101964471] [2021-03-10 21:54:41,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518884644] [2021-03-10 21:54:41,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:41,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:41,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:41,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:54:41,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:41,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:41,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:41,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:41,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:41,555 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:54:41,580 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:41,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:41,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:41,589 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:41,590 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:41,590 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:15 [2021-03-10 21:54:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:41,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:41,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 21:54:41,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424344668] [2021-03-10 21:54:41,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 21:54:41,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 21:54:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:54:41,623 INFO L87 Difference]: Start difference. First operand 333 states and 991 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:41,856 INFO L93 Difference]: Finished difference Result 456 states and 1338 transitions. [2021-03-10 21:54:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-10 21:54:41,856 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 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 20 [2021-03-10 21:54:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:41,857 INFO L225 Difference]: With dead ends: 456 [2021-03-10 21:54:41,857 INFO L226 Difference]: Without dead ends: 441 [2021-03-10 21:54:41,858 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 160.8ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:54:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-03-10 21:54:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 332. [2021-03-10 21:54:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.9818731117824773) internal successors, (987), 331 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 987 transitions. [2021-03-10 21:54:41,862 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 987 transitions. Word has length 20 [2021-03-10 21:54:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:41,862 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 987 transitions. [2021-03-10 21:54:41,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 987 transitions. [2021-03-10 21:54:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:41,863 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:41,863 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:42,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 183 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2215 [2021-03-10 21:54:42,063 INFO L428 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1398268212, now seen corresponding path program 183 times [2021-03-10 21:54:42,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:42,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065484722] [2021-03-10 21:54:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:42,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065484722] [2021-03-10 21:54:42,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095830000] [2021-03-10 21:54:42,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:42,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:54:42,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:42,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:42,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:42,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:42,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:42,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:42,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:42,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2021-03-10 21:54:42,256 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:42,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:42,260 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:42,261 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:42,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:42,287 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:42,288 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:42,288 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:35 [2021-03-10 21:54:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:42,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:42,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:54:42,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494090274] [2021-03-10 21:54:42,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:54:42,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:42,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:54:42,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:54:42,400 INFO L87 Difference]: Start difference. First operand 332 states and 987 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:42,774 INFO L93 Difference]: Finished difference Result 528 states and 1552 transitions. [2021-03-10 21:54:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:54:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 20 [2021-03-10 21:54:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:42,776 INFO L225 Difference]: With dead ends: 528 [2021-03-10 21:54:42,776 INFO L226 Difference]: Without dead ends: 513 [2021-03-10 21:54:42,776 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 310.3ms TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:54:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-03-10 21:54:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 327. [2021-03-10 21:54:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.9877300613496933) internal successors, (974), 326 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 974 transitions. [2021-03-10 21:54:42,781 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 974 transitions. Word has length 20 [2021-03-10 21:54:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 974 transitions. [2021-03-10 21:54:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 974 transitions. [2021-03-10 21:54:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:42,781 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:42,781 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:42,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 184 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2216 [2021-03-10 21:54:42,982 INFO L428 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1361462520, now seen corresponding path program 184 times [2021-03-10 21:54:42,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:42,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061235055] [2021-03-10 21:54:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:43,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061235055] [2021-03-10 21:54:43,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773909399] [2021-03-10 21:54:43,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:43,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:43,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:43,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:43,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:43,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:43,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:43,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:43,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:43,192 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:54:43,219 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:43,220 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:43,223 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:43,224 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:43,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:43,253 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:43,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:43,254 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:54:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:43,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:43,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:54:43,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454098540] [2021-03-10 21:54:43,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:54:43,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:43,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:54:43,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:54:43,418 INFO L87 Difference]: Start difference. First operand 327 states and 974 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:54:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:44,105 INFO L93 Difference]: Finished difference Result 642 states and 1887 transitions. [2021-03-10 21:54:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 20 [2021-03-10 21:54:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:44,106 INFO L225 Difference]: With dead ends: 642 [2021-03-10 21:54:44,107 INFO L226 Difference]: Without dead ends: 627 [2021-03-10 21:54:44,107 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 569.6ms TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:54:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-03-10 21:54:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 325. [2021-03-10 21:54:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.9814814814814814) internal successors, (966), 324 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 966 transitions. [2021-03-10 21:54:44,111 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 966 transitions. Word has length 20 [2021-03-10 21:54:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:44,111 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 966 transitions. [2021-03-10 21:54:44,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:54:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 966 transitions. [2021-03-10 21:54:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:44,112 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:44,112 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:44,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2220,185 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:44,312 INFO L428 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:44,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1139035052, now seen corresponding path program 185 times [2021-03-10 21:54:44,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:44,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955800650] [2021-03-10 21:54:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:44,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955800650] [2021-03-10 21:54:44,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398889924] [2021-03-10 21:54:44,478 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:44,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:54:44,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:44,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:44,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:44,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:44,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:44,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:44,559 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:44,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:44,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:44,591 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:44,692 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:44,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:44,697 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:44,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:44,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:44,717 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:44,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:44,718 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:44,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:44,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:44,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132805009] [2021-03-10 21:54:44,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:44,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:44,849 INFO L87 Difference]: Start difference. First operand 325 states and 966 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:45,628 INFO L93 Difference]: Finished difference Result 492 states and 1457 transitions. [2021-03-10 21:54:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:54:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:45,630 INFO L225 Difference]: With dead ends: 492 [2021-03-10 21:54:45,630 INFO L226 Difference]: Without dead ends: 477 [2021-03-10 21:54:45,630 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 694.5ms TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:54:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-03-10 21:54:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 337. [2021-03-10 21:54:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.9910714285714284) internal successors, (1005), 336 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1005 transitions. [2021-03-10 21:54:45,634 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1005 transitions. Word has length 20 [2021-03-10 21:54:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:45,634 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 1005 transitions. [2021-03-10 21:54:45,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1005 transitions. [2021-03-10 21:54:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:45,635 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:45,635 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:45,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2225,186 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:45,836 INFO L428 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1826004082, now seen corresponding path program 186 times [2021-03-10 21:54:45,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:45,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224685635] [2021-03-10 21:54:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:46,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224685635] [2021-03-10 21:54:46,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449923525] [2021-03-10 21:54:46,016 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:46,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:54:46,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:46,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:46,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:46,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:46,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:46,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:46,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:46,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:46,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:46,147 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:46,210 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:46,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:46,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:46,244 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:46,247 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:46,248 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:46,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:46,280 INFO L518 ElimStorePlain]: Eliminatee v_prenex_337 vanished before elimination [2021-03-10 21:54:46,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:46,281 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:54:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:46,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:46,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:46,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097135601] [2021-03-10 21:54:46,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:46,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:46,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:46,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:46,457 INFO L87 Difference]: Start difference. First operand 337 states and 1005 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:47,269 INFO L93 Difference]: Finished difference Result 514 states and 1526 transitions. [2021-03-10 21:54:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:54:47,270 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:47,271 INFO L225 Difference]: With dead ends: 514 [2021-03-10 21:54:47,271 INFO L226 Difference]: Without dead ends: 499 [2021-03-10 21:54:47,271 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 689.4ms TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:54:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-03-10 21:54:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 334. [2021-03-10 21:54:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.981981981981982) internal successors, (993), 333 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 993 transitions. [2021-03-10 21:54:47,275 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 993 transitions. Word has length 20 [2021-03-10 21:54:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:47,275 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 993 transitions. [2021-03-10 21:54:47,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 993 transitions. [2021-03-10 21:54:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:47,275 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:47,275 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:47,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2235,187 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:47,476 INFO L428 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 910922594, now seen corresponding path program 187 times [2021-03-10 21:54:47,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:47,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907979580] [2021-03-10 21:54:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:47,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907979580] [2021-03-10 21:54:47,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949132998] [2021-03-10 21:54:47,635 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:47,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:47,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:47,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:47,709 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:47,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:47,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:47,718 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:54:47,746 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:47,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:47,750 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:47,751 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:47,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:47,781 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:47,782 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:47,783 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:54:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:47,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:47,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:47,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34689558] [2021-03-10 21:54:47,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:47,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:47,956 INFO L87 Difference]: Start difference. First operand 334 states and 993 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:48,483 INFO L93 Difference]: Finished difference Result 489 states and 1457 transitions. [2021-03-10 21:54:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:54:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:48,485 INFO L225 Difference]: With dead ends: 489 [2021-03-10 21:54:48,485 INFO L226 Difference]: Without dead ends: 474 [2021-03-10 21:54:48,485 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 494.5ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:54:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-03-10 21:54:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 331. [2021-03-10 21:54:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 2.981818181818182) internal successors, (984), 330 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 984 transitions. [2021-03-10 21:54:48,490 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 984 transitions. Word has length 20 [2021-03-10 21:54:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:48,490 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 984 transitions. [2021-03-10 21:54:48,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 984 transitions. [2021-03-10 21:54:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:48,490 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:48,490 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:48,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2242,188 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:48,691 INFO L428 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1898955376, now seen corresponding path program 188 times [2021-03-10 21:54:48,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:48,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868933383] [2021-03-10 21:54:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:48,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868933383] [2021-03-10 21:54:48,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457845344] [2021-03-10 21:54:48,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:48,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:48,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:48,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:54:48,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:48,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:48,892 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:48,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:48,899 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:48,899 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:54:48,928 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:48,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:48,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:48,937 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:48,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:48,938 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:15 [2021-03-10 21:54:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:49,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:49,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:54:49,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352898349] [2021-03-10 21:54:49,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:54:49,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:54:49,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:54:49,034 INFO L87 Difference]: Start difference. First operand 331 states and 984 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:54:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:49,578 INFO L93 Difference]: Finished difference Result 578 states and 1700 transitions. [2021-03-10 21:54:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:49,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 20 [2021-03-10 21:54:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:49,580 INFO L225 Difference]: With dead ends: 578 [2021-03-10 21:54:49,580 INFO L226 Difference]: Without dead ends: 563 [2021-03-10 21:54:49,580 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 365.6ms TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:54:49,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-03-10 21:54:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 323. [2021-03-10 21:54:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 2.981366459627329) internal successors, (960), 322 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 960 transitions. [2021-03-10 21:54:49,585 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 960 transitions. Word has length 20 [2021-03-10 21:54:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:49,585 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 960 transitions. [2021-03-10 21:54:49,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:54:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 960 transitions. [2021-03-10 21:54:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:49,585 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:49,585 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:49,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2247,189 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:49,786 INFO L428 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:49,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1547300954, now seen corresponding path program 189 times [2021-03-10 21:54:49,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:49,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993371881] [2021-03-10 21:54:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:49,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993371881] [2021-03-10 21:54:49,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071636606] [2021-03-10 21:54:49,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:54:50,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:54:50,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:50,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:50,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:50,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:50,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:50,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:50,050 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:50,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:50,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:50,085 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:54:50,234 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:50,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:50,239 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:50,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:50,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:50,260 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:50,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:50,261 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:50,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:50,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:50,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502407209] [2021-03-10 21:54:50,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:50,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:50,394 INFO L87 Difference]: Start difference. First operand 323 states and 960 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:51,899 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-03-10 21:54:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:52,112 INFO L93 Difference]: Finished difference Result 771 states and 2284 transitions. [2021-03-10 21:54:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-03-10 21:54:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:52,115 INFO L225 Difference]: With dead ends: 771 [2021-03-10 21:54:52,115 INFO L226 Difference]: Without dead ends: 741 [2021-03-10 21:54:52,115 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1538.5ms TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2021-03-10 21:54:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-03-10 21:54:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 332. [2021-03-10 21:54:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.9818731117824773) internal successors, (987), 331 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 987 transitions. [2021-03-10 21:54:52,120 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 987 transitions. Word has length 20 [2021-03-10 21:54:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:52,121 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 987 transitions. [2021-03-10 21:54:52,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 987 transitions. [2021-03-10 21:54:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:52,121 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:52,121 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:52,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 190 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2248 [2021-03-10 21:54:52,322 INFO L428 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash 580451194, now seen corresponding path program 190 times [2021-03-10 21:54:52,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:52,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454825658] [2021-03-10 21:54:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:52,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454825658] [2021-03-10 21:54:52,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578983637] [2021-03-10 21:54:52,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:52,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:54:52,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:52,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:52,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:52,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:52,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:52,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:52,622 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:52,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:52,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:52,663 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:52,800 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:52,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:52,807 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:52,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:52,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:52,836 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:52,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:52,837 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:52,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:52,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:52,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681761198] [2021-03-10 21:54:52,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:52,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:52,991 INFO L87 Difference]: Start difference. First operand 332 states and 987 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:53,907 INFO L93 Difference]: Finished difference Result 590 states and 1738 transitions. [2021-03-10 21:54:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:53,908 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:53,909 INFO L225 Difference]: With dead ends: 590 [2021-03-10 21:54:53,909 INFO L226 Difference]: Without dead ends: 575 [2021-03-10 21:54:53,910 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 711.7ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:54:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-03-10 21:54:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 338. [2021-03-10 21:54:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9910979228486645) internal successors, (1008), 337 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1008 transitions. [2021-03-10 21:54:53,921 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1008 transitions. Word has length 20 [2021-03-10 21:54:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:53,921 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1008 transitions. [2021-03-10 21:54:53,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1008 transitions. [2021-03-10 21:54:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:53,922 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:53,922 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:54,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2260,191 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:54,122 INFO L428 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:54,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash -749476968, now seen corresponding path program 191 times [2021-03-10 21:54:54,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:54,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110630459] [2021-03-10 21:54:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:54,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110630459] [2021-03-10 21:54:54,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574466392] [2021-03-10 21:54:54,331 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:54:54,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:54:54,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:54,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:54,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:54,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:54,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:54,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:54,443 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:54,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:54,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:54,478 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:54,542 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:54,544 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:54,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:54,577 INFO L518 ElimStorePlain]: Eliminatee v_prenex_339 vanished before elimination [2021-03-10 21:54:54,580 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:54,581 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:54,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:54,612 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:54,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:54,614 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:41 [2021-03-10 21:54:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:54,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:54,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:54,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278351549] [2021-03-10 21:54:54,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:54,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:54,793 INFO L87 Difference]: Start difference. First operand 338 states and 1008 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:55,446 INFO L93 Difference]: Finished difference Result 612 states and 1807 transitions. [2021-03-10 21:54:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:54:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:55,448 INFO L225 Difference]: With dead ends: 612 [2021-03-10 21:54:55,448 INFO L226 Difference]: Without dead ends: 597 [2021-03-10 21:54:55,448 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 700.5ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:54:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-03-10 21:54:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 335. [2021-03-10 21:54:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.9820359281437128) internal successors, (996), 334 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 996 transitions. [2021-03-10 21:54:55,453 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 996 transitions. Word has length 20 [2021-03-10 21:54:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:55,453 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 996 transitions. [2021-03-10 21:54:55,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 996 transitions. [2021-03-10 21:54:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:55,454 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:55,454 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:55,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2272,192 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:55,654 INFO L428 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1664558456, now seen corresponding path program 192 times [2021-03-10 21:54:55,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:55,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013244710] [2021-03-10 21:54:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:55,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013244710] [2021-03-10 21:54:55,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602437381] [2021-03-10 21:54:55,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:55,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-03-10 21:54:55,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:55,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:55,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:55,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:55,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:55,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:55,887 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:55,887 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:54:55,917 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:55,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:55,921 INFO L388 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 20 treesize of output 16 [2021-03-10 21:54:55,923 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:55,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:55,954 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:54:55,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:55,956 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:54:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:56,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:56,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:56,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714913597] [2021-03-10 21:54:56,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:56,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:56,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:56,137 INFO L87 Difference]: Start difference. First operand 335 states and 996 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:56,835 INFO L93 Difference]: Finished difference Result 604 states and 1788 transitions. [2021-03-10 21:54:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:54:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:56,837 INFO L225 Difference]: With dead ends: 604 [2021-03-10 21:54:56,837 INFO L226 Difference]: Without dead ends: 589 [2021-03-10 21:54:56,837 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 548.7ms TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:54:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-03-10 21:54:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 329. [2021-03-10 21:54:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.981707317073171) internal successors, (978), 328 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 978 transitions. [2021-03-10 21:54:56,842 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 978 transitions. Word has length 20 [2021-03-10 21:54:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:56,842 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 978 transitions. [2021-03-10 21:54:56,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 978 transitions. [2021-03-10 21:54:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:56,842 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:56,842 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:57,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 193 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2279 [2021-03-10 21:54:57,043 INFO L428 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1655436906, now seen corresponding path program 193 times [2021-03-10 21:54:57,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:57,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526477654] [2021-03-10 21:54:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:57,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526477654] [2021-03-10 21:54:57,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366715113] [2021-03-10 21:54:57,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:57,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:54:57,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:57,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:57,274 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:57,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:57,278 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:57,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:57,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:57,311 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:54:57,417 INFO L388 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 30 treesize of output 24 [2021-03-10 21:54:57,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:57,422 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:57,423 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:57,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:57,443 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:57,444 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:54:57,444 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2021-03-10 21:54:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:57,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:57,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:57,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740926692] [2021-03-10 21:54:57,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:57,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:57,579 INFO L87 Difference]: Start difference. First operand 329 states and 978 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:58,351 INFO L93 Difference]: Finished difference Result 595 states and 1754 transitions. [2021-03-10 21:54:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:54:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:58,354 INFO L225 Difference]: With dead ends: 595 [2021-03-10 21:54:58,354 INFO L226 Difference]: Without dead ends: 580 [2021-03-10 21:54:58,354 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 705.7ms TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2021-03-10 21:54:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-03-10 21:54:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 341. [2021-03-10 21:54:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 2.9911764705882353) internal successors, (1017), 340 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1017 transitions. [2021-03-10 21:54:58,359 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1017 transitions. Word has length 20 [2021-03-10 21:54:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:58,359 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 1017 transitions. [2021-03-10 21:54:58,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1017 transitions. [2021-03-10 21:54:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:58,360 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:58,360 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:58,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2284,194 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:58,561 INFO L428 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 325508744, now seen corresponding path program 194 times [2021-03-10 21:54:58,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:58,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880364533] [2021-03-10 21:54:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:58,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880364533] [2021-03-10 21:54:58,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008568062] [2021-03-10 21:54:58,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:54:58,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:54:58,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:54:58,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:54:58,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:54:58,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:54:58,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:58,811 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:58,812 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:58,812 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2021-03-10 21:54:58,840 INFO L388 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 21 treesize of output 17 [2021-03-10 21:54:58,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:54:58,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:54:58,850 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:54:58,851 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:54:58,851 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2021-03-10 21:54:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:58,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:54:58,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:54:58,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410873706] [2021-03-10 21:54:58,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:54:58,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:54:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:54:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:54:58,954 INFO L87 Difference]: Start difference. First operand 341 states and 1017 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:54:59,619 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2021-03-10 21:54:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:54:59,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:54:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:54:59,621 INFO L225 Difference]: With dead ends: 604 [2021-03-10 21:54:59,621 INFO L226 Difference]: Without dead ends: 589 [2021-03-10 21:54:59,622 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 411.3ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:54:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-03-10 21:54:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 338. [2021-03-10 21:54:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9821958456973294) internal successors, (1005), 337 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1005 transitions. [2021-03-10 21:54:59,626 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1005 transitions. Word has length 20 [2021-03-10 21:54:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:54:59,626 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 1005 transitions. [2021-03-10 21:54:59,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:54:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1005 transitions. [2021-03-10 21:54:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:54:59,627 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:54:59,627 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:54:59,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2292 [2021-03-10 21:54:59,828 INFO L428 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:54:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:54:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash -589572744, now seen corresponding path program 195 times [2021-03-10 21:54:59,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:54:59,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489076128] [2021-03-10 21:54:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:54:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:54:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:54:59,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489076128] [2021-03-10 21:54:59,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771470362] [2021-03-10 21:54:59,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:00,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-03-10 21:55:00,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:00,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:55:00,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:00,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:00,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:00,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:00,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:00,088 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:55:00,118 INFO L388 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 20 treesize of output 16 [2021-03-10 21:55:00,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:00,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:00,127 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:00,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:00,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:15 [2021-03-10 21:55:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:00,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:00,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:55:00,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138792326] [2021-03-10 21:55:00,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:55:00,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:00,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:55:00,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:55:00,238 INFO L87 Difference]: Start difference. First operand 338 states and 1005 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:00,739 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2021-03-10 21:55:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:55:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-10 21:55:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:00,741 INFO L225 Difference]: With dead ends: 583 [2021-03-10 21:55:00,741 INFO L226 Difference]: Without dead ends: 568 [2021-03-10 21:55:00,741 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 385.3ms TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:55:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-03-10 21:55:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 335. [2021-03-10 21:55:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.9820359281437128) internal successors, (996), 334 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 996 transitions. [2021-03-10 21:55:00,746 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 996 transitions. Word has length 20 [2021-03-10 21:55:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:00,746 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 996 transitions. [2021-03-10 21:55:00,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 996 transitions. [2021-03-10 21:55:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 21:55:00,746 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:00,746 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:00,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2293,196 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:00,947 INFO L428 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 895516582, now seen corresponding path program 196 times [2021-03-10 21:55:00,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:00,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906317356] [2021-03-10 21:55:00,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:01,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906317356] [2021-03-10 21:55:01,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377729080] [2021-03-10 21:55:01,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:01,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:55:01,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:01,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-03-10 21:55:01,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:01,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:01,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:01,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:01,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:01,188 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 21:55:01,222 INFO L388 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 20 treesize of output 16 [2021-03-10 21:55:01,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:01,227 INFO L388 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 20 treesize of output 16 [2021-03-10 21:55:01,229 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:01,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:01,263 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:01,264 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:01,264 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:41 [2021-03-10 21:55:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:01,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:01,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:55:01,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398184960] [2021-03-10 21:55:01,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:55:01,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:55:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:55:01,474 INFO L87 Difference]: Start difference. First operand 335 states and 996 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:55:02,262 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-03-10 21:55:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:02,367 INFO L93 Difference]: Finished difference Result 698 states and 2060 transitions. [2021-03-10 21:55:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:55:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 20 [2021-03-10 21:55:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:02,370 INFO L225 Difference]: With dead ends: 698 [2021-03-10 21:55:02,370 INFO L226 Difference]: Without dead ends: 683 [2021-03-10 21:55:02,370 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 734.7ms TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:55:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-03-10 21:55:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 329. [2021-03-10 21:55:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.981707317073171) internal successors, (978), 328 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 978 transitions. [2021-03-10 21:55:02,375 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 978 transitions. Word has length 20 [2021-03-10 21:55:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:02,375 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 978 transitions. [2021-03-10 21:55:02,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:55:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 978 transitions. [2021-03-10 21:55:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:02,375 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:02,375 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:02,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2294 [2021-03-10 21:55:02,576 INFO L428 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:02,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1458639285, now seen corresponding path program 197 times [2021-03-10 21:55:02,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:02,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441282316] [2021-03-10 21:55:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:02,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441282316] [2021-03-10 21:55:02,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147865232] [2021-03-10 21:55:02,731 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:02,755 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:02,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:02,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:02,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:02,806 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:02,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:02,814 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:02,815 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:02,815 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2021-03-10 21:55:02,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:02,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:02,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:02,860 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:02,861 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:02,861 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 21:55:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:02,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:02,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:55:02,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879633671] [2021-03-10 21:55:02,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:55:02,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:02,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:55:02,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:55:02,882 INFO L87 Difference]: Start difference. First operand 329 states and 978 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:03,104 INFO L93 Difference]: Finished difference Result 498 states and 1467 transitions. [2021-03-10 21:55:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:03,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:55:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:03,106 INFO L225 Difference]: With dead ends: 498 [2021-03-10 21:55:03,106 INFO L226 Difference]: Without dead ends: 476 [2021-03-10 21:55:03,106 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 186.4ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:55:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-03-10 21:55:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 343. [2021-03-10 21:55:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.017543859649123) internal successors, (1032), 342 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1032 transitions. [2021-03-10 21:55:03,111 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1032 transitions. Word has length 21 [2021-03-10 21:55:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:03,111 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 1032 transitions. [2021-03-10 21:55:03,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1032 transitions. [2021-03-10 21:55:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:03,112 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:03,112 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:03,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2299 [2021-03-10 21:55:03,315 INFO L428 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:03,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:03,315 INFO L82 PathProgramCache]: Analyzing trace with hash -484060907, now seen corresponding path program 198 times [2021-03-10 21:55:03,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:03,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253904879] [2021-03-10 21:55:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:03,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253904879] [2021-03-10 21:55:03,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801845760] [2021-03-10 21:55:03,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:03,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:55:03,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:03,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:55:03,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:03,584 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:03,586 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:03,590 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:03,592 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:03,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:03,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:03,624 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:55:03,739 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:03,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:03,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:03,746 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:03,749 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:03,751 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:03,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:03,756 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:03,812 INFO L628 ElimStorePlain]: treesize reduction 42, result has 39.1 percent of original size [2021-03-10 21:55:03,812 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:03,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:03,813 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:129, output treesize:27 [2021-03-10 21:55:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:03,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:03,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:55:03,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983456048] [2021-03-10 21:55:03,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:55:03,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:55:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:55:03,904 INFO L87 Difference]: Start difference. First operand 343 states and 1032 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:04,364 INFO L93 Difference]: Finished difference Result 446 states and 1332 transitions. [2021-03-10 21:55:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:55:04,365 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:55:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:04,366 INFO L225 Difference]: With dead ends: 446 [2021-03-10 21:55:04,366 INFO L226 Difference]: Without dead ends: 424 [2021-03-10 21:55:04,366 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 409.6ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:55:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-03-10 21:55:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 349. [2021-03-10 21:55:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.0258620689655173) internal successors, (1053), 348 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1053 transitions. [2021-03-10 21:55:04,370 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1053 transitions. Word has length 21 [2021-03-10 21:55:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:04,370 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 1053 transitions. [2021-03-10 21:55:04,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1053 transitions. [2021-03-10 21:55:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:04,371 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:04,371 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:04,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2301,199 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:04,572 INFO L428 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash -985852243, now seen corresponding path program 199 times [2021-03-10 21:55:04,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:04,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51698553] [2021-03-10 21:55:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:04,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51698553] [2021-03-10 21:55:04,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028700236] [2021-03-10 21:55:04,726 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:04,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:04,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:04,812 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:04,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:04,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:04,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:04,822 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-03-10 21:55:04,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:04,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:04,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:04,848 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:04,849 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:04,849 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2021-03-10 21:55:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:04,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:04,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:55:04,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612146863] [2021-03-10 21:55:04,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:55:04,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:55:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:55:04,880 INFO L87 Difference]: Start difference. First operand 349 states and 1053 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:05,044 INFO L93 Difference]: Finished difference Result 455 states and 1356 transitions. [2021-03-10 21:55:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:05,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:55:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:05,046 INFO L225 Difference]: With dead ends: 455 [2021-03-10 21:55:05,046 INFO L226 Difference]: Without dead ends: 433 [2021-03-10 21:55:05,046 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 163.9ms TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:55:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-03-10 21:55:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 346. [2021-03-10 21:55:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 3.017391304347826) internal successors, (1041), 345 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1041 transitions. [2021-03-10 21:55:05,051 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1041 transitions. Word has length 21 [2021-03-10 21:55:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:05,051 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 1041 transitions. [2021-03-10 21:55:05,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1041 transitions. [2021-03-10 21:55:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:05,051 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:05,051 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:05,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2308 [2021-03-10 21:55:05,252 INFO L428 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1202330933, now seen corresponding path program 200 times [2021-03-10 21:55:05,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:05,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650892212] [2021-03-10 21:55:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:05,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650892212] [2021-03-10 21:55:05,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876135797] [2021-03-10 21:55:05,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:05,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:05,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:05,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:05,512 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:05,514 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:05,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:05,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:05,522 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 21:55:05,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:05,551 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:05,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:05,557 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:55:05,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:05,558 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2021-03-10 21:55:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:05,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:05,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 21:55:05,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391158980] [2021-03-10 21:55:05,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 21:55:05,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 21:55:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:55:05,588 INFO L87 Difference]: Start difference. First operand 346 states and 1041 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:05,868 INFO L93 Difference]: Finished difference Result 443 states and 1323 transitions. [2021-03-10 21:55:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:05,870 INFO L225 Difference]: With dead ends: 443 [2021-03-10 21:55:05,870 INFO L226 Difference]: Without dead ends: 421 [2021-03-10 21:55:05,870 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 210.9ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-03-10 21:55:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 345. [2021-03-10 21:55:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 3.0319767441860463) internal successors, (1043), 344 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1043 transitions. [2021-03-10 21:55:05,874 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1043 transitions. Word has length 21 [2021-03-10 21:55:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:05,874 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 1043 transitions. [2021-03-10 21:55:05,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1043 transitions. [2021-03-10 21:55:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:05,875 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:05,875 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:06,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 201 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2310 [2021-03-10 21:55:06,076 INFO L428 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1099695243, now seen corresponding path program 201 times [2021-03-10 21:55:06,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:06,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922038280] [2021-03-10 21:55:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:06,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922038280] [2021-03-10 21:55:06,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624121363] [2021-03-10 21:55:06,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:06,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:55:06,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:06,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:06,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:06,517 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:06,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:06,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:06,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:06,533 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:06,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:06,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 21:55:06,544 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,548 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:55:06,550 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:06,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2021-03-10 21:55:06,581 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:48 [2021-03-10 21:55:06,812 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_342], 1=[o_2, v_prenex_341]} [2021-03-10 21:55:06,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:06,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:06,854 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:06,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:06,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:06,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:06,892 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:06,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:06,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:06,925 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:06,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:06,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:06,956 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:21 [2021-03-10 21:55:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:07,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:07,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:07,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158415180] [2021-03-10 21:55:07,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:07,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:07,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:07,065 INFO L87 Difference]: Start difference. First operand 345 states and 1043 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:08,253 INFO L93 Difference]: Finished difference Result 711 states and 2128 transitions. [2021-03-10 21:55:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-10 21:55:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:08,256 INFO L225 Difference]: With dead ends: 711 [2021-03-10 21:55:08,256 INFO L226 Difference]: Without dead ends: 692 [2021-03-10 21:55:08,256 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 902.7ms TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2021-03-10 21:55:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-03-10 21:55:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 353. [2021-03-10 21:55:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.0369318181818183) internal successors, (1069), 352 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1069 transitions. [2021-03-10 21:55:08,262 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1069 transitions. Word has length 21 [2021-03-10 21:55:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:08,262 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 1069 transitions. [2021-03-10 21:55:08,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1069 transitions. [2021-03-10 21:55:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:08,262 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:08,262 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:08,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2312 [2021-03-10 21:55:08,463 INFO L428 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2056460365, now seen corresponding path program 202 times [2021-03-10 21:55:08,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:08,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372993732] [2021-03-10 21:55:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:08,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372993732] [2021-03-10 21:55:08,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901182471] [2021-03-10 21:55:08,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:08,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:55:08,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:08,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:08,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:08,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:08,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:08,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:55:08,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:08,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:08,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:08,801 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:08,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:08,833 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:55:08,833 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:63 [2021-03-10 21:55:09,115 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_349, o_4, v_prenex_351, v_prenex_345, v_prenex_346, v_prenex_347], 1=[o_2, v_prenex_344]} [2021-03-10 21:55:09,120 INFO L388 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 11 treesize of output 9 [2021-03-10 21:55:09,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:09,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:09,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:09,191 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:09,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:09,250 INFO L518 ElimStorePlain]: Eliminatee v_prenex_351 vanished before elimination [2021-03-10 21:55:09,255 INFO L388 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 28 treesize of output 22 [2021-03-10 21:55:09,257 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:09,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:09,320 INFO L388 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 21 treesize of output 17 [2021-03-10 21:55:09,322 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:09,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:09,371 INFO L518 ElimStorePlain]: Eliminatee v_prenex_347 vanished before elimination [2021-03-10 21:55:09,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:09,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:09,377 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:09,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:09,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:09,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:09,445 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:09,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:09,497 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:55:09,497 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:125, output treesize:25 [2021-03-10 21:55:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:09,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:09,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:09,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805658491] [2021-03-10 21:55:09,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:09,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:09,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:09,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:09,600 INFO L87 Difference]: Start difference. First operand 353 states and 1069 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:10,734 INFO L93 Difference]: Finished difference Result 756 states and 2279 transitions. [2021-03-10 21:55:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:55:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:10,737 INFO L225 Difference]: With dead ends: 756 [2021-03-10 21:55:10,737 INFO L226 Difference]: Without dead ends: 717 [2021-03-10 21:55:10,737 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1047.0ms TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2021-03-10 21:55:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-03-10 21:55:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 353. [2021-03-10 21:55:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.03125) internal successors, (1067), 352 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1067 transitions. [2021-03-10 21:55:10,743 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1067 transitions. Word has length 21 [2021-03-10 21:55:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:10,743 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 1067 transitions. [2021-03-10 21:55:10,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1067 transitions. [2021-03-10 21:55:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:10,743 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:10,743 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:10,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2335,203 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:10,945 INFO L428 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash -843004949, now seen corresponding path program 203 times [2021-03-10 21:55:10,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:10,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848573867] [2021-03-10 21:55:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:11,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848573867] [2021-03-10 21:55:11,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463868998] [2021-03-10 21:55:11,122 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:11,145 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:11,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:11,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:11,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:11,357 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:11,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:11,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:11,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 21:55:11,368 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,370 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:55:11,372 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:11,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:11,379 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:11,411 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2021-03-10 21:55:11,411 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:48 [2021-03-10 21:55:11,693 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_354], 1=[o_2, v_prenex_353]} [2021-03-10 21:55:11,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:11,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:11,740 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:11,742 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:11,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:11,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:11,783 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,815 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:11,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:11,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:11,822 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:11,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:11,855 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:11,855 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:21 [2021-03-10 21:55:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:11,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:11,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:11,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209960537] [2021-03-10 21:55:11,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:11,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:11,966 INFO L87 Difference]: Start difference. First operand 353 states and 1067 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:13,505 INFO L93 Difference]: Finished difference Result 769 states and 2317 transitions. [2021-03-10 21:55:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-10 21:55:13,506 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:13,508 INFO L225 Difference]: With dead ends: 769 [2021-03-10 21:55:13,508 INFO L226 Difference]: Without dead ends: 750 [2021-03-10 21:55:13,508 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1191.9ms TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2021-03-10 21:55:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-03-10 21:55:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 355. [2021-03-10 21:55:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.0282485875706215) internal successors, (1072), 354 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1072 transitions. [2021-03-10 21:55:13,514 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1072 transitions. Word has length 21 [2021-03-10 21:55:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:13,514 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 1072 transitions. [2021-03-10 21:55:13,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1072 transitions. [2021-03-10 21:55:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:13,515 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:13,515 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:13,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2344 [2021-03-10 21:55:13,715 INFO L428 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 843386891, now seen corresponding path program 204 times [2021-03-10 21:55:13,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:13,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18027196] [2021-03-10 21:55:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:13,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18027196] [2021-03-10 21:55:13,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338187344] [2021-03-10 21:55:13,874 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:13,896 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:55:13,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:13,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:13,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:14,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:14,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:14,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:14,028 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:14,033 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:14,036 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:14,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:14,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:55:14,057 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:20 [2021-03-10 21:55:14,163 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_355, v_prenex_356], 1=[o_2]} [2021-03-10 21:55:14,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:14,169 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:14,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:14,194 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:14,196 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:14,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:14,214 INFO L518 ElimStorePlain]: Eliminatee v_prenex_356 vanished before elimination [2021-03-10 21:55:14,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:14,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:14,219 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:14,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:14,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:14,238 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:13 [2021-03-10 21:55:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:14,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:14,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:14,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785526736] [2021-03-10 21:55:14,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:14,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:14,336 INFO L87 Difference]: Start difference. First operand 355 states and 1072 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:15,405 INFO L93 Difference]: Finished difference Result 781 states and 2340 transitions. [2021-03-10 21:55:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:55:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:15,409 INFO L225 Difference]: With dead ends: 781 [2021-03-10 21:55:15,409 INFO L226 Difference]: Without dead ends: 758 [2021-03-10 21:55:15,409 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 762.2ms TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2021-03-10 21:55:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-03-10 21:55:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 355. [2021-03-10 21:55:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.0282485875706215) internal successors, (1072), 354 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1072 transitions. [2021-03-10 21:55:15,415 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1072 transitions. Word has length 21 [2021-03-10 21:55:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:15,415 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 1072 transitions. [2021-03-10 21:55:15,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1072 transitions. [2021-03-10 21:55:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:15,416 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:15,416 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:15,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2361,205 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:15,616 INFO L428 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2110462127, now seen corresponding path program 205 times [2021-03-10 21:55:15,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:15,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718383130] [2021-03-10 21:55:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:15,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718383130] [2021-03-10 21:55:15,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098784337] [2021-03-10 21:55:15,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:15,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:15,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:16,075 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:16,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:16,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:16,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:16,087 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:16,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:16,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 21:55:16,095 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:55:16,100 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:16,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2021-03-10 21:55:16,141 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:58 [2021-03-10 21:55:16,355 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_359], 1=[o_2, v_prenex_358]} [2021-03-10 21:55:16,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:16,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:16,410 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:16,412 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:16,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:16,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:16,448 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:16,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:16,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:16,483 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:16,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:16,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:16,516 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:21 [2021-03-10 21:55:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:16,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:16,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:16,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097156373] [2021-03-10 21:55:16,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:16,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:16,616 INFO L87 Difference]: Start difference. First operand 355 states and 1072 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:18,012 INFO L93 Difference]: Finished difference Result 640 states and 1928 transitions. [2021-03-10 21:55:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 21:55:18,013 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:18,014 INFO L225 Difference]: With dead ends: 640 [2021-03-10 21:55:18,014 INFO L226 Difference]: Without dead ends: 621 [2021-03-10 21:55:18,015 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1280.6ms TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2021-03-10 21:55:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-03-10 21:55:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 361. [2021-03-10 21:55:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 3.0305555555555554) internal successors, (1091), 360 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1091 transitions. [2021-03-10 21:55:18,019 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1091 transitions. Word has length 21 [2021-03-10 21:55:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:18,019 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 1091 transitions. [2021-03-10 21:55:18,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1091 transitions. [2021-03-10 21:55:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:18,020 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:18,020 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:18,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 206 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2369 [2021-03-10 21:55:18,220 INFO L428 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1962296557, now seen corresponding path program 206 times [2021-03-10 21:55:18,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:18,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596052317] [2021-03-10 21:55:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:18,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596052317] [2021-03-10 21:55:18,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071634289] [2021-03-10 21:55:18,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:18,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:18,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:18,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:18,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:18,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:18,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:18,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:55:18,611 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:18,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:18,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:18,618 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:18,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:18,655 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:55:18,655 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2021-03-10 21:55:18,912 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4, v_prenex_361, v_prenex_362, v_prenex_364, v_prenex_366], 1=[v_prenex_363, v_prenex_365]} [2021-03-10 21:55:18,918 INFO L388 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 21 treesize of output 17 [2021-03-10 21:55:18,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:18,976 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:18,977 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:18,981 INFO L388 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 11 treesize of output 9 [2021-03-10 21:55:18,984 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:19,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:19,036 INFO L518 ElimStorePlain]: Eliminatee v_prenex_362 vanished before elimination [2021-03-10 21:55:19,040 INFO L388 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 28 treesize of output 22 [2021-03-10 21:55:19,042 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:19,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:19,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:19,098 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:19,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:19,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:19,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:19,154 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:19,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:19,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:19,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:19,217 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:19,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:19,271 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:55:19,271 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:125, output treesize:25 [2021-03-10 21:55:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:19,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:19,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:19,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547327665] [2021-03-10 21:55:19,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:19,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:19,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:19,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:19,357 INFO L87 Difference]: Start difference. First operand 361 states and 1091 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:20,408 INFO L93 Difference]: Finished difference Result 650 states and 1952 transitions. [2021-03-10 21:55:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:55:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:20,410 INFO L225 Difference]: With dead ends: 650 [2021-03-10 21:55:20,411 INFO L226 Difference]: Without dead ends: 590 [2021-03-10 21:55:20,411 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 897.9ms TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:55:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2021-03-10 21:55:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 361. [2021-03-10 21:55:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 3.025) internal successors, (1089), 360 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1089 transitions. [2021-03-10 21:55:20,416 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1089 transitions. Word has length 21 [2021-03-10 21:55:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:20,416 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 1089 transitions. [2021-03-10 21:55:20,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1089 transitions. [2021-03-10 21:55:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:20,417 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:20,417 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:20,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2385,207 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:20,617 INFO L428 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash -424070287, now seen corresponding path program 207 times [2021-03-10 21:55:20,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:20,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305663206] [2021-03-10 21:55:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:20,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305663206] [2021-03-10 21:55:20,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501794540] [2021-03-10 21:55:20,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:20,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:55:20,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:20,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:20,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:21,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:21,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:21,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:21,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,167 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:21,170 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,175 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:55:21,177 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:21,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 21:55:21,187 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:21,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2021-03-10 21:55:21,239 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:58 [2021-03-10 21:55:21,338 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_370, v_prenex_371, o_4, v_prenex_373], 1=[o_2, v_prenex_372]} [2021-03-10 21:55:21,343 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:21,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:21,384 INFO L518 ElimStorePlain]: Eliminatee v_prenex_371 vanished before elimination [2021-03-10 21:55:21,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:21,390 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,427 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:21,431 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:21,433 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:21,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:21,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:21,474 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:21,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:21,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:21,517 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:21,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:21,552 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:55:21,552 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:85, output treesize:26 [2021-03-10 21:55:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:21,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:21,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:21,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161648769] [2021-03-10 21:55:21,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:21,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:21,692 INFO L87 Difference]: Start difference. First operand 361 states and 1089 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:22,743 INFO L93 Difference]: Finished difference Result 617 states and 1880 transitions. [2021-03-10 21:55:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 21:55:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:22,745 INFO L225 Difference]: With dead ends: 617 [2021-03-10 21:55:22,745 INFO L226 Difference]: Without dead ends: 594 [2021-03-10 21:55:22,745 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 860.7ms TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2021-03-10 21:55:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-03-10 21:55:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 359. [2021-03-10 21:55:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0279329608938546) internal successors, (1084), 358 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1084 transitions. [2021-03-10 21:55:22,753 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1084 transitions. Word has length 21 [2021-03-10 21:55:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:22,753 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1084 transitions. [2021-03-10 21:55:22,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1084 transitions. [2021-03-10 21:55:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:22,754 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:22,754 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:22,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2405,208 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:22,967 INFO L428 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1309868567, now seen corresponding path program 208 times [2021-03-10 21:55:22,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:22,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376920050] [2021-03-10 21:55:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:23,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376920050] [2021-03-10 21:55:23,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029899565] [2021-03-10 21:55:23,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:23,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:55:23,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:23,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:23,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:23,337 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:23,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:23,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:23,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:23,376 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:59 [2021-03-10 21:55:23,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:23,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:23,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:23,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,487 INFO L388 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 11 treesize of output 9 [2021-03-10 21:55:23,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,494 INFO L388 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 21 treesize of output 17 [2021-03-10 21:55:23,498 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:23,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 21:55:23,507 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,581 INFO L628 ElimStorePlain]: treesize reduction 8, result has 88.9 percent of original size [2021-03-10 21:55:23,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:23,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:23,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:23,589 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:23,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:23,594 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:23,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:23,630 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:55:23,630 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:117, output treesize:26 [2021-03-10 21:55:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:23,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:23,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:23,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277792296] [2021-03-10 21:55:23,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:23,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:23,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:23,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:23,787 INFO L87 Difference]: Start difference. First operand 359 states and 1084 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:25,526 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-03-10 21:55:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:26,083 INFO L93 Difference]: Finished difference Result 771 states and 2301 transitions. [2021-03-10 21:55:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-03-10 21:55:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:26,086 INFO L225 Difference]: With dead ends: 771 [2021-03-10 21:55:26,086 INFO L226 Difference]: Without dead ends: 717 [2021-03-10 21:55:26,086 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1805.6ms TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2021-03-10 21:55:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-03-10 21:55:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 362. [2021-03-10 21:55:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.0304709141274238) internal successors, (1094), 361 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1094 transitions. [2021-03-10 21:55:26,091 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1094 transitions. Word has length 21 [2021-03-10 21:55:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:26,091 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 1094 transitions. [2021-03-10 21:55:26,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1094 transitions. [2021-03-10 21:55:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:26,092 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:26,092 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:26,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2420 [2021-03-10 21:55:26,293 INFO L428 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1594131251, now seen corresponding path program 209 times [2021-03-10 21:55:26,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:26,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256015524] [2021-03-10 21:55:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:26,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256015524] [2021-03-10 21:55:26,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367354290] [2021-03-10 21:55:26,461 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:26,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:55:26,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:26,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:26,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:26,678 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:26,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,684 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:55:26,685 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,689 INFO L388 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 24 treesize of output 18 [2021-03-10 21:55:26,691 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,695 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:26,697 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:26,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:55:26,730 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:109, output treesize:57 [2021-03-10 21:55:26,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:55:26,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:26,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,836 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:26,838 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:26,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:26,884 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:26,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:26,890 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:26,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:26,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:55:26,932 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:99, output treesize:26 [2021-03-10 21:55:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:27,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:27,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:27,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084008705] [2021-03-10 21:55:27,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:27,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:27,090 INFO L87 Difference]: Start difference. First operand 362 states and 1094 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:28,552 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2021-03-10 21:55:28,672 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-03-10 21:55:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:29,147 INFO L93 Difference]: Finished difference Result 716 states and 2111 transitions. [2021-03-10 21:55:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-03-10 21:55:29,147 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:29,148 INFO L225 Difference]: With dead ends: 716 [2021-03-10 21:55:29,148 INFO L226 Difference]: Without dead ends: 662 [2021-03-10 21:55:29,149 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1853.0ms TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2021-03-10 21:55:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-03-10 21:55:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 379. [2021-03-10 21:55:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.0343915343915344) internal successors, (1147), 378 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1147 transitions. [2021-03-10 21:55:29,154 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1147 transitions. Word has length 21 [2021-03-10 21:55:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:29,154 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 1147 transitions. [2021-03-10 21:55:29,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1147 transitions. [2021-03-10 21:55:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:29,155 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:29,155 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:29,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 210 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2428 [2021-03-10 21:55:29,377 INFO L428 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:29,378 INFO L82 PathProgramCache]: Analyzing trace with hash 92260589, now seen corresponding path program 210 times [2021-03-10 21:55:29,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:29,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015088638] [2021-03-10 21:55:29,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:29,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015088638] [2021-03-10 21:55:29,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813244868] [2021-03-10 21:55:29,595 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:29,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:55:29,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:29,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:29,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:29,839 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:29,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:29,845 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:55:29,847 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:29,853 INFO L388 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 24 treesize of output 18 [2021-03-10 21:55:29,855 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:29,859 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:29,861 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:29,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:29,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:55:29,897 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:109, output treesize:57 [2021-03-10 21:55:30,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:30,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:30,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:55:30,069 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:30,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:30,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:30,077 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:30,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:30,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:30,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:30,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:30,121 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:30,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:30,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:30,129 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:30,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:30,165 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:30,165 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:21 [2021-03-10 21:55:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:30,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:30,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:30,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153861381] [2021-03-10 21:55:30,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:30,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:30,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:30,281 INFO L87 Difference]: Start difference. First operand 379 states and 1147 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:31,325 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2021-03-10 21:55:31,672 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2021-03-10 21:55:31,809 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-03-10 21:55:32,192 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-03-10 21:55:32,318 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2021-03-10 21:55:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:32,472 INFO L93 Difference]: Finished difference Result 606 states and 1789 transitions. [2021-03-10 21:55:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-10 21:55:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:32,474 INFO L225 Difference]: With dead ends: 606 [2021-03-10 21:55:32,474 INFO L226 Difference]: Without dead ends: 564 [2021-03-10 21:55:32,474 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2115.5ms TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2021-03-10 21:55:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-03-10 21:55:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 373. [2021-03-10 21:55:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 3.043010752688172) internal successors, (1132), 372 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1132 transitions. [2021-03-10 21:55:32,480 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1132 transitions. Word has length 21 [2021-03-10 21:55:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:32,480 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 1132 transitions. [2021-03-10 21:55:32,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1132 transitions. [2021-03-10 21:55:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:32,481 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:32,481 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:32,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2437,211 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:32,694 INFO L428 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 77948227, now seen corresponding path program 211 times [2021-03-10 21:55:32,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:32,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119782036] [2021-03-10 21:55:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:32,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119782036] [2021-03-10 21:55:32,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918569959] [2021-03-10 21:55:32,869 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:32,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:32,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:32,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:32,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:32,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:32,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:32,998 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:33,000 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:33,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:33,029 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:55:33,030 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:29 [2021-03-10 21:55:33,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:33,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:33,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:33,102 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:33,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:33,103 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 21:55:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:33,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:33,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 21:55:33,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425744642] [2021-03-10 21:55:33,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 21:55:33,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 21:55:33,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:55:33,124 INFO L87 Difference]: Start difference. First operand 373 states and 1132 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:33,421 INFO L93 Difference]: Finished difference Result 694 states and 2075 transitions. [2021-03-10 21:55:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:33,424 INFO L225 Difference]: With dead ends: 694 [2021-03-10 21:55:33,424 INFO L226 Difference]: Without dead ends: 672 [2021-03-10 21:55:33,424 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 252.4ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-03-10 21:55:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 377. [2021-03-10 21:55:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.0531914893617023) internal successors, (1148), 376 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1148 transitions. [2021-03-10 21:55:33,430 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1148 transitions. Word has length 21 [2021-03-10 21:55:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:33,431 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 1148 transitions. [2021-03-10 21:55:33,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1148 transitions. [2021-03-10 21:55:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:33,432 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:33,432 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:33,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 212 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2445 [2021-03-10 21:55:33,634 INFO L428 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2011840595, now seen corresponding path program 212 times [2021-03-10 21:55:33,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:33,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785851566] [2021-03-10 21:55:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:33,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785851566] [2021-03-10 21:55:33,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400149521] [2021-03-10 21:55:33,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:33,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:33,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:33,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:33,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:33,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:33,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:33,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:33,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:33,991 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:33,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:33,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:33,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:33,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:34,000 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:34,004 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:34,006 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:34,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:34,071 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:55:34,071 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:73 [2021-03-10 21:55:34,537 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_378], 1=[o_2, v_prenex_377]} [2021-03-10 21:55:34,544 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:34,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:34,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:34,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:34,613 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:34,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:34,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:34,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:34,661 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:34,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:34,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:34,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:34,700 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:34,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:34,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:34,744 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:21 [2021-03-10 21:55:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:34,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:34,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:34,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078521083] [2021-03-10 21:55:34,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:34,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:34,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:34,853 INFO L87 Difference]: Start difference. First operand 377 states and 1148 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:35,055 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2021-03-10 21:55:36,128 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2021-03-10 21:55:36,647 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2021-03-10 21:55:36,781 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2021-03-10 21:55:37,357 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2021-03-10 21:55:37,525 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-03-10 21:55:37,774 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-03-10 21:55:37,957 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2021-03-10 21:55:38,173 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2021-03-10 21:55:38,429 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2021-03-10 21:55:38,644 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-03-10 21:55:38,971 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-03-10 21:55:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:39,028 INFO L93 Difference]: Finished difference Result 1109 states and 3220 transitions. [2021-03-10 21:55:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-03-10 21:55:39,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:39,031 INFO L225 Difference]: With dead ends: 1109 [2021-03-10 21:55:39,031 INFO L226 Difference]: Without dead ends: 1052 [2021-03-10 21:55:39,032 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 3521.3ms TimeCoverageRelationStatistics Valid=380, Invalid=1690, Unknown=0, NotChecked=0, Total=2070 [2021-03-10 21:55:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-03-10 21:55:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 382. [2021-03-10 21:55:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.073490813648294) internal successors, (1171), 381 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1171 transitions. [2021-03-10 21:55:39,039 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1171 transitions. Word has length 21 [2021-03-10 21:55:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:39,039 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 1171 transitions. [2021-03-10 21:55:39,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1171 transitions. [2021-03-10 21:55:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:39,039 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:39,039 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:39,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2449,213 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:39,240 INFO L428 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1055075473, now seen corresponding path program 213 times [2021-03-10 21:55:39,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:39,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482708823] [2021-03-10 21:55:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:39,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482708823] [2021-03-10 21:55:39,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323284744] [2021-03-10 21:55:39,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:39,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:55:39,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:39,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:39,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:39,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:39,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:39,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:39,547 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:39,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:55:39,549 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2021-03-10 21:55:39,773 INFO L446 ElimStorePlain]: Different costs {0=[o_4], 1=[o_2]} [2021-03-10 21:55:39,778 INFO L388 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 11 treesize of output 9 [2021-03-10 21:55:39,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:39,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:39,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:39,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:39,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:39,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:39,812 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:39,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:39,833 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:39,833 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:5 [2021-03-10 21:55:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:39,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:39,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:39,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649237624] [2021-03-10 21:55:39,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:39,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:39,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:39,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:39,894 INFO L87 Difference]: Start difference. First operand 382 states and 1171 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:40,913 INFO L93 Difference]: Finished difference Result 772 states and 2292 transitions. [2021-03-10 21:55:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:55:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:40,915 INFO L225 Difference]: With dead ends: 772 [2021-03-10 21:55:40,915 INFO L226 Difference]: Without dead ends: 733 [2021-03-10 21:55:40,915 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 758.7ms TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2021-03-10 21:55:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-03-10 21:55:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 384. [2021-03-10 21:55:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.073107049608355) internal successors, (1177), 383 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1177 transitions. [2021-03-10 21:55:40,921 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1177 transitions. Word has length 21 [2021-03-10 21:55:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:40,921 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 1177 transitions. [2021-03-10 21:55:40,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1177 transitions. [2021-03-10 21:55:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:40,921 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:40,921 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:41,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 214 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2466 [2021-03-10 21:55:41,122 INFO L428 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 340426509, now seen corresponding path program 214 times [2021-03-10 21:55:41,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:41,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098784499] [2021-03-10 21:55:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:41,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098784499] [2021-03-10 21:55:41,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827465156] [2021-03-10 21:55:41,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:41,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:55:41,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:41,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:41,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:41,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:41,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:41,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:41,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:41,492 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:41,494 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:41,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:41,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:41,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:41,502 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:41,515 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:41,518 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:41,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:41,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:55:41,585 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:73 [2021-03-10 21:55:42,112 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_383], 1=[o_2, v_prenex_382]} [2021-03-10 21:55:42,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:42,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:42,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:42,159 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:42,162 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:42,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:42,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:42,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:42,205 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:42,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:42,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:42,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:42,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:42,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:42,277 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:42,278 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:21 [2021-03-10 21:55:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:42,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:42,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:42,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040130918] [2021-03-10 21:55:42,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:42,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:42,390 INFO L87 Difference]: Start difference. First operand 384 states and 1177 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:43,507 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2021-03-10 21:55:43,783 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-03-10 21:55:44,196 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2021-03-10 21:55:44,394 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2021-03-10 21:55:44,551 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-03-10 21:55:44,869 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-03-10 21:55:45,141 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-03-10 21:55:45,541 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-03-10 21:55:45,716 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2021-03-10 21:55:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:45,917 INFO L93 Difference]: Finished difference Result 989 states and 2937 transitions. [2021-03-10 21:55:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-10 21:55:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:45,921 INFO L225 Difference]: With dead ends: 989 [2021-03-10 21:55:45,921 INFO L226 Difference]: Without dead ends: 951 [2021-03-10 21:55:45,922 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 2800.2ms TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2021-03-10 21:55:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-03-10 21:55:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 386. [2021-03-10 21:55:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.07012987012987) internal successors, (1182), 385 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1182 transitions. [2021-03-10 21:55:45,928 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1182 transitions. Word has length 21 [2021-03-10 21:55:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:45,928 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 1182 transitions. [2021-03-10 21:55:45,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1182 transitions. [2021-03-10 21:55:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:45,929 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:45,929 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:46,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 215 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2474 [2021-03-10 21:55:46,130 INFO L428 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2026818349, now seen corresponding path program 215 times [2021-03-10 21:55:46,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:46,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986898195] [2021-03-10 21:55:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:46,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986898195] [2021-03-10 21:55:46,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161216898] [2021-03-10 21:55:46,297 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:46,322 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:55:46,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:46,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:46,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:46,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:46,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:46,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:46,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:46,534 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:46,537 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:46,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:46,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:46,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:46,545 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:46,550 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:46,552 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:46,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:46,618 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:55:46,618 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:73 [2021-03-10 21:55:47,009 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_390, o_2, o_4, v_prenex_388], 1=[v_prenex_387, v_prenex_389]} [2021-03-10 21:55:47,014 INFO L388 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 26 treesize of output 20 [2021-03-10 21:55:47,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:47,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:47,068 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:47,070 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:47,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:47,116 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:47,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:47,123 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:47,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:47,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:47,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:47,184 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:47,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:47,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:47,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:47,241 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:47,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:47,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:55:47,284 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:85, output treesize:26 [2021-03-10 21:55:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:47,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:47,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:47,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535207528] [2021-03-10 21:55:47,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:47,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:47,464 INFO L87 Difference]: Start difference. First operand 386 states and 1182 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:47,929 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2021-03-10 21:55:48,121 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2021-03-10 21:55:48,330 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2021-03-10 21:55:48,813 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-03-10 21:55:49,063 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-03-10 21:55:49,450 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-03-10 21:55:49,681 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2021-03-10 21:55:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:49,853 INFO L93 Difference]: Finished difference Result 848 states and 2497 transitions. [2021-03-10 21:55:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 21:55:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:49,857 INFO L225 Difference]: With dead ends: 848 [2021-03-10 21:55:49,857 INFO L226 Difference]: Without dead ends: 802 [2021-03-10 21:55:49,857 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2214.6ms TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2021-03-10 21:55:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-03-10 21:55:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 383. [2021-03-10 21:55:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.0837696335078535) internal successors, (1178), 382 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1178 transitions. [2021-03-10 21:55:49,869 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1178 transitions. Word has length 21 [2021-03-10 21:55:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:49,869 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 1178 transitions. [2021-03-10 21:55:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1178 transitions. [2021-03-10 21:55:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:49,869 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:49,869 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:50,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2491,216 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:50,070 INFO L428 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1604188087, now seen corresponding path program 216 times [2021-03-10 21:55:50,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:50,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216260531] [2021-03-10 21:55:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:50,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216260531] [2021-03-10 21:55:50,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974129987] [2021-03-10 21:55:50,235 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:50,258 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:55:50,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:50,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:50,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:50,307 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:50,309 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:50,312 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:50,314 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:50,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:50,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:50,330 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:55:50,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:50,384 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:50,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:50,390 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:50,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:50,391 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 21:55:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:50,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:50,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:55:50,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356934016] [2021-03-10 21:55:50,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:55:50,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:55:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:55:50,412 INFO L87 Difference]: Start difference. First operand 383 states and 1178 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:50,780 INFO L93 Difference]: Finished difference Result 623 states and 1881 transitions. [2021-03-10 21:55:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:50,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:55:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:50,782 INFO L225 Difference]: With dead ends: 623 [2021-03-10 21:55:50,782 INFO L226 Difference]: Without dead ends: 601 [2021-03-10 21:55:50,783 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 248.4ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-03-10 21:55:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 386. [2021-03-10 21:55:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.0805194805194804) internal successors, (1186), 385 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1186 transitions. [2021-03-10 21:55:50,789 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1186 transitions. Word has length 21 [2021-03-10 21:55:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:50,789 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 1186 transitions. [2021-03-10 21:55:50,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1186 transitions. [2021-03-10 21:55:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:50,789 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:50,790 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:50,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2509,217 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:50,990 INFO L428 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash 276564851, now seen corresponding path program 217 times [2021-03-10 21:55:50,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:50,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658583620] [2021-03-10 21:55:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:51,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658583620] [2021-03-10 21:55:51,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508581817] [2021-03-10 21:55:51,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:51,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:51,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:51,257 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:51,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:51,263 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:51,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:51,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:51,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:51,283 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:55:51,336 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:51,339 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:51,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:51,344 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:51,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:51,359 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:51,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:51,360 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 21:55:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:51,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:51,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:55:51,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231846506] [2021-03-10 21:55:51,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:55:51,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:55:51,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:55:51,407 INFO L87 Difference]: Start difference. First operand 386 states and 1186 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:51,777 INFO L93 Difference]: Finished difference Result 629 states and 1894 transitions. [2021-03-10 21:55:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:51,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:55:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:51,779 INFO L225 Difference]: With dead ends: 629 [2021-03-10 21:55:51,779 INFO L226 Difference]: Without dead ends: 600 [2021-03-10 21:55:51,780 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 277.2ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-03-10 21:55:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 386. [2021-03-10 21:55:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.0805194805194804) internal successors, (1186), 385 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1186 transitions. [2021-03-10 21:55:51,785 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1186 transitions. Word has length 21 [2021-03-10 21:55:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:51,785 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 1186 transitions. [2021-03-10 21:55:51,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1186 transitions. [2021-03-10 21:55:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:51,786 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:51,786 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:51,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2513,218 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:51,986 INFO L428 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2024311991, now seen corresponding path program 218 times [2021-03-10 21:55:51,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:51,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570095229] [2021-03-10 21:55:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:52,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570095229] [2021-03-10 21:55:52,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688611081] [2021-03-10 21:55:52,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:52,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:52,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:52,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:52,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:52,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:52,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:52,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:52,483 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:52,490 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-03-10 21:55:52,490 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2021-03-10 21:55:52,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:52,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:52,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:52,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:52,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:52,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:55:52,692 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:52,707 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:52,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:52,709 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:9 [2021-03-10 21:55:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:52,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:52,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:55:52,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87213788] [2021-03-10 21:55:52,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:55:52,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:55:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:55:52,734 INFO L87 Difference]: Start difference. First operand 386 states and 1186 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:53,106 INFO L93 Difference]: Finished difference Result 521 states and 1580 transitions. [2021-03-10 21:55:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:53,109 INFO L225 Difference]: With dead ends: 521 [2021-03-10 21:55:53,109 INFO L226 Difference]: Without dead ends: 499 [2021-03-10 21:55:53,109 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 391.0ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:55:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-03-10 21:55:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 392. [2021-03-10 21:55:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.0869565217391304) internal successors, (1207), 391 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1207 transitions. [2021-03-10 21:55:53,114 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1207 transitions. Word has length 21 [2021-03-10 21:55:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:53,114 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 1207 transitions. [2021-03-10 21:55:53,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1207 transitions. [2021-03-10 21:55:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:53,115 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:53,115 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:53,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2518 [2021-03-10 21:55:53,315 INFO L428 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:53,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1768863969, now seen corresponding path program 219 times [2021-03-10 21:55:53,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:53,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413036837] [2021-03-10 21:55:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:53,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413036837] [2021-03-10 21:55:53,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350199990] [2021-03-10 21:55:53,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:53,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:55:53,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:53,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:53,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:53,691 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:53,693 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:53,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:53,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:53,704 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 21:55:53,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:53,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:53,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:53,752 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:55:53,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:53,753 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2021-03-10 21:55:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:53,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:53,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:55:53,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848420349] [2021-03-10 21:55:53,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:55:53,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:55:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:53,791 INFO L87 Difference]: Start difference. First operand 392 states and 1207 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:54,047 INFO L93 Difference]: Finished difference Result 512 states and 1556 transitions. [2021-03-10 21:55:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:54,049 INFO L225 Difference]: With dead ends: 512 [2021-03-10 21:55:54,049 INFO L226 Difference]: Without dead ends: 490 [2021-03-10 21:55:54,049 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 281.5ms TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-03-10 21:55:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 389. [2021-03-10 21:55:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.079896907216495) internal successors, (1195), 388 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1195 transitions. [2021-03-10 21:55:54,054 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1195 transitions. Word has length 21 [2021-03-10 21:55:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:54,054 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 1195 transitions. [2021-03-10 21:55:54,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1195 transitions. [2021-03-10 21:55:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:54,055 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:54,055 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:54,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2527,220 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:54,259 INFO L428 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:54,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -337920151, now seen corresponding path program 220 times [2021-03-10 21:55:54,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:54,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141124788] [2021-03-10 21:55:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:54,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141124788] [2021-03-10 21:55:54,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658062060] [2021-03-10 21:55:54,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:54,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:55:54,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:54,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:54,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:54,634 INFO L388 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 17 treesize of output 13 [2021-03-10 21:55:54,637 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:54,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:54,645 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:54,645 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 21:55:54,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:54,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:54,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:54,689 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:55:54,690 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:54,690 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2021-03-10 21:55:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:54,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:54,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:55:54,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896452477] [2021-03-10 21:55:54,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:55:54,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:55:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:55:54,725 INFO L87 Difference]: Start difference. First operand 389 states and 1195 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:55,035 INFO L93 Difference]: Finished difference Result 515 states and 1562 transitions. [2021-03-10 21:55:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:55,037 INFO L225 Difference]: With dead ends: 515 [2021-03-10 21:55:55,037 INFO L226 Difference]: Without dead ends: 493 [2021-03-10 21:55:55,037 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 299.9ms TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:55:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-03-10 21:55:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 386. [2021-03-10 21:55:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.0805194805194804) internal successors, (1186), 385 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1186 transitions. [2021-03-10 21:55:55,042 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1186 transitions. Word has length 21 [2021-03-10 21:55:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:55,042 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 1186 transitions. [2021-03-10 21:55:55,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1186 transitions. [2021-03-10 21:55:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:55,043 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:55,043 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:55,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2530,221 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:55,243 INFO L428 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:55,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1394832891, now seen corresponding path program 221 times [2021-03-10 21:55:55,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:55,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654917714] [2021-03-10 21:55:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:55,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654917714] [2021-03-10 21:55:55,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728733972] [2021-03-10 21:55:55,444 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:55,470 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:55:55,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:55,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:55,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:55,667 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:55,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:55,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:55,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:55,681 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:55,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:55,726 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:55:55,726 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:55:56,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:56,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:56,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:56,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:56,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:56,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:55:56,041 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:56,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:56,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:56,057 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:9 [2021-03-10 21:55:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:56,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:56,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:55:56,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927952096] [2021-03-10 21:55:56,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:55:56,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:55:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:55:56,080 INFO L87 Difference]: Start difference. First operand 386 states and 1186 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:56,489 INFO L93 Difference]: Finished difference Result 533 states and 1619 transitions. [2021-03-10 21:55:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:56,491 INFO L225 Difference]: With dead ends: 533 [2021-03-10 21:55:56,491 INFO L226 Difference]: Without dead ends: 511 [2021-03-10 21:55:56,492 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 401.3ms TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:55:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-03-10 21:55:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 393. [2021-03-10 21:55:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.0969387755102042) internal successors, (1214), 392 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1214 transitions. [2021-03-10 21:55:56,496 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1214 transitions. Word has length 21 [2021-03-10 21:55:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:56,496 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 1214 transitions. [2021-03-10 21:55:56,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1214 transitions. [2021-03-10 21:55:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:56,497 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:56,497 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:56,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 222 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2533 [2021-03-10 21:55:56,697 INFO L428 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash 893041555, now seen corresponding path program 222 times [2021-03-10 21:55:56,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:56,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20604504] [2021-03-10 21:55:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:56,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20604504] [2021-03-10 21:55:56,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234160539] [2021-03-10 21:55:56,897 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:56,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:55:56,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:55:56,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:55:56,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:57,132 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:57,134 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:57,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:57,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:57,141 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:57,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:57,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:55:57,186 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:55:57,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:57,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:57,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:57,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:57,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:57,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:55:57,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:57,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:57,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:55:57,401 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2021-03-10 21:55:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:57,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:57,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:55:57,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592923021] [2021-03-10 21:55:57,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:55:57,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:57,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:55:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:55:57,441 INFO L87 Difference]: Start difference. First operand 393 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:55:57,889 INFO L93 Difference]: Finished difference Result 524 states and 1595 transitions. [2021-03-10 21:55:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:55:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:55:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:55:57,892 INFO L225 Difference]: With dead ends: 524 [2021-03-10 21:55:57,892 INFO L226 Difference]: Without dead ends: 502 [2021-03-10 21:55:57,892 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 372.2ms TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:55:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-03-10 21:55:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 390. [2021-03-10 21:55:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.089974293059126) internal successors, (1202), 389 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1202 transitions. [2021-03-10 21:55:57,897 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1202 transitions. Word has length 21 [2021-03-10 21:55:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:55:57,897 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 1202 transitions. [2021-03-10 21:55:57,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:55:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1202 transitions. [2021-03-10 21:55:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:55:57,898 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:55:57,898 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:55:58,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2544,223 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:58,098 INFO L428 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:55:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:55:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2020157009, now seen corresponding path program 223 times [2021-03-10 21:55:58,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:55:58,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762244097] [2021-03-10 21:55:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:55:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:58,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762244097] [2021-03-10 21:55:58,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760960255] [2021-03-10 21:55:58,299 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:55:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:55:58,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:55:58,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:55:58,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:58,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:58,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:58,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:58,622 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:58,624 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:58,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:58,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:58,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:55:58,633 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:58,638 INFO L388 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 9 treesize of output 7 [2021-03-10 21:55:58,640 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:58,748 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:55:58,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:58,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:55:58,758 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:101 [2021-03-10 21:55:59,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:59,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:55:59,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:59,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:59,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:59,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:55:59,480 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:59,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:59,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:59,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:55:59,536 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:59,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:59,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:55:59,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:55:59,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:55:59,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:55:59,636 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:55:59,636 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:83, output treesize:21 [2021-03-10 21:55:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:55:59,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:55:59,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:55:59,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819846492] [2021-03-10 21:55:59,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:55:59,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:55:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:55:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:55:59,760 INFO L87 Difference]: Start difference. First operand 390 states and 1202 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:00,713 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2021-03-10 21:56:00,902 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-03-10 21:56:01,269 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-03-10 21:56:01,637 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-03-10 21:56:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:01,876 INFO L93 Difference]: Finished difference Result 636 states and 1909 transitions. [2021-03-10 21:56:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:56:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:01,878 INFO L225 Difference]: With dead ends: 636 [2021-03-10 21:56:01,878 INFO L226 Difference]: Without dead ends: 598 [2021-03-10 21:56:01,879 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1899.3ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-03-10 21:56:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-03-10 21:56:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 397. [2021-03-10 21:56:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.106060606060606) internal successors, (1230), 396 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1230 transitions. [2021-03-10 21:56:01,885 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1230 transitions. Word has length 21 [2021-03-10 21:56:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:01,885 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 1230 transitions. [2021-03-10 21:56:01,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1230 transitions. [2021-03-10 21:56:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:01,885 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:01,886 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:02,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2549 [2021-03-10 21:56:02,086 INFO L428 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:02,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1797948397, now seen corresponding path program 224 times [2021-03-10 21:56:02,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:02,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280812592] [2021-03-10 21:56:02,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:02,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280812592] [2021-03-10 21:56:02,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914479864] [2021-03-10 21:56:02,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:02,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:56:02,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:02,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:02,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:02,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:02,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:02,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:02,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:02,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-03-10 21:56:02,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2021-03-10 21:56:02,855 INFO L388 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 11 treesize of output 9 [2021-03-10 21:56:02,858 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:02,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:02,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:02,864 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:02,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:02,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:02,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:02,908 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:02,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:02,946 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:02,946 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:61, output treesize:5 [2021-03-10 21:56:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:03,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:03,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:03,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207588969] [2021-03-10 21:56:03,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:03,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:03,020 INFO L87 Difference]: Start difference. First operand 397 states and 1230 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:04,020 INFO L93 Difference]: Finished difference Result 717 states and 2146 transitions. [2021-03-10 21:56:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:56:04,022 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:04,023 INFO L225 Difference]: With dead ends: 717 [2021-03-10 21:56:04,023 INFO L226 Difference]: Without dead ends: 657 [2021-03-10 21:56:04,023 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 658.2ms TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:56:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-03-10 21:56:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 399. [2021-03-10 21:56:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 3.0954773869346734) internal successors, (1232), 398 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1232 transitions. [2021-03-10 21:56:04,029 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1232 transitions. Word has length 21 [2021-03-10 21:56:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:04,029 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 1232 transitions. [2021-03-10 21:56:04,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1232 transitions. [2021-03-10 21:56:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:04,030 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:04,030 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:04,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2577,225 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:04,231 INFO L428 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -588418447, now seen corresponding path program 225 times [2021-03-10 21:56:04,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:04,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355690497] [2021-03-10 21:56:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:04,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355690497] [2021-03-10 21:56:04,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552069075] [2021-03-10 21:56:04,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:04,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:56:04,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:04,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:04,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:04,667 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:04,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:04,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:04,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:04,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:04,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:04,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:56:04,722 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:56:04,946 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4], 1=[v_prenex_399, v_prenex_400]} [2021-03-10 21:56:04,951 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:04,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:04,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:04,984 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:04,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:04,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:04,991 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:05,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:05,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:05,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:05,024 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:05,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:05,050 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:05,050 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:13 [2021-03-10 21:56:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:05,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:05,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:05,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190648618] [2021-03-10 21:56:05,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:05,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:05,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:05,166 INFO L87 Difference]: Start difference. First operand 399 states and 1232 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:06,023 INFO L93 Difference]: Finished difference Result 647 states and 1966 transitions. [2021-03-10 21:56:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 21:56:06,025 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:06,026 INFO L225 Difference]: With dead ends: 647 [2021-03-10 21:56:06,026 INFO L226 Difference]: Without dead ends: 624 [2021-03-10 21:56:06,026 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 643.5ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:56:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-03-10 21:56:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 395. [2021-03-10 21:56:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 3.0964467005076144) internal successors, (1220), 394 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1220 transitions. [2021-03-10 21:56:06,032 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1220 transitions. Word has length 21 [2021-03-10 21:56:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:06,032 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 1220 transitions. [2021-03-10 21:56:06,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1220 transitions. [2021-03-10 21:56:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:06,033 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:06,033 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:06,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2591,226 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:06,235 INFO L428 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1708420467, now seen corresponding path program 226 times [2021-03-10 21:56:06,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:06,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950229500] [2021-03-10 21:56:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:06,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950229500] [2021-03-10 21:56:06,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986408193] [2021-03-10 21:56:06,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:06,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:56:06,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:06,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:06,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:06,803 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:06,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:06,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:06,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:06,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:06,817 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:06,823 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:06,826 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:06,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:06,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:06,833 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:06,944 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:56:06,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:06,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:56:06,954 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:101 [2021-03-10 21:56:07,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:07,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:07,333 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:07,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:07,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:07,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:07,401 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:07,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:07,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:07,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:07,467 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:07,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:07,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:07,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:07,534 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:07,599 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:07,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:07,601 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:93, output treesize:34 [2021-03-10 21:56:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:07,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:07,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:07,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957683235] [2021-03-10 21:56:07,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:07,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:07,793 INFO L87 Difference]: Start difference. First operand 395 states and 1220 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:09,669 INFO L93 Difference]: Finished difference Result 673 states and 2042 transitions. [2021-03-10 21:56:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-03-10 21:56:09,671 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:09,672 INFO L225 Difference]: With dead ends: 673 [2021-03-10 21:56:09,672 INFO L226 Difference]: Without dead ends: 654 [2021-03-10 21:56:09,673 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1462.7ms TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2021-03-10 21:56:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-03-10 21:56:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 395. [2021-03-10 21:56:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 3.0964467005076144) internal successors, (1220), 394 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1220 transitions. [2021-03-10 21:56:09,679 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1220 transitions. Word has length 21 [2021-03-10 21:56:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:09,679 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 1220 transitions. [2021-03-10 21:56:09,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1220 transitions. [2021-03-10 21:56:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:09,679 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:09,680 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:09,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2602,227 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:09,880 INFO L428 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash -20541421, now seen corresponding path program 227 times [2021-03-10 21:56:09,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:09,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935826816] [2021-03-10 21:56:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:10,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935826816] [2021-03-10 21:56:10,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568548112] [2021-03-10 21:56:10,107 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:10,131 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:56:10,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:10,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:10,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:10,246 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:10,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:10,252 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:10,255 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:10,277 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:10,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:10,279 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:56:10,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:10,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:10,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:10,422 INFO L518 ElimStorePlain]: Eliminatee v_prenex_406 vanished before elimination [2021-03-10 21:56:10,425 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:10,428 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:10,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:10,443 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:10,444 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:10,445 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:15 [2021-03-10 21:56:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:10,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:10,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:56:10,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268004147] [2021-03-10 21:56:10,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:56:10,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:56:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:56:10,493 INFO L87 Difference]: Start difference. First operand 395 states and 1220 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:10,916 INFO L93 Difference]: Finished difference Result 547 states and 1668 transitions. [2021-03-10 21:56:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:10,918 INFO L225 Difference]: With dead ends: 547 [2021-03-10 21:56:10,918 INFO L226 Difference]: Without dead ends: 518 [2021-03-10 21:56:10,918 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 339.2ms TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:56:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-03-10 21:56:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 395. [2021-03-10 21:56:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 3.0964467005076144) internal successors, (1220), 394 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1220 transitions. [2021-03-10 21:56:10,923 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1220 transitions. Word has length 21 [2021-03-10 21:56:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:10,923 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 1220 transitions. [2021-03-10 21:56:10,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1220 transitions. [2021-03-10 21:56:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:10,924 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:10,924 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:11,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2611,228 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:11,124 INFO L428 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1115240339, now seen corresponding path program 228 times [2021-03-10 21:56:11,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:11,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324017439] [2021-03-10 21:56:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:11,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324017439] [2021-03-10 21:56:11,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829119833] [2021-03-10 21:56:11,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:56:11,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:56:11,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:11,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:11,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:11,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:11,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:11,626 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:11,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:11,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-03-10 21:56:11,660 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2021-03-10 21:56:11,892 INFO L388 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 11 treesize of output 9 [2021-03-10 21:56:11,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:11,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:11,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:11,902 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:11,950 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:11,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:11,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:11,957 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:12,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:12,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:12,003 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:71, output treesize:19 [2021-03-10 21:56:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:12,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:12,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:12,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399581101] [2021-03-10 21:56:12,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:12,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:12,136 INFO L87 Difference]: Start difference. First operand 395 states and 1220 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:12,468 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2021-03-10 21:56:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:13,500 INFO L93 Difference]: Finished difference Result 752 states and 2244 transitions. [2021-03-10 21:56:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:56:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:13,503 INFO L225 Difference]: With dead ends: 752 [2021-03-10 21:56:13,503 INFO L226 Difference]: Without dead ends: 698 [2021-03-10 21:56:13,504 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1067.4ms TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:56:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-03-10 21:56:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 396. [2021-03-10 21:56:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1215189873417724) internal successors, (1233), 395 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1233 transitions. [2021-03-10 21:56:13,509 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1233 transitions. Word has length 21 [2021-03-10 21:56:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:13,509 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 1233 transitions. [2021-03-10 21:56:13,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1233 transitions. [2021-03-10 21:56:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:13,510 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:13,510 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:13,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2620 [2021-03-10 21:56:13,711 INFO L428 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1739526103, now seen corresponding path program 229 times [2021-03-10 21:56:13,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:13,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904223221] [2021-03-10 21:56:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:13,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904223221] [2021-03-10 21:56:13,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393896207] [2021-03-10 21:56:13,951 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:13,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:13,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:14,086 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:14,088 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:14,092 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:14,095 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:14,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:14,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:14,119 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:56:14,184 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:14,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:14,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:14,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:14,221 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:14,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:14,244 INFO L518 ElimStorePlain]: Eliminatee v_prenex_408 vanished before elimination [2021-03-10 21:56:14,244 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:14,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:14,245 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:21 [2021-03-10 21:56:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:14,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:14,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 21:56:14,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180073303] [2021-03-10 21:56:14,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 21:56:14,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 21:56:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:56:14,312 INFO L87 Difference]: Start difference. First operand 396 states and 1233 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 21:56:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:14,666 INFO L93 Difference]: Finished difference Result 555 states and 1698 transitions. [2021-03-10 21:56:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 21 [2021-03-10 21:56:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:14,669 INFO L225 Difference]: With dead ends: 555 [2021-03-10 21:56:14,669 INFO L226 Difference]: Without dead ends: 526 [2021-03-10 21:56:14,669 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 319.1ms TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:56:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-03-10 21:56:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 396. [2021-03-10 21:56:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1215189873417724) internal successors, (1233), 395 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1233 transitions. [2021-03-10 21:56:14,675 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1233 transitions. Word has length 21 [2021-03-10 21:56:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:14,675 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 1233 transitions. [2021-03-10 21:56:14,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 21:56:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1233 transitions. [2021-03-10 21:56:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:14,675 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:14,675 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:14,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 230 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2633 [2021-03-10 21:56:14,876 INFO L428 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1442259693, now seen corresponding path program 230 times [2021-03-10 21:56:14,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:14,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133500372] [2021-03-10 21:56:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:15,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133500372] [2021-03-10 21:56:15,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863867902] [2021-03-10 21:56:15,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:15,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:56:15,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:15,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:15,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:15,232 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:15,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:15,238 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:15,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:15,264 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:15,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:15,265 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:56:15,329 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:15,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:15,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:15,360 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:15,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:15,365 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:15,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:15,388 INFO L518 ElimStorePlain]: Eliminatee v_prenex_410 vanished before elimination [2021-03-10 21:56:15,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:15,389 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:19 [2021-03-10 21:56:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:15,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:15,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:56:15,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047256309] [2021-03-10 21:56:15,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:56:15,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:56:15,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:56:15,531 INFO L87 Difference]: Start difference. First operand 396 states and 1233 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:16,007 INFO L93 Difference]: Finished difference Result 553 states and 1688 transitions. [2021-03-10 21:56:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:16,010 INFO L225 Difference]: With dead ends: 553 [2021-03-10 21:56:16,010 INFO L226 Difference]: Without dead ends: 530 [2021-03-10 21:56:16,010 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 395.9ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:56:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-03-10 21:56:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 396. [2021-03-10 21:56:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1215189873417724) internal successors, (1233), 395 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1233 transitions. [2021-03-10 21:56:16,016 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1233 transitions. Word has length 21 [2021-03-10 21:56:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:16,016 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 1233 transitions. [2021-03-10 21:56:16,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1233 transitions. [2021-03-10 21:56:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:16,017 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:16,017 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:16,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2639 [2021-03-10 21:56:16,231 INFO L428 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1564112981, now seen corresponding path program 231 times [2021-03-10 21:56:16,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:16,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386025451] [2021-03-10 21:56:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:16,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386025451] [2021-03-10 21:56:16,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248271172] [2021-03-10 21:56:16,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:16,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:56:16,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:16,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:16,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:16,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:16,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:16,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:16,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:16,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:16,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:16,816 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:16,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:16,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:56:16,901 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:56:17,231 INFO L388 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 11 treesize of output 9 [2021-03-10 21:56:17,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:17,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:17,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:17,247 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:17,393 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-03-10 21:56:17,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:17,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:17,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:17,401 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:17,545 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-03-10 21:56:17,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:17,553 INFO L388 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 11 treesize of output 9 [2021-03-10 21:56:17,556 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:17,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:17,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:17,564 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:17,711 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-03-10 21:56:17,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:17,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:17,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:17,720 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:17,867 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-03-10 21:56:17,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:17,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:56:17,871 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:181, output treesize:69 [2021-03-10 21:56:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:18,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:18,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:18,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834586306] [2021-03-10 21:56:18,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:18,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:18,214 INFO L87 Difference]: Start difference. First operand 396 states and 1233 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:18,483 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2021-03-10 21:56:18,690 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2021-03-10 21:56:19,462 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 21:56:19,652 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 21:56:19,863 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 21:56:20,057 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2021-03-10 21:56:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:20,137 INFO L93 Difference]: Finished difference Result 728 states and 2175 transitions. [2021-03-10 21:56:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 21:56:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:20,139 INFO L225 Difference]: With dead ends: 728 [2021-03-10 21:56:20,139 INFO L226 Difference]: Without dead ends: 680 [2021-03-10 21:56:20,139 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1816.6ms TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-03-10 21:56:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-03-10 21:56:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 391. [2021-03-10 21:56:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 3.094871794871795) internal successors, (1207), 390 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1207 transitions. [2021-03-10 21:56:20,146 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1207 transitions. Word has length 21 [2021-03-10 21:56:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 1207 transitions. [2021-03-10 21:56:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1207 transitions. [2021-03-10 21:56:20,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:20,147 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:20,147 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:20,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2647,232 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:20,369 INFO L428 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -343138925, now seen corresponding path program 232 times [2021-03-10 21:56:20,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:20,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167641349] [2021-03-10 21:56:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:20,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167641349] [2021-03-10 21:56:20,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338911051] [2021-03-10 21:56:20,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:20,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:56:20,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:20,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:20,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:20,829 INFO L446 ElimStorePlain]: Different costs {0=[o_4], 1=[v_prenex_415]} [2021-03-10 21:56:20,834 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:20,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:20,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:20,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:20,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:20,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:20,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:20,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:56:20,918 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2021-03-10 21:56:21,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:21,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:21,082 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:21,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:21,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:21,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:56:21,110 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:21,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:21,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:56:21,128 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2021-03-10 21:56:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:21,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:21,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:56:21,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382892388] [2021-03-10 21:56:21,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:56:21,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:56:21,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:56:21,173 INFO L87 Difference]: Start difference. First operand 391 states and 1207 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:21,587 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 21:56:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:21,878 INFO L93 Difference]: Finished difference Result 522 states and 1585 transitions. [2021-03-10 21:56:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:21,881 INFO L225 Difference]: With dead ends: 522 [2021-03-10 21:56:21,881 INFO L226 Difference]: Without dead ends: 500 [2021-03-10 21:56:21,881 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 635.2ms TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:56:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-03-10 21:56:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 393. [2021-03-10 21:56:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.0918367346938775) internal successors, (1212), 392 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1212 transitions. [2021-03-10 21:56:21,887 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1212 transitions. Word has length 21 [2021-03-10 21:56:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:21,888 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 1212 transitions. [2021-03-10 21:56:21,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1212 transitions. [2021-03-10 21:56:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:21,888 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:21,889 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:22,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2667 [2021-03-10 21:56:22,092 INFO L428 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1706818721, now seen corresponding path program 233 times [2021-03-10 21:56:22,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:22,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977676782] [2021-03-10 21:56:22,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:22,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977676782] [2021-03-10 21:56:22,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768173454] [2021-03-10 21:56:22,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:22,359 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:56:22,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:22,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:22,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:22,489 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:22,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:22,495 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:22,498 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:22,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:22,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:22,524 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:56:22,603 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:22,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:22,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:22,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:22,641 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:22,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:22,666 INFO L518 ElimStorePlain]: Eliminatee v_prenex_417 vanished before elimination [2021-03-10 21:56:22,666 INFO L518 ElimStorePlain]: Eliminatee o_2 vanished before elimination [2021-03-10 21:56:22,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:22,667 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:21 [2021-03-10 21:56:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:22,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:22,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 21:56:22,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453257604] [2021-03-10 21:56:22,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 21:56:22,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 21:56:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:56:22,737 INFO L87 Difference]: Start difference. First operand 393 states and 1212 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 21:56:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:23,273 INFO L93 Difference]: Finished difference Result 537 states and 1634 transitions. [2021-03-10 21:56:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 21 [2021-03-10 21:56:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:23,276 INFO L225 Difference]: With dead ends: 537 [2021-03-10 21:56:23,276 INFO L226 Difference]: Without dead ends: 508 [2021-03-10 21:56:23,276 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 410.9ms TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:56:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-03-10 21:56:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 393. [2021-03-10 21:56:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.0918367346938775) internal successors, (1212), 392 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1212 transitions. [2021-03-10 21:56:23,281 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1212 transitions. Word has length 21 [2021-03-10 21:56:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:23,281 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 1212 transitions. [2021-03-10 21:56:23,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 21:56:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1212 transitions. [2021-03-10 21:56:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:23,282 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:23,282 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:23,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 234 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2672 [2021-03-10 21:56:23,482 INFO L428 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2004085131, now seen corresponding path program 234 times [2021-03-10 21:56:23,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:23,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524203176] [2021-03-10 21:56:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:23,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524203176] [2021-03-10 21:56:23,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985912812] [2021-03-10 21:56:23,770 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:23,793 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:56:23,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:23,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:23,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:23,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:23,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:23,925 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:23,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:23,946 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:56:23,947 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2021-03-10 21:56:24,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:24,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:24,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:24,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:24,069 INFO L388 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 11 treesize of output 9 [2021-03-10 21:56:24,072 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:24,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:24,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:24,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:24,125 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:24,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:24,170 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:24,170 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:19 [2021-03-10 21:56:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:24,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:24,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:24,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910644225] [2021-03-10 21:56:24,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:24,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:24,367 INFO L87 Difference]: Start difference. First operand 393 states and 1212 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:26,309 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2021-03-10 21:56:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:26,635 INFO L93 Difference]: Finished difference Result 733 states and 2196 transitions. [2021-03-10 21:56:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-03-10 21:56:26,636 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:26,638 INFO L225 Difference]: With dead ends: 733 [2021-03-10 21:56:26,638 INFO L226 Difference]: Without dead ends: 710 [2021-03-10 21:56:26,638 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1636.5ms TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2021-03-10 21:56:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-03-10 21:56:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 394. [2021-03-10 21:56:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 3.099236641221374) internal successors, (1218), 393 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1218 transitions. [2021-03-10 21:56:26,644 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1218 transitions. Word has length 21 [2021-03-10 21:56:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:26,644 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 1218 transitions. [2021-03-10 21:56:26,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1218 transitions. [2021-03-10 21:56:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:26,645 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:26,645 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:26,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 235 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2678 [2021-03-10 21:56:26,845 INFO L428 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1719822447, now seen corresponding path program 235 times [2021-03-10 21:56:26,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:26,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768169181] [2021-03-10 21:56:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:27,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768169181] [2021-03-10 21:56:27,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188215798] [2021-03-10 21:56:27,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:27,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:27,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:27,462 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_419, o_4], 1=[v_prenex_420, v_prenex_421]} [2021-03-10 21:56:27,468 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:27,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:27,606 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-10 21:56:27,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:27,612 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:27,615 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:27,738 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:56:27,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:27,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:27,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:27,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:27,867 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:56:27,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:27,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:27,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:27,877 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:27,999 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:56:27,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:28,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:56:28,005 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:157, output treesize:119 [2021-03-10 21:56:28,264 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-03-10 21:56:28,336 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:56:28,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:28,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:28,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:28,347 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:28,353 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:28,356 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:28,362 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:28,365 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:28,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:28,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:28,374 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:28,502 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-03-10 21:56:28,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:28,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:28,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:28,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:28,513 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:28,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:28,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:28,522 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:28,644 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 21:56:28,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:28,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:56:28,648 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:165, output treesize:63 [2021-03-10 21:56:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:28,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:28,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:28,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111679744] [2021-03-10 21:56:28,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:28,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:28,965 INFO L87 Difference]: Start difference. First operand 394 states and 1218 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:29,229 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2021-03-10 21:56:29,877 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2021-03-10 21:56:30,130 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2021-03-10 21:56:30,600 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2021-03-10 21:56:30,813 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2021-03-10 21:56:31,127 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-03-10 21:56:31,387 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-03-10 21:56:31,774 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2021-03-10 21:56:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:31,780 INFO L93 Difference]: Finished difference Result 722 states and 2176 transitions. [2021-03-10 21:56:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-10 21:56:31,782 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:31,783 INFO L225 Difference]: With dead ends: 722 [2021-03-10 21:56:31,783 INFO L226 Difference]: Without dead ends: 674 [2021-03-10 21:56:31,783 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2732.2ms TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2021-03-10 21:56:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-03-10 21:56:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 405. [2021-03-10 21:56:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.103960396039604) internal successors, (1254), 404 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1254 transitions. [2021-03-10 21:56:31,789 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1254 transitions. Word has length 21 [2021-03-10 21:56:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:31,789 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 1254 transitions. [2021-03-10 21:56:31,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1254 transitions. [2021-03-10 21:56:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:31,790 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:31,790 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:31,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2687,236 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:31,991 INFO L428 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -499455059, now seen corresponding path program 236 times [2021-03-10 21:56:31,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:31,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674944690] [2021-03-10 21:56:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:32,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674944690] [2021-03-10 21:56:32,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626349452] [2021-03-10 21:56:32,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:32,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:56:32,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:32,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:56:32,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:32,676 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_425], 1=[v_prenex_426, v_prenex_428]} [2021-03-10 21:56:32,683 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:32,686 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:32,822 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-10 21:56:32,823 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:32,829 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:32,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:32,962 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:56:32,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:32,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:32,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:32,972 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:33,098 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:56:33,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:33,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:33,108 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:33,234 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:56:33,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:33,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:56:33,240 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:157, output treesize:119 [2021-03-10 21:56:33,510 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-03-10 21:56:33,659 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:56:33,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:33,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:33,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:33,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:33,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:33,685 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:33,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:33,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:33,692 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:34,058 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-03-10 21:56:34,059 INFO L628 ElimStorePlain]: treesize reduction 11, result has 94.1 percent of original size [2021-03-10 21:56:34,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:34,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:34,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:34,068 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:34,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:34,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:34,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:34,078 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:34,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:34,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:34,087 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:34,258 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-03-10 21:56:34,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:34,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:56:34,262 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:213, output treesize:78 [2021-03-10 21:56:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:34,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:34,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:34,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045433792] [2021-03-10 21:56:34,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:34,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:34,600 INFO L87 Difference]: Start difference. First operand 405 states and 1254 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:34,811 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2021-03-10 21:56:35,382 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2021-03-10 21:56:35,610 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2021-03-10 21:56:35,913 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 21:56:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:36,070 INFO L93 Difference]: Finished difference Result 626 states and 1878 transitions. [2021-03-10 21:56:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:56:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:36,073 INFO L225 Difference]: With dead ends: 626 [2021-03-10 21:56:36,073 INFO L226 Difference]: Without dead ends: 584 [2021-03-10 21:56:36,073 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1751.9ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:56:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-03-10 21:56:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 396. [2021-03-10 21:56:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1063291139240508) internal successors, (1227), 395 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1227 transitions. [2021-03-10 21:56:36,079 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1227 transitions. Word has length 21 [2021-03-10 21:56:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:36,079 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 1227 transitions. [2021-03-10 21:56:36,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1227 transitions. [2021-03-10 21:56:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:36,080 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:36,080 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:36,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 237 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2700 [2021-03-10 21:56:36,280 INFO L428 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash -957233069, now seen corresponding path program 237 times [2021-03-10 21:56:36,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:36,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771774985] [2021-03-10 21:56:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:36,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771774985] [2021-03-10 21:56:36,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416262299] [2021-03-10 21:56:36,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:56:36,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:56:36,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:36,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:36,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:36,578 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:36,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:36,586 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:36,589 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:36,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:36,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:36,611 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:56:36,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:36,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:36,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:36,700 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:36,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:56:36,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 21:56:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:36,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:36,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:56:36,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072373497] [2021-03-10 21:56:36,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:56:36,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:56:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:56:36,734 INFO L87 Difference]: Start difference. First operand 396 states and 1227 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:37,088 INFO L93 Difference]: Finished difference Result 664 states and 1998 transitions. [2021-03-10 21:56:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:56:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:37,091 INFO L225 Difference]: With dead ends: 664 [2021-03-10 21:56:37,091 INFO L226 Difference]: Without dead ends: 642 [2021-03-10 21:56:37,091 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 253.0ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:56:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-03-10 21:56:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 404. [2021-03-10 21:56:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 3.1141439205955335) internal successors, (1255), 403 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1255 transitions. [2021-03-10 21:56:37,096 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1255 transitions. Word has length 21 [2021-03-10 21:56:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:37,097 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 1255 transitions. [2021-03-10 21:56:37,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1255 transitions. [2021-03-10 21:56:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:37,097 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:37,097 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:37,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2711,238 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:37,298 INFO L428 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1247945405, now seen corresponding path program 238 times [2021-03-10 21:56:37,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:37,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175941147] [2021-03-10 21:56:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:37,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175941147] [2021-03-10 21:56:37,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319525824] [2021-03-10 21:56:37,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:37,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:56:37,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:37,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:37,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:37,602 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:37,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:37,610 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:37,613 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:37,617 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:37,620 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:37,624 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:37,627 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:37,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:37,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:56:37,693 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:57 [2021-03-10 21:56:37,990 INFO L388 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 26 treesize of output 20 [2021-03-10 21:56:37,993 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:37,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:38,000 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:38,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:38,025 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:38,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:38,026 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 21:56:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:38,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:38,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:56:38,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744957441] [2021-03-10 21:56:38,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:56:38,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:56:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:56:38,154 INFO L87 Difference]: Start difference. First operand 404 states and 1255 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:39,721 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 21:56:39,920 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2021-03-10 21:56:40,138 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2021-03-10 21:56:40,610 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2021-03-10 21:56:40,883 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-03-10 21:56:41,117 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2021-03-10 21:56:41,463 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2021-03-10 21:56:41,661 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2021-03-10 21:56:41,908 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2021-03-10 21:56:42,161 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2021-03-10 21:56:42,383 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-03-10 21:56:42,691 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2021-03-10 21:56:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:42,740 INFO L93 Difference]: Finished difference Result 1133 states and 3393 transitions. [2021-03-10 21:56:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-03-10 21:56:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:42,745 INFO L225 Difference]: With dead ends: 1133 [2021-03-10 21:56:42,745 INFO L226 Difference]: Without dead ends: 1076 [2021-03-10 21:56:42,745 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 3798.3ms TimeCoverageRelationStatistics Valid=378, Invalid=1692, Unknown=0, NotChecked=0, Total=2070 [2021-03-10 21:56:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2021-03-10 21:56:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 410. [2021-03-10 21:56:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.1246943765281174) internal successors, (1278), 409 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1278 transitions. [2021-03-10 21:56:42,752 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1278 transitions. Word has length 21 [2021-03-10 21:56:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:42,752 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 1278 transitions. [2021-03-10 21:56:42,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1278 transitions. [2021-03-10 21:56:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:42,753 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:42,753 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:42,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2714,239 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:42,955 INFO L428 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2090256769, now seen corresponding path program 239 times [2021-03-10 21:56:42,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:42,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053896188] [2021-03-10 21:56:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:43,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053896188] [2021-03-10 21:56:43,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151141224] [2021-03-10 21:56:43,138 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:43,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:56:43,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:43,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:43,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:43,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:43,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:43,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:43,226 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:43,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:43,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:43,274 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:56:43,565 INFO L388 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 21 treesize of output 17 [2021-03-10 21:56:43,568 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:43,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:43,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:43,581 INFO L388 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 28 treesize of output 22 [2021-03-10 21:56:43,583 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:43,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:56:43,588 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:43,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:43,609 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:43,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:56:43,610 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:16 [2021-03-10 21:56:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:43,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:43,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:56:43,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907991174] [2021-03-10 21:56:43,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:56:43,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:43,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:56:43,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:56:43,732 INFO L87 Difference]: Start difference. First operand 410 states and 1278 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:44,091 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-03-10 21:56:44,279 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2021-03-10 21:56:44,446 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-03-10 21:56:44,819 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2021-03-10 21:56:44,997 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 21:56:45,337 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 21:56:45,514 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 21:56:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:45,635 INFO L93 Difference]: Finished difference Result 734 states and 2219 transitions. [2021-03-10 21:56:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:56:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:45,638 INFO L225 Difference]: With dead ends: 734 [2021-03-10 21:56:45,638 INFO L226 Difference]: Without dead ends: 668 [2021-03-10 21:56:45,638 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1752.5ms TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-03-10 21:56:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-03-10 21:56:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 411. [2021-03-10 21:56:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.1170731707317074) internal successors, (1278), 410 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1278 transitions. [2021-03-10 21:56:45,644 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1278 transitions. Word has length 21 [2021-03-10 21:56:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:45,644 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1278 transitions. [2021-03-10 21:56:45,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1278 transitions. [2021-03-10 21:56:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:45,645 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:45,645 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:45,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2724 [2021-03-10 21:56:45,845 INFO L428 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash -694754787, now seen corresponding path program 240 times [2021-03-10 21:56:45,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:45,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107608436] [2021-03-10 21:56:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:46,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107608436] [2021-03-10 21:56:46,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559399746] [2021-03-10 21:56:46,109 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 21:56:46,141 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:56:46,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:46,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:46,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:46,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:46,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:46,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:46,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:46,289 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:46,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:46,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:46,340 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:56:46,340 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:27 [2021-03-10 21:56:46,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:46,587 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:46,594 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:46,594 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:46,596 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:56:46,596 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2021-03-10 21:56:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:46,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:46,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:56:46,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154536055] [2021-03-10 21:56:46,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:56:46,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:56:46,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:56:46,682 INFO L87 Difference]: Start difference. First operand 411 states and 1278 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:47,714 INFO L93 Difference]: Finished difference Result 790 states and 2395 transitions. [2021-03-10 21:56:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:56:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:47,717 INFO L225 Difference]: With dead ends: 790 [2021-03-10 21:56:47,717 INFO L226 Difference]: Without dead ends: 771 [2021-03-10 21:56:47,717 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 748.2ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:56:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-03-10 21:56:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 416. [2021-03-10 21:56:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 3.1204819277108435) internal successors, (1295), 415 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1295 transitions. [2021-03-10 21:56:47,724 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1295 transitions. Word has length 21 [2021-03-10 21:56:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:47,724 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 1295 transitions. [2021-03-10 21:56:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1295 transitions. [2021-03-10 21:56:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:47,725 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:47,725 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:47,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2731,241 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:47,925 INFO L428 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash 991637053, now seen corresponding path program 241 times [2021-03-10 21:56:47,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:47,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428385068] [2021-03-10 21:56:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:48,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428385068] [2021-03-10 21:56:48,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363777642] [2021-03-10 21:56:48,154 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:48,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:48,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:48,303 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:48,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:48,311 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:48,314 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:48,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:48,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:48,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:48,324 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:48,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:48,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:56:48,333 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:48,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:48,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:56:48,435 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:73 [2021-03-10 21:56:48,907 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4, v_prenex_433, v_prenex_435], 1=[v_prenex_434, v_prenex_436]} [2021-03-10 21:56:48,913 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:48,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:48,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:48,975 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:48,980 INFO L388 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 26 treesize of output 20 [2021-03-10 21:56:48,982 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:49,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:49,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:49,068 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:49,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:49,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:49,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:56:49,145 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:49,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:49,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:56:49,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:56:49,209 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:49,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:49,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:56:49,262 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:81, output treesize:26 [2021-03-10 21:56:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:49,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:49,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:56:49,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377442491] [2021-03-10 21:56:49,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:56:49,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:56:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:56:49,479 INFO L87 Difference]: Start difference. First operand 416 states and 1295 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:50,942 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2021-03-10 21:56:51,242 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2021-03-10 21:56:52,070 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2021-03-10 21:56:52,973 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2021-03-10 21:56:53,309 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2021-03-10 21:56:53,961 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2021-03-10 21:56:54,320 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2021-03-10 21:56:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:54,535 INFO L93 Difference]: Finished difference Result 1163 states and 3527 transitions. [2021-03-10 21:56:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-03-10 21:56:54,537 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:54,539 INFO L225 Difference]: With dead ends: 1163 [2021-03-10 21:56:54,539 INFO L226 Difference]: Without dead ends: 1117 [2021-03-10 21:56:54,540 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 4328.9ms TimeCoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2021-03-10 21:56:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-03-10 21:56:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 430. [2021-03-10 21:56:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.1585081585081585) internal successors, (1355), 429 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1355 transitions. [2021-03-10 21:56:54,546 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1355 transitions. Word has length 21 [2021-03-10 21:56:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:54,547 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1355 transitions. [2021-03-10 21:56:54,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1355 transitions. [2021-03-10 21:56:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:54,547 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:54,547 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:54,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 242 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2741 [2021-03-10 21:56:54,748 INFO L428 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1655597913, now seen corresponding path program 242 times [2021-03-10 21:56:54,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:54,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451940884] [2021-03-10 21:56:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:54,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451940884] [2021-03-10 21:56:54,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092371837] [2021-03-10 21:56:54,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:54,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:56:54,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:54,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:54,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:55,049 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:55,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:55,055 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:55,058 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:55,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:55,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:55,076 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:56:55,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:55,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:55,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:55,155 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:55,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:55,187 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:55,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:55,188 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:29 [2021-03-10 21:56:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:55,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:55,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 21:56:55,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606042131] [2021-03-10 21:56:55,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 21:56:55,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 21:56:55,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-03-10 21:56:55,306 INFO L87 Difference]: Start difference. First operand 430 states and 1355 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:56,006 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2021-03-10 21:56:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:56,056 INFO L93 Difference]: Finished difference Result 697 states and 2147 transitions. [2021-03-10 21:56:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:56:56,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:56,059 INFO L225 Difference]: With dead ends: 697 [2021-03-10 21:56:56,059 INFO L226 Difference]: Without dead ends: 675 [2021-03-10 21:56:56,059 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 580.9ms TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:56:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-03-10 21:56:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 433. [2021-03-10 21:56:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 3.1550925925925926) internal successors, (1363), 432 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1363 transitions. [2021-03-10 21:56:56,065 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1363 transitions. Word has length 21 [2021-03-10 21:56:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:56,065 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 1363 transitions. [2021-03-10 21:56:56,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1363 transitions. [2021-03-10 21:56:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:56,066 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:56,066 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:56,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2757 [2021-03-10 21:56:56,266 INFO L428 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash -758616445, now seen corresponding path program 243 times [2021-03-10 21:56:56,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:56,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229511132] [2021-03-10 21:56:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:56,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229511132] [2021-03-10 21:56:56,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163689609] [2021-03-10 21:56:56,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:56,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:56:56,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:56,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:56:56,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:56,534 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:56,536 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:56,540 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:56,543 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:56,560 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:56,562 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:56,562 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:56:56,626 INFO L388 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 9 treesize of output 7 [2021-03-10 21:56:56,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:56,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:56,635 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:56,652 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:56,652 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:56,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:56,654 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 21:56:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:56,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:56,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:56:56,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531100483] [2021-03-10 21:56:56,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:56:56,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:56:56,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:56:56,707 INFO L87 Difference]: Start difference. First operand 433 states and 1363 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:57,130 INFO L93 Difference]: Finished difference Result 700 states and 2149 transitions. [2021-03-10 21:56:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:56:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:56:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:57,134 INFO L225 Difference]: With dead ends: 700 [2021-03-10 21:56:57,134 INFO L226 Difference]: Without dead ends: 671 [2021-03-10 21:56:57,134 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 306.4ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:56:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-03-10 21:56:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 424. [2021-03-10 21:56:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 3.1465721040189125) internal successors, (1331), 423 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1331 transitions. [2021-03-10 21:56:57,139 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1331 transitions. Word has length 21 [2021-03-10 21:56:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:57,140 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 1331 transitions. [2021-03-10 21:56:57,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1331 transitions. [2021-03-10 21:56:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:57,141 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:57,141 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:56:57,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 244 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2763 [2021-03-10 21:56:57,347 INFO L428 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:56:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:56:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -132745653, now seen corresponding path program 244 times [2021-03-10 21:56:57,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:56:57,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263993279] [2021-03-10 21:56:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:56:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:56:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:57,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263993279] [2021-03-10 21:56:57,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274094438] [2021-03-10 21:56:57,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:56:57,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:56:57,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:56:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:56:57,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:56:57,646 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:57,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:57,652 INFO L388 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 17 treesize of output 13 [2021-03-10 21:56:57,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:57,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:57,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:57,692 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-03-10 21:56:57,896 INFO L388 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 26 treesize of output 20 [2021-03-10 21:56:57,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:57,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:56:57,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:56:57,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:56:57,930 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:56:57,931 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:56:57,931 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 21:56:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:56:58,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:56:58,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:56:58,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656642932] [2021-03-10 21:56:58,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:56:58,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:56:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:56:58,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:56:58,063 INFO L87 Difference]: Start difference. First operand 424 states and 1331 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:58,675 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2021-03-10 21:56:58,837 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2021-03-10 21:56:59,032 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 21:56:59,424 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2021-03-10 21:56:59,621 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2021-03-10 21:56:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:56:59,787 INFO L93 Difference]: Finished difference Result 828 states and 2498 transitions. [2021-03-10 21:56:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:56:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:56:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:56:59,792 INFO L225 Difference]: With dead ends: 828 [2021-03-10 21:56:59,792 INFO L226 Difference]: Without dead ends: 790 [2021-03-10 21:56:59,792 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1411.0ms TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2021-03-10 21:56:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-03-10 21:56:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 421. [2021-03-10 21:56:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.130952380952381) internal successors, (1315), 420 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1315 transitions. [2021-03-10 21:56:59,801 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1315 transitions. Word has length 21 [2021-03-10 21:56:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:56:59,801 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 1315 transitions. [2021-03-10 21:56:59,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:56:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1315 transitions. [2021-03-10 21:56:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:56:59,802 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:56:59,803 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:00,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2768 [2021-03-10 21:57:00,008 INFO L428 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1814881967, now seen corresponding path program 245 times [2021-03-10 21:57:00,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:00,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874210442] [2021-03-10 21:57:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:00,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874210442] [2021-03-10 21:57:00,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716015625] [2021-03-10 21:57:00,234 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:00,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:57:00,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:00,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:00,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:00,357 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:00,360 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:00,364 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:00,367 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:00,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:00,425 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:00,425 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:57:00,608 INFO L388 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 26 treesize of output 20 [2021-03-10 21:57:00,611 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:00,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:00,619 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:00,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:00,647 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:00,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:00,648 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 21:57:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:00,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:00,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:57:00,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109245003] [2021-03-10 21:57:00,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:57:00,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:00,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:57:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:00,793 INFO L87 Difference]: Start difference. First operand 421 states and 1315 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:01,314 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 21:57:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:01,513 INFO L93 Difference]: Finished difference Result 570 states and 1742 transitions. [2021-03-10 21:57:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:57:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:01,516 INFO L225 Difference]: With dead ends: 570 [2021-03-10 21:57:01,516 INFO L226 Difference]: Without dead ends: 551 [2021-03-10 21:57:01,516 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 587.6ms TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:57:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-03-10 21:57:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 426. [2021-03-10 21:57:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.1341176470588237) internal successors, (1332), 425 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1332 transitions. [2021-03-10 21:57:01,521 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1332 transitions. Word has length 21 [2021-03-10 21:57:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:01,521 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 1332 transitions. [2021-03-10 21:57:01,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1332 transitions. [2021-03-10 21:57:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:01,522 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:01,522 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:01,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2776,246 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:01,722 INFO L428 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2080299789, now seen corresponding path program 246 times [2021-03-10 21:57:01,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:01,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279617250] [2021-03-10 21:57:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:01,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279617250] [2021-03-10 21:57:01,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314833569] [2021-03-10 21:57:01,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:01,973 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:57:01,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:01,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:01,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:02,071 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:02,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:02,079 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:02,082 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:02,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:02,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:02,138 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:57:02,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:02,245 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:02,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:02,300 INFO L518 ElimStorePlain]: Eliminatee v_prenex_438 vanished before elimination [2021-03-10 21:57:02,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:02,319 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:02,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:02,368 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:02,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:02,370 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:31 [2021-03-10 21:57:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:02,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:02,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:57:02,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211561421] [2021-03-10 21:57:02,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:57:02,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:02,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:57:02,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:02,592 INFO L87 Difference]: Start difference. First operand 426 states and 1332 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:03,188 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 21:57:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:03,289 INFO L93 Difference]: Finished difference Result 578 states and 1762 transitions. [2021-03-10 21:57:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:57:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:03,292 INFO L225 Difference]: With dead ends: 578 [2021-03-10 21:57:03,292 INFO L226 Difference]: Without dead ends: 559 [2021-03-10 21:57:03,292 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 602.9ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:57:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-03-10 21:57:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 425. [2021-03-10 21:57:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.1297169811320753) internal successors, (1327), 424 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1327 transitions. [2021-03-10 21:57:03,297 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1327 transitions. Word has length 21 [2021-03-10 21:57:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:03,298 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 1327 transitions. [2021-03-10 21:57:03,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1327 transitions. [2021-03-10 21:57:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:03,298 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:03,298 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:03,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 247 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2786 [2021-03-10 21:57:03,499 INFO L428 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash 65870971, now seen corresponding path program 247 times [2021-03-10 21:57:03,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:03,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026577503] [2021-03-10 21:57:03,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:03,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026577503] [2021-03-10 21:57:03,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224785139] [2021-03-10 21:57:03,736 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:03,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:03,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:03,855 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:03,858 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:03,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:03,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:57:03,871 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-03-10 21:57:03,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:03,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:03,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:03,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:03,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:03,976 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:03,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:03,977 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 21:57:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:04,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:04,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:57:04,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731652319] [2021-03-10 21:57:04,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:57:04,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:57:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:04,194 INFO L87 Difference]: Start difference. First operand 425 states and 1327 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:04,780 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 21:57:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:04,854 INFO L93 Difference]: Finished difference Result 550 states and 1686 transitions. [2021-03-10 21:57:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:57:04,856 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:04,857 INFO L225 Difference]: With dead ends: 550 [2021-03-10 21:57:04,857 INFO L226 Difference]: Without dead ends: 531 [2021-03-10 21:57:04,857 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 559.6ms TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:57:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-03-10 21:57:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 422. [2021-03-10 21:57:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.142517814726841) internal successors, (1323), 421 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1323 transitions. [2021-03-10 21:57:04,862 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1323 transitions. Word has length 21 [2021-03-10 21:57:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:04,862 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 1323 transitions. [2021-03-10 21:57:04,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1323 transitions. [2021-03-10 21:57:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:04,863 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:04,863 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:05,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 248 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2793 [2021-03-10 21:57:05,063 INFO L428 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1174020435, now seen corresponding path program 248 times [2021-03-10 21:57:05,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:05,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929811825] [2021-03-10 21:57:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:05,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929811825] [2021-03-10 21:57:05,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903391273] [2021-03-10 21:57:05,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:05,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:57:05,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:05,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:05,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:05,369 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:05,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:05,376 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:05,379 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:05,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:05,399 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:05,399 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:57:05,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:05,464 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:05,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:05,470 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:05,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:05,503 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:05,505 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:05,505 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:29 [2021-03-10 21:57:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:05,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:05,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:57:05,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599678631] [2021-03-10 21:57:05,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:57:05,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:57:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:57:05,627 INFO L87 Difference]: Start difference. First operand 422 states and 1323 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:06,256 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-03-10 21:57:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:06,309 INFO L93 Difference]: Finished difference Result 545 states and 1678 transitions. [2021-03-10 21:57:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:57:06,310 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:06,311 INFO L225 Difference]: With dead ends: 545 [2021-03-10 21:57:06,311 INFO L226 Difference]: Without dead ends: 523 [2021-03-10 21:57:06,311 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 460.7ms TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:57:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-03-10 21:57:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 429. [2021-03-10 21:57:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.1448598130841123) internal successors, (1346), 428 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1346 transitions. [2021-03-10 21:57:06,319 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1346 transitions. Word has length 21 [2021-03-10 21:57:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:06,319 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 1346 transitions. [2021-03-10 21:57:06,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1346 transitions. [2021-03-10 21:57:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:06,320 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:06,320 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:06,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 249 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2798 [2021-03-10 21:57:06,523 INFO L428 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1598092345, now seen corresponding path program 249 times [2021-03-10 21:57:06,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:06,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426515535] [2021-03-10 21:57:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:06,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426515535] [2021-03-10 21:57:06,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371215628] [2021-03-10 21:57:06,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:06,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:57:06,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:06,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:06,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:06,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:06,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:06,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:06,824 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:06,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:06,867 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:06,867 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:57:07,027 INFO L388 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 21 treesize of output 17 [2021-03-10 21:57:07,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:07,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:07,037 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:07,041 INFO L388 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 28 treesize of output 22 [2021-03-10 21:57:07,044 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:07,046 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:57:07,048 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:07,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:07,068 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:07,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:57:07,070 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:16 [2021-03-10 21:57:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:07,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:07,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:57:07,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081047401] [2021-03-10 21:57:07,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:57:07,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:57:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:57:07,183 INFO L87 Difference]: Start difference. First operand 429 states and 1346 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:57:07,609 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-03-10 21:57:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:07,931 INFO L93 Difference]: Finished difference Result 554 states and 1704 transitions. [2021-03-10 21:57:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:57:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 21 [2021-03-10 21:57:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:07,934 INFO L225 Difference]: With dead ends: 554 [2021-03-10 21:57:07,934 INFO L226 Difference]: Without dead ends: 521 [2021-03-10 21:57:07,934 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 522.2ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-03-10 21:57:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 429. [2021-03-10 21:57:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.1378504672897196) internal successors, (1343), 428 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1343 transitions. [2021-03-10 21:57:07,945 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1343 transitions. Word has length 21 [2021-03-10 21:57:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:07,945 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 1343 transitions. [2021-03-10 21:57:07,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:57:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1343 transitions. [2021-03-10 21:57:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:07,946 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:07,946 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:08,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2803 [2021-03-10 21:57:08,146 INFO L428 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1240193923, now seen corresponding path program 250 times [2021-03-10 21:57:08,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:08,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208207104] [2021-03-10 21:57:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:08,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208207104] [2021-03-10 21:57:08,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127613272] [2021-03-10 21:57:08,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:08,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:57:08,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:08,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:57:08,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:08,448 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:08,450 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:08,454 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:08,458 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:08,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:08,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:08,479 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:57:08,509 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:08,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:08,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:08,518 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:08,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:08,535 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:08,537 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:08,537 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 21:57:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:08,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:08,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 21:57:08,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149228601] [2021-03-10 21:57:08,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 21:57:08,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 21:57:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-10 21:57:08,591 INFO L87 Difference]: Start difference. First operand 429 states and 1343 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:09,007 INFO L93 Difference]: Finished difference Result 581 states and 1795 transitions. [2021-03-10 21:57:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:57:09,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 21:57:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:09,009 INFO L225 Difference]: With dead ends: 581 [2021-03-10 21:57:09,009 INFO L226 Difference]: Without dead ends: 552 [2021-03-10 21:57:09,009 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 246.7ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-03-10 21:57:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-03-10 21:57:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 429. [2021-03-10 21:57:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.1378504672897196) internal successors, (1343), 428 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1343 transitions. [2021-03-10 21:57:09,014 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1343 transitions. Word has length 21 [2021-03-10 21:57:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:09,014 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 1343 transitions. [2021-03-10 21:57:09,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1343 transitions. [2021-03-10 21:57:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:09,014 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:09,014 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:09,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 251 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2809 [2021-03-10 21:57:09,215 INFO L428 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1960074455, now seen corresponding path program 251 times [2021-03-10 21:57:09,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:09,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680070817] [2021-03-10 21:57:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:09,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680070817] [2021-03-10 21:57:09,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868179373] [2021-03-10 21:57:09,416 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:09,439 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:57:09,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:09,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:09,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:09,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:09,542 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:09,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:09,549 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:09,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:09,595 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:09,595 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 21:57:09,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:09,706 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:09,710 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:09,713 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:09,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:09,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:09,793 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:09,797 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:09,799 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:09,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:09,862 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:09,862 INFO L518 ElimStorePlain]: Eliminatee v_prenex_440 vanished before elimination [2021-03-10 21:57:09,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:09,863 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:45 [2021-03-10 21:57:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:10,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:10,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:57:10,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663991932] [2021-03-10 21:57:10,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:57:10,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:57:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:57:10,094 INFO L87 Difference]: Start difference. First operand 429 states and 1343 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:57:10,727 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:57:11,101 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:57:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:11,234 INFO L93 Difference]: Finished difference Result 549 states and 1698 transitions. [2021-03-10 21:57:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:57:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 21 [2021-03-10 21:57:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:11,237 INFO L225 Difference]: With dead ends: 549 [2021-03-10 21:57:11,237 INFO L226 Difference]: Without dead ends: 522 [2021-03-10 21:57:11,237 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 868.2ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:57:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-03-10 21:57:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 426. [2021-03-10 21:57:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.1411764705882352) internal successors, (1335), 425 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1335 transitions. [2021-03-10 21:57:11,242 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1335 transitions. Word has length 21 [2021-03-10 21:57:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:11,242 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 1335 transitions. [2021-03-10 21:57:11,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:57:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1335 transitions. [2021-03-10 21:57:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:11,243 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:11,243 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:11,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2813 [2021-03-10 21:57:11,443 INFO L428 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash 866590197, now seen corresponding path program 252 times [2021-03-10 21:57:11,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:11,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142253749] [2021-03-10 21:57:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:11,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142253749] [2021-03-10 21:57:11,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266393324] [2021-03-10 21:57:11,640 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:11,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:57:11,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:11,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:11,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:11,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:11,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:11,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:11,757 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:11,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:11,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:11,805 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:45 [2021-03-10 21:57:11,913 INFO L388 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 10 treesize of output 8 [2021-03-10 21:57:11,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:11,921 INFO L388 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 18 treesize of output 14 [2021-03-10 21:57:11,923 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:11,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:11,999 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:12,004 INFO L388 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 10 treesize of output 8 [2021-03-10 21:57:12,007 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:12,011 INFO L388 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 18 treesize of output 14 [2021-03-10 21:57:12,013 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:12,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:12,076 INFO L518 ElimStorePlain]: Eliminatee v_prenex_442 vanished before elimination [2021-03-10 21:57:12,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:12,077 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:49 [2021-03-10 21:57:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:12,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:12,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:57:12,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470847673] [2021-03-10 21:57:12,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:57:12,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:57:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:12,321 INFO L87 Difference]: Start difference. First operand 426 states and 1335 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:13,068 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-03-10 21:57:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:13,115 INFO L93 Difference]: Finished difference Result 587 states and 1785 transitions. [2021-03-10 21:57:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:57:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:13,118 INFO L225 Difference]: With dead ends: 587 [2021-03-10 21:57:13,118 INFO L226 Difference]: Without dead ends: 529 [2021-03-10 21:57:13,119 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 710.9ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-03-10 21:57:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 429. [2021-03-10 21:57:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.142523364485981) internal successors, (1345), 428 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1345 transitions. [2021-03-10 21:57:13,124 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1345 transitions. Word has length 21 [2021-03-10 21:57:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:13,124 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 1345 transitions. [2021-03-10 21:57:13,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1345 transitions. [2021-03-10 21:57:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:13,124 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:13,125 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:13,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 253 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2821 [2021-03-10 21:57:13,325 INFO L428 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -228108721, now seen corresponding path program 253 times [2021-03-10 21:57:13,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:13,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221944666] [2021-03-10 21:57:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:13,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221944666] [2021-03-10 21:57:13,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701727836] [2021-03-10 21:57:13,529 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:13,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:13,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:13,662 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:13,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:13,669 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:13,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:13,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:13,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:13,693 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 21:57:13,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:13,760 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:13,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:13,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:13,840 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:13,840 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:13,845 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:13,848 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:13,851 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:13,854 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:13,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:13,916 INFO L518 ElimStorePlain]: Eliminatee v_prenex_444 vanished before elimination [2021-03-10 21:57:13,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:13,918 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:45 [2021-03-10 21:57:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:14,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:14,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:57:14,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540638246] [2021-03-10 21:57:14,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:57:14,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:57:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:57:14,147 INFO L87 Difference]: Start difference. First operand 429 states and 1345 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:57:14,745 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:57:15,050 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:57:15,390 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2021-03-10 21:57:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:15,394 INFO L93 Difference]: Finished difference Result 600 states and 1835 transitions. [2021-03-10 21:57:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:57:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 21 [2021-03-10 21:57:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:15,397 INFO L225 Difference]: With dead ends: 600 [2021-03-10 21:57:15,397 INFO L226 Difference]: Without dead ends: 573 [2021-03-10 21:57:15,397 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1031.9ms TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:57:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-03-10 21:57:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 445. [2021-03-10 21:57:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.144144144144144) internal successors, (1396), 444 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1396 transitions. [2021-03-10 21:57:15,403 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1396 transitions. Word has length 21 [2021-03-10 21:57:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:15,403 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1396 transitions. [2021-03-10 21:57:15,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 21:57:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1396 transitions. [2021-03-10 21:57:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:15,404 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:15,404 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:15,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2829,254 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:15,604 INFO L428 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1652644217, now seen corresponding path program 254 times [2021-03-10 21:57:15,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:15,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837155031] [2021-03-10 21:57:15,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:15,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837155031] [2021-03-10 21:57:15,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538911395] [2021-03-10 21:57:15,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:15,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:57:15,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:15,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:57:15,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:16,176 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:16,178 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,183 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:16,187 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,190 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:57:16,192 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,197 INFO L388 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 24 treesize of output 18 [2021-03-10 21:57:16,200 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:16,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:57:16,248 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:51 [2021-03-10 21:57:16,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:57:16,444 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:16,455 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:57:16,466 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:16,475 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,608 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2021-03-10 21:57:16,609 INFO L628 ElimStorePlain]: treesize reduction 88, result has 35.8 percent of original size [2021-03-10 21:57:16,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:16,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:16,616 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:16,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:16,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:16,671 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:161, output treesize:25 [2021-03-10 21:57:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:16,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:16,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:57:16,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043372470] [2021-03-10 21:57:16,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:57:16,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:16,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:57:16,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:16,835 INFO L87 Difference]: Start difference. First operand 445 states and 1396 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:17,146 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2021-03-10 21:57:17,407 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 21:57:17,819 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2021-03-10 21:57:18,190 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2021-03-10 21:57:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:18,383 INFO L93 Difference]: Finished difference Result 550 states and 1682 transitions. [2021-03-10 21:57:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:57:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:18,386 INFO L225 Difference]: With dead ends: 550 [2021-03-10 21:57:18,386 INFO L226 Difference]: Without dead ends: 529 [2021-03-10 21:57:18,386 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1655.2ms TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-03-10 21:57:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-03-10 21:57:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 438. [2021-03-10 21:57:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.148741418764302) internal successors, (1376), 437 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1376 transitions. [2021-03-10 21:57:18,391 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1376 transitions. Word has length 21 [2021-03-10 21:57:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:18,391 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1376 transitions. [2021-03-10 21:57:18,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1376 transitions. [2021-03-10 21:57:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:18,392 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:18,392 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:18,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2836,255 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:18,592 INFO L428 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:18,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1434637307, now seen corresponding path program 255 times [2021-03-10 21:57:18,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:18,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251376054] [2021-03-10 21:57:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:18,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251376054] [2021-03-10 21:57:18,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716102330] [2021-03-10 21:57:18,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:18,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:57:18,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:57:18,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:18,964 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:18,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:18,971 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:18,973 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:18,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:19,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:19,001 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:57:19,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:19,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:19,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:19,161 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:19,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:57:19,162 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 21:57:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:19,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:19,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:57:19,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937136601] [2021-03-10 21:57:19,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:57:19,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:57:19,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:19,192 INFO L87 Difference]: Start difference. First operand 438 states and 1376 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:19,687 INFO L93 Difference]: Finished difference Result 578 states and 1775 transitions. [2021-03-10 21:57:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:57:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:19,690 INFO L225 Difference]: With dead ends: 578 [2021-03-10 21:57:19,690 INFO L226 Difference]: Without dead ends: 556 [2021-03-10 21:57:19,690 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 358.4ms TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-03-10 21:57:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 445. [2021-03-10 21:57:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.1621621621621623) internal successors, (1404), 444 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1404 transitions. [2021-03-10 21:57:19,696 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1404 transitions. Word has length 21 [2021-03-10 21:57:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:19,696 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1404 transitions. [2021-03-10 21:57:19,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1404 transitions. [2021-03-10 21:57:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:19,696 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:19,696 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:19,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2844,256 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:19,897 INFO L428 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:19,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:19,897 INFO L82 PathProgramCache]: Analyzing trace with hash 932845971, now seen corresponding path program 256 times [2021-03-10 21:57:19,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:19,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453244474] [2021-03-10 21:57:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:20,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453244474] [2021-03-10 21:57:20,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689555848] [2021-03-10 21:57:20,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:20,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:57:20,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:20,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:57:20,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:20,275 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:20,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:20,282 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:20,285 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:20,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:20,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:20,313 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:57:20,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:20,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:20,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:20,435 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:20,436 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:57:20,436 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2021-03-10 21:57:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:20,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:20,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:57:20,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210245251] [2021-03-10 21:57:20,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:57:20,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:57:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:57:20,486 INFO L87 Difference]: Start difference. First operand 445 states and 1404 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:21,018 INFO L93 Difference]: Finished difference Result 569 states and 1751 transitions. [2021-03-10 21:57:21,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:57:21,020 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:21,021 INFO L225 Difference]: With dead ends: 569 [2021-03-10 21:57:21,021 INFO L226 Difference]: Without dead ends: 547 [2021-03-10 21:57:21,022 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 345.0ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:57:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-03-10 21:57:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2021-03-10 21:57:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.1564625850340136) internal successors, (1392), 441 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1392 transitions. [2021-03-10 21:57:21,027 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1392 transitions. Word has length 21 [2021-03-10 21:57:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:21,027 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 1392 transitions. [2021-03-10 21:57:21,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1392 transitions. [2021-03-10 21:57:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:21,028 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:21,028 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:21,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2847 [2021-03-10 21:57:21,231 INFO L428 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2059961425, now seen corresponding path program 257 times [2021-03-10 21:57:21,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:21,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879874867] [2021-03-10 21:57:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:21,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879874867] [2021-03-10 21:57:21,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876081129] [2021-03-10 21:57:21,536 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:21,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:57:21,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:21,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:21,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:21,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:21,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:21,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:21,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:21,829 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:21,833 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:21,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:21,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:21,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:21,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:21,849 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:21,852 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:21,981 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 21:57:21,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:21,990 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:57:21,990 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:91 [2021-03-10 21:57:22,167 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:57:22,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:22,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:57:22,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:23,007 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:23,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:23,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:57:23,017 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:23,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:23,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:23,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:23,078 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:23,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:23,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:23,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:23,135 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:23,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:23,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:23,186 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:21 [2021-03-10 21:57:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:23,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:23,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:57:23,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147189642] [2021-03-10 21:57:23,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:57:23,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:57:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:23,332 INFO L87 Difference]: Start difference. First operand 442 states and 1392 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:24,112 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2021-03-10 21:57:24,338 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-03-10 21:57:24,683 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-03-10 21:57:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:25,027 INFO L93 Difference]: Finished difference Result 625 states and 1920 transitions. [2021-03-10 21:57:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:57:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:25,030 INFO L225 Difference]: With dead ends: 625 [2021-03-10 21:57:25,030 INFO L226 Difference]: Without dead ends: 606 [2021-03-10 21:57:25,030 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1774.9ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:57:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-03-10 21:57:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 447. [2021-03-10 21:57:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.1681614349775784) internal successors, (1413), 446 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1413 transitions. [2021-03-10 21:57:25,036 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1413 transitions. Word has length 21 [2021-03-10 21:57:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:25,036 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 1413 transitions. [2021-03-10 21:57:25,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1413 transitions. [2021-03-10 21:57:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:25,036 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:25,036 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:25,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 258 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2850 [2021-03-10 21:57:25,237 INFO L428 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1837752813, now seen corresponding path program 258 times [2021-03-10 21:57:25,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:25,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928027060] [2021-03-10 21:57:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:25,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928027060] [2021-03-10 21:57:25,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663502427] [2021-03-10 21:57:25,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:25,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:57:25,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:25,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:57:25,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:25,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:25,791 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:25,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:25,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:25,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:25,812 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:25,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:25,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:25,821 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:26,013 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:57:26,013 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:26,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2021-03-10 21:57:26,030 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:205, output treesize:177 [2021-03-10 21:57:26,225 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-10 21:57:26,897 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:57:28,307 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 48 [2021-03-10 21:57:28,904 INFO L446 ElimStorePlain]: Different costs {0=[o_2, v_prenex_480, v_prenex_481, o_4, v_prenex_483, v_prenex_484, v_prenex_486, v_prenex_487], 1=[v_prenex_503, v_prenex_490, v_prenex_492, v_prenex_493, v_prenex_497, v_prenex_498, v_prenex_489, v_prenex_502]} [2021-03-10 21:57:28,915 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:28,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:29,351 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2021-03-10 21:57:29,352 INFO L628 ElimStorePlain]: treesize reduction 63, result has 79.8 percent of original size [2021-03-10 21:57:29,361 INFO L388 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 21 treesize of output 17 [2021-03-10 21:57:29,365 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:29,567 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-10 21:57:29,568 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:29,568 INFO L518 ElimStorePlain]: Eliminatee v_prenex_481 vanished before elimination [2021-03-10 21:57:29,568 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:29,577 INFO L388 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 39 treesize of output 31 [2021-03-10 21:57:29,580 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:29,764 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-10 21:57:29,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:29,765 INFO L518 ElimStorePlain]: Eliminatee v_prenex_484 vanished before elimination [2021-03-10 21:57:29,773 INFO L388 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 21 treesize of output 17 [2021-03-10 21:57:29,777 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:29,949 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-10 21:57:29,950 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:29,950 INFO L518 ElimStorePlain]: Eliminatee v_prenex_487 vanished before elimination [2021-03-10 21:57:29,950 INFO L518 ElimStorePlain]: Eliminatee v_prenex_503 vanished before elimination [2021-03-10 21:57:29,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:29,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:29,962 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:30,300 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2021-03-10 21:57:30,301 INFO L628 ElimStorePlain]: treesize reduction 11, result has 93.3 percent of original size [2021-03-10 21:57:30,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:30,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 21:57:30,313 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:30,476 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-10 21:57:30,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:30,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:30,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:57:30,488 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:30,644 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:57:30,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:30,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:30,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 21:57:30,656 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:30,807 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:57:30,808 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:30,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:30,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:57:30,819 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:30,985 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-03-10 21:57:30,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:30,987 INFO L518 ElimStorePlain]: Eliminatee v_prenex_489 vanished before elimination [2021-03-10 21:57:30,987 INFO L518 ElimStorePlain]: Eliminatee v_prenex_502 vanished before elimination [2021-03-10 21:57:30,995 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 16 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-03-10 21:57:30,996 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 32 variables, input treesize:323, output treesize:47 [2021-03-10 21:57:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:31,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:31,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:57:31,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504730599] [2021-03-10 21:57:31,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:57:31,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:57:31,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:31,178 INFO L87 Difference]: Start difference. First operand 447 states and 1413 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:32,211 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2021-03-10 21:57:33,155 WARN L205 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 96 [2021-03-10 21:57:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:33,623 INFO L93 Difference]: Finished difference Result 593 states and 1821 transitions. [2021-03-10 21:57:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:57:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:33,626 INFO L225 Difference]: With dead ends: 593 [2021-03-10 21:57:33,626 INFO L226 Difference]: Without dead ends: 554 [2021-03-10 21:57:33,627 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2649.8ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:57:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-03-10 21:57:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 449. [2021-03-10 21:57:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.158482142857143) internal successors, (1415), 448 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1415 transitions. [2021-03-10 21:57:33,635 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1415 transitions. Word has length 21 [2021-03-10 21:57:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:33,635 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 1415 transitions. [2021-03-10 21:57:33,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1415 transitions. [2021-03-10 21:57:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:33,636 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:33,636 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:33,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2880,259 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:33,851 INFO L428 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -832876715, now seen corresponding path program 259 times [2021-03-10 21:57:33,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:33,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771245208] [2021-03-10 21:57:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:34,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771245208] [2021-03-10 21:57:34,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541194586] [2021-03-10 21:57:34,105 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:34,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:34,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:34,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:34,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:34,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:34,243 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:34,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:34,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:34,303 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:57:34,497 INFO L388 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 21 treesize of output 17 [2021-03-10 21:57:34,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:34,506 INFO L388 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 28 treesize of output 22 [2021-03-10 21:57:34,509 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:34,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:34,517 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:34,520 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 21:57:34,522 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:34,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:34,558 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:34,560 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:57:34,560 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:101, output treesize:26 [2021-03-10 21:57:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:34,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:34,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:57:34,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565142268] [2021-03-10 21:57:34,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:57:34,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:57:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:57:34,796 INFO L87 Difference]: Start difference. First operand 449 states and 1415 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:35,609 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-03-10 21:57:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:36,072 INFO L93 Difference]: Finished difference Result 639 states and 1972 transitions. [2021-03-10 21:57:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:57:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:36,075 INFO L225 Difference]: With dead ends: 639 [2021-03-10 21:57:36,075 INFO L226 Difference]: Without dead ends: 612 [2021-03-10 21:57:36,075 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1049.1ms TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:57:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-03-10 21:57:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 447. [2021-03-10 21:57:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.1614349775784754) internal successors, (1410), 446 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1410 transitions. [2021-03-10 21:57:36,081 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1410 transitions. Word has length 21 [2021-03-10 21:57:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 1410 transitions. [2021-03-10 21:57:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1410 transitions. [2021-03-10 21:57:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:36,081 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:36,082 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:36,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2988,260 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:36,282 INFO L428 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1748224883, now seen corresponding path program 260 times [2021-03-10 21:57:36,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:36,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227835623] [2021-03-10 21:57:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:36,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227835623] [2021-03-10 21:57:36,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242770661] [2021-03-10 21:57:36,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:36,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:57:36,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:36,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:57:36,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:36,938 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:36,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:36,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:36,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:36,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:36,953 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:36,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:36,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:36,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:36,964 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:36,970 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:36,974 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:37,111 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 21:57:37,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:37,121 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:57:37,121 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:91 [2021-03-10 21:57:37,297 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:57:37,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:37,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:37,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:37,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:37,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:37,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:37,661 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:37,879 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-03-10 21:57:37,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:37,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:37,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:37,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:37,891 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:37,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:37,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:37,900 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:38,327 WARN L205 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-03-10 21:57:38,328 INFO L628 ElimStorePlain]: treesize reduction 11, result has 93.0 percent of original size [2021-03-10 21:57:38,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:38,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:38,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:38,338 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:38,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:38,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:38,346 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:38,522 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:57:38,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:38,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:38,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:38,532 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:38,701 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-03-10 21:57:38,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:38,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:38,704 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:185, output treesize:78 [2021-03-10 21:57:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:39,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:39,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:57:39,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973358454] [2021-03-10 21:57:39,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:57:39,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:39,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:57:39,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:39,088 INFO L87 Difference]: Start difference. First operand 447 states and 1410 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:40,326 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2021-03-10 21:57:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:40,498 INFO L93 Difference]: Finished difference Result 751 states and 2282 transitions. [2021-03-10 21:57:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:57:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:40,501 INFO L225 Difference]: With dead ends: 751 [2021-03-10 21:57:40,501 INFO L226 Difference]: Without dead ends: 713 [2021-03-10 21:57:40,502 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1403.2ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:57:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-03-10 21:57:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 455. [2021-03-10 21:57:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.185022026431718) internal successors, (1446), 454 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1446 transitions. [2021-03-10 21:57:40,508 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1446 transitions. Word has length 21 [2021-03-10 21:57:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:40,508 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1446 transitions. [2021-03-10 21:57:40,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1446 transitions. [2021-03-10 21:57:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:40,508 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:40,508 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:40,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2997 [2021-03-10 21:57:40,709 INFO L428 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 19262995, now seen corresponding path program 261 times [2021-03-10 21:57:40,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:40,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789623677] [2021-03-10 21:57:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:40,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789623677] [2021-03-10 21:57:40,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201879339] [2021-03-10 21:57:40,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:40,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:57:40,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:40,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:57:40,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:41,107 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:41,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:41,113 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:41,117 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:41,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:41,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:41,146 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:57:41,306 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:41,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:41,344 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:41,344 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:41,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:41,352 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:41,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:41,374 INFO L518 ElimStorePlain]: Eliminatee v_prenex_510 vanished before elimination [2021-03-10 21:57:41,375 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:41,375 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:15 [2021-03-10 21:57:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:41,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:41,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:57:41,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321996577] [2021-03-10 21:57:41,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:57:41,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:57:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:41,469 INFO L87 Difference]: Start difference. First operand 455 states and 1446 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:41,982 INFO L93 Difference]: Finished difference Result 623 states and 1936 transitions. [2021-03-10 21:57:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:57:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:41,985 INFO L225 Difference]: With dead ends: 623 [2021-03-10 21:57:41,985 INFO L226 Difference]: Without dead ends: 594 [2021-03-10 21:57:41,985 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 412.0ms TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-03-10 21:57:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 455. [2021-03-10 21:57:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.185022026431718) internal successors, (1446), 454 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1446 transitions. [2021-03-10 21:57:41,991 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1446 transitions. Word has length 21 [2021-03-10 21:57:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:41,991 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1446 transitions. [2021-03-10 21:57:41,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1446 transitions. [2021-03-10 21:57:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:41,991 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:41,991 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:42,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3008,262 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:42,192 INFO L428 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1075435923, now seen corresponding path program 262 times [2021-03-10 21:57:42,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:42,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31117615] [2021-03-10 21:57:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:42,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31117615] [2021-03-10 21:57:42,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321946376] [2021-03-10 21:57:42,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:42,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:57:42,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:42,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:42,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:42,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:42,583 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:42,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:42,591 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:42,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:42,657 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:42,657 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:57:42,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:42,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:42,922 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:42,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:43,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:43,011 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:43,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:43,019 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:43,024 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:43,027 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:43,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:43,091 INFO L518 ElimStorePlain]: Eliminatee v_prenex_512 vanished before elimination [2021-03-10 21:57:43,092 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:43,093 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:45 [2021-03-10 21:57:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:43,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:43,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:57:43,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259864605] [2021-03-10 21:57:43,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:57:43,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:57:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:57:43,303 INFO L87 Difference]: Start difference. First operand 455 states and 1446 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:43,879 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:57:44,247 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:57:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:44,368 INFO L93 Difference]: Finished difference Result 590 states and 1828 transitions. [2021-03-10 21:57:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:57:44,370 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:44,371 INFO L225 Difference]: With dead ends: 590 [2021-03-10 21:57:44,371 INFO L226 Difference]: Without dead ends: 563 [2021-03-10 21:57:44,371 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1037.2ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-03-10 21:57:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-03-10 21:57:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 452. [2021-03-10 21:57:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.188470066518847) internal successors, (1438), 451 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1438 transitions. [2021-03-10 21:57:44,377 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1438 transitions. Word has length 21 [2021-03-10 21:57:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:44,377 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1438 transitions. [2021-03-10 21:57:44,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1438 transitions. [2021-03-10 21:57:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:44,378 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:44,378 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:44,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3016,263 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:44,578 INFO L428 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1699721687, now seen corresponding path program 263 times [2021-03-10 21:57:44,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:44,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325336651] [2021-03-10 21:57:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:44,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325336651] [2021-03-10 21:57:44,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98569650] [2021-03-10 21:57:44,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:44,851 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:57:44,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:44,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:57:44,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:44,974 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:44,977 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:44,982 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:44,985 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:45,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:45,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:45,016 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 21:57:45,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:45,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:45,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:45,139 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:45,143 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:45,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:45,175 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:45,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_513 vanished before elimination [2021-03-10 21:57:45,176 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:45,176 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:21 [2021-03-10 21:57:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:45,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:45,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:57:45,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662510418] [2021-03-10 21:57:45,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:57:45,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:57:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:57:45,301 INFO L87 Difference]: Start difference. First operand 452 states and 1438 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:45,812 INFO L93 Difference]: Finished difference Result 620 states and 1928 transitions. [2021-03-10 21:57:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:57:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:45,815 INFO L225 Difference]: With dead ends: 620 [2021-03-10 21:57:45,815 INFO L226 Difference]: Without dead ends: 591 [2021-03-10 21:57:45,815 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 387.1ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:57:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-03-10 21:57:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 453. [2021-03-10 21:57:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.1946902654867255) internal successors, (1444), 452 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1444 transitions. [2021-03-10 21:57:45,821 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1444 transitions. Word has length 21 [2021-03-10 21:57:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:45,821 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 1444 transitions. [2021-03-10 21:57:45,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1444 transitions. [2021-03-10 21:57:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:45,822 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:45,822 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:46,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3027 [2021-03-10 21:57:46,022 INFO L428 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1686717961, now seen corresponding path program 264 times [2021-03-10 21:57:46,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:46,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667242299] [2021-03-10 21:57:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:46,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667242299] [2021-03-10 21:57:46,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077948451] [2021-03-10 21:57:46,325 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:46,347 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:57:46,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:46,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:46,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:46,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:46,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:46,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:46,482 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:46,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:46,545 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:46,545 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-03-10 21:57:46,673 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:46,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:46,897 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2021-03-10 21:57:46,898 INFO L628 ElimStorePlain]: treesize reduction 2, result has 98.0 percent of original size [2021-03-10 21:57:46,898 INFO L518 ElimStorePlain]: Eliminatee v_prenex_516 vanished before elimination [2021-03-10 21:57:46,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:46,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:47,007 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-03-10 21:57:47,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:47,013 INFO L388 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 11 treesize of output 9 [2021-03-10 21:57:47,016 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:47,216 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2021-03-10 21:57:47,216 INFO L628 ElimStorePlain]: treesize reduction 2, result has 97.3 percent of original size [2021-03-10 21:57:47,217 INFO L518 ElimStorePlain]: Eliminatee v_prenex_518 vanished before elimination [2021-03-10 21:57:47,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:47,224 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:47,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:47,312 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:47,312 INFO L518 ElimStorePlain]: Eliminatee v_prenex_520 vanished before elimination [2021-03-10 21:57:47,313 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:47,314 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:113, output treesize:57 [2021-03-10 21:57:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:47,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:47,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:57:47,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698276978] [2021-03-10 21:57:47,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:57:47,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:57:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:57:47,709 INFO L87 Difference]: Start difference. First operand 453 states and 1444 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:47,946 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-03-10 21:57:48,791 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 21:57:49,028 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 21:57:49,366 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-03-10 21:57:49,631 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 21:57:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:49,745 INFO L93 Difference]: Finished difference Result 687 states and 2117 transitions. [2021-03-10 21:57:49,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:57:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:49,747 INFO L225 Difference]: With dead ends: 687 [2021-03-10 21:57:49,747 INFO L226 Difference]: Without dead ends: 639 [2021-03-10 21:57:49,747 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1912.8ms TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-03-10 21:57:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-03-10 21:57:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 452. [2021-03-10 21:57:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.188470066518847) internal successors, (1438), 451 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1438 transitions. [2021-03-10 21:57:49,753 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1438 transitions. Word has length 21 [2021-03-10 21:57:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:49,753 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1438 transitions. [2021-03-10 21:57:49,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1438 transitions. [2021-03-10 21:57:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:49,753 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:49,754 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:49,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 265 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3032 [2021-03-10 21:57:49,954 INFO L428 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1184139011, now seen corresponding path program 265 times [2021-03-10 21:57:49,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:49,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799309554] [2021-03-10 21:57:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:50,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799309554] [2021-03-10 21:57:50,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280170825] [2021-03-10 21:57:50,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:50,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:50,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:50,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:50,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:50,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:50,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:50,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:50,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:50,589 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:50,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:50,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:57:50,674 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:65 [2021-03-10 21:57:51,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:51,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:51,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:51,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:51,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:51,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:51,517 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:51,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:51,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:51,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:57:51,578 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:51,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:51,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:51,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:57:51,634 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:51,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:51,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:51,685 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:21 [2021-03-10 21:57:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:51,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:51,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:57:51,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754790942] [2021-03-10 21:57:51,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:57:51,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:57:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:51,831 INFO L87 Difference]: Start difference. First operand 452 states and 1438 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:52,725 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-03-10 21:57:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:52,988 INFO L93 Difference]: Finished difference Result 707 states and 2194 transitions. [2021-03-10 21:57:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 21:57:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:52,990 INFO L225 Difference]: With dead ends: 707 [2021-03-10 21:57:52,991 INFO L226 Difference]: Without dead ends: 688 [2021-03-10 21:57:52,991 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1211.9ms TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:57:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-03-10 21:57:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 453. [2021-03-10 21:57:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.183628318584071) internal successors, (1439), 452 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1439 transitions. [2021-03-10 21:57:52,996 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1439 transitions. Word has length 21 [2021-03-10 21:57:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:52,996 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 1439 transitions. [2021-03-10 21:57:52,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1439 transitions. [2021-03-10 21:57:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:52,997 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:52,997 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:53,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3044 [2021-03-10 21:57:53,198 INFO L428 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash -849497469, now seen corresponding path program 266 times [2021-03-10 21:57:53,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:53,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574104099] [2021-03-10 21:57:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:53,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574104099] [2021-03-10 21:57:53,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241499032] [2021-03-10 21:57:53,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:53,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:57:53,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:53,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:53,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:53,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:53,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:53,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:53,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:53,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-03-10 21:57:53,835 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2021-03-10 21:57:53,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:53,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:53,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:53,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:53,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:53,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:53,995 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:54,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:54,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:54,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:54,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:54,090 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:54,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:54,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:54,098 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:54,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:54,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:54,178 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:31 [2021-03-10 21:57:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:54,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:54,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:57:54,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694652481] [2021-03-10 21:57:54,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:57:54,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:54,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:57:54,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:57:54,418 INFO L87 Difference]: Start difference. First operand 453 states and 1439 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:55,472 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-03-10 21:57:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:55,534 INFO L93 Difference]: Finished difference Result 700 states and 2163 transitions. [2021-03-10 21:57:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:57:55,536 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:55,537 INFO L225 Difference]: With dead ends: 700 [2021-03-10 21:57:55,537 INFO L226 Difference]: Without dead ends: 681 [2021-03-10 21:57:55,537 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 929.0ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:57:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2021-03-10 21:57:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 452. [2021-03-10 21:57:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.17960088691796) internal successors, (1434), 451 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1434 transitions. [2021-03-10 21:57:55,543 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1434 transitions. Word has length 21 [2021-03-10 21:57:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:55,543 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1434 transitions. [2021-03-10 21:57:55,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1434 transitions. [2021-03-10 21:57:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:55,544 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:55,544 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:55,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 267 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3066 [2021-03-10 21:57:55,744 INFO L428 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:55,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash -231235301, now seen corresponding path program 267 times [2021-03-10 21:57:55,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:55,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686090835] [2021-03-10 21:57:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:56,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686090835] [2021-03-10 21:57:56,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094189685] [2021-03-10 21:57:56,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:56,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:57:56,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:56,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:56,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:56,212 INFO L388 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 17 treesize of output 13 [2021-03-10 21:57:56,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:56,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:56,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:57:56,226 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 21:57:56,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:56,274 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:56,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:56,281 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:56,323 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:56,323 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:56,325 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:56,325 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 21:57:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:56,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:56,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 21:57:56,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815542582] [2021-03-10 21:57:56,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 21:57:56,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 21:57:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 21:57:56,529 INFO L87 Difference]: Start difference. First operand 452 states and 1434 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:57,058 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 21:57:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:57,149 INFO L93 Difference]: Finished difference Result 608 states and 1883 transitions. [2021-03-10 21:57:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:57:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:57,151 INFO L225 Difference]: With dead ends: 608 [2021-03-10 21:57:57,151 INFO L226 Difference]: Without dead ends: 589 [2021-03-10 21:57:57,152 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 668.8ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:57:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-03-10 21:57:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 448. [2021-03-10 21:57:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.1812080536912752) internal successors, (1422), 447 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1422 transitions. [2021-03-10 21:57:57,157 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1422 transitions. Word has length 21 [2021-03-10 21:57:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:57,157 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1422 transitions. [2021-03-10 21:57:57,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1422 transitions. [2021-03-10 21:57:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:57,157 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:57,157 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:57,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 268 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3074 [2021-03-10 21:57:57,358 INFO L428 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash -851099215, now seen corresponding path program 268 times [2021-03-10 21:57:57,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:57,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141874699] [2021-03-10 21:57:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:57,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141874699] [2021-03-10 21:57:57,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590140568] [2021-03-10 21:57:57,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:57,580 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:57:57,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:57,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:57:57,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:57,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:57,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:57,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:57,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:57:57,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-03-10 21:57:57,757 INFO L388 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 18 treesize of output 14 [2021-03-10 21:57:57,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:57,766 INFO L388 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 10 treesize of output 8 [2021-03-10 21:57:57,770 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:57,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:57,800 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:57:57,801 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:57:57,801 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2021-03-10 21:57:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:57,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:57:57,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 21:57:57,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79110411] [2021-03-10 21:57:57,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 21:57:57,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:57:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 21:57:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 21:57:57,917 INFO L87 Difference]: Start difference. First operand 448 states and 1422 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:57:58,545 INFO L93 Difference]: Finished difference Result 580 states and 1799 transitions. [2021-03-10 21:57:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:57:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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 21 [2021-03-10 21:57:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:57:58,548 INFO L225 Difference]: With dead ends: 580 [2021-03-10 21:57:58,548 INFO L226 Difference]: Without dead ends: 551 [2021-03-10 21:57:58,548 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 336.1ms TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:57:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-03-10 21:57:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 446. [2021-03-10 21:57:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.1842696629213485) internal successors, (1417), 445 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1417 transitions. [2021-03-10 21:57:58,553 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1417 transitions. Word has length 21 [2021-03-10 21:57:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:57:58,553 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 1417 transitions. [2021-03-10 21:57:58,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:57:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1417 transitions. [2021-03-10 21:57:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:57:58,554 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:57:58,554 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:57:58,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3080 [2021-03-10 21:57:58,754 INFO L428 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:57:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:57:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -553832805, now seen corresponding path program 269 times [2021-03-10 21:57:58,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:57:58,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538774243] [2021-03-10 21:57:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:57:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:57:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:57:59,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538774243] [2021-03-10 21:57:59,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814170934] [2021-03-10 21:57:59,051 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:57:59,073 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:57:59,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:57:59,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:57:59,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:57:59,356 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[v_prenex_535]} [2021-03-10 21:57:59,362 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:59,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:59,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:57:59,422 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:59,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:57:59,472 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2021-03-10 21:57:59,599 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:59,602 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:59,614 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,619 INFO L388 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 9 treesize of output 7 [2021-03-10 21:57:59,623 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:57:59,631 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,773 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 21:57:59,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:59,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:59,783 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:57:59,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:57:59,791 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:57:59,923 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 21:57:59,924 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:57:59,927 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:57:59,927 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:143, output treesize:57 [2021-03-10 21:58:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:00,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:00,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:00,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951868548] [2021-03-10 21:58:00,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:00,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:00,320 INFO L87 Difference]: Start difference. First operand 446 states and 1417 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:00,732 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 21:58:01,073 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 21:58:01,226 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2021-03-10 21:58:01,481 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 21:58:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:01,674 INFO L93 Difference]: Finished difference Result 675 states and 2075 transitions. [2021-03-10 21:58:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:58:01,676 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:01,677 INFO L225 Difference]: With dead ends: 675 [2021-03-10 21:58:01,677 INFO L226 Difference]: Without dead ends: 652 [2021-03-10 21:58:01,678 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1506.6ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:58:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-03-10 21:58:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 452. [2021-03-10 21:58:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.1929046563192904) internal successors, (1440), 451 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1440 transitions. [2021-03-10 21:58:01,683 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1440 transitions. Word has length 21 [2021-03-10 21:58:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:01,683 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1440 transitions. [2021-03-10 21:58:01,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1440 transitions. [2021-03-10 21:58:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:01,684 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:01,684 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:01,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3083,270 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:01,884 INFO L428 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -838095489, now seen corresponding path program 270 times [2021-03-10 21:58:01,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:01,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654265273] [2021-03-10 21:58:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:02,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654265273] [2021-03-10 21:58:02,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135281376] [2021-03-10 21:58:02,142 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:02,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:58:02,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:02,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:58:02,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:02,558 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:02,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:02,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:02,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:02,570 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:02,707 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 21:58:02,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:02,714 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:02,717 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:02,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:02,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:02,727 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:02,857 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 21:58:02,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:02,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:58:02,863 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:95 [2021-03-10 21:58:03,026 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:58:03,098 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_0]} [2021-03-10 21:58:03,105 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:03,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:03,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:03,135 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,142 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:03,145 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:03,157 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,164 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:03,167 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:03,178 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,185 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:03,188 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,883 WARN L205 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-03-10 21:58:03,884 INFO L628 ElimStorePlain]: treesize reduction 11, result has 96.0 percent of original size [2021-03-10 21:58:03,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:03,894 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:03,904 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:03,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:03,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:03,913 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:04,214 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:58:04,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:04,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2021-03-10 21:58:04,218 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:341, output treesize:150 [2021-03-10 21:58:04,601 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2021-03-10 21:58:04,810 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2021-03-10 21:58:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:04,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:04,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:04,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101729913] [2021-03-10 21:58:04,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:04,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:04,979 INFO L87 Difference]: Start difference. First operand 452 states and 1440 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:05,629 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-03-10 21:58:06,046 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-03-10 21:58:06,442 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2021-03-10 21:58:06,816 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2021-03-10 21:58:07,170 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 21:58:07,653 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2021-03-10 21:58:07,839 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2021-03-10 21:58:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:07,840 INFO L93 Difference]: Finished difference Result 813 states and 2457 transitions. [2021-03-10 21:58:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:58:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:07,842 INFO L225 Difference]: With dead ends: 813 [2021-03-10 21:58:07,842 INFO L226 Difference]: Without dead ends: 738 [2021-03-10 21:58:07,842 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3273.3ms TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2021-03-10 21:58:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-03-10 21:58:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 469. [2021-03-10 21:58:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.213675213675214) internal successors, (1504), 468 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1504 transitions. [2021-03-10 21:58:07,848 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1504 transitions. Word has length 21 [2021-03-10 21:58:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:07,848 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 1504 transitions. [2021-03-10 21:58:07,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1504 transitions. [2021-03-10 21:58:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:07,848 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:07,848 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:08,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 271 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3093 [2021-03-10 21:58:08,049 INFO L428 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1496124841, now seen corresponding path program 271 times [2021-03-10 21:58:08,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:08,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4480691] [2021-03-10 21:58:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:08,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4480691] [2021-03-10 21:58:08,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414906288] [2021-03-10 21:58:08,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:08,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:08,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:08,594 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[v_prenex_538]} [2021-03-10 21:58:08,600 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:08,603 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:08,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:08,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:08,658 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:08,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:08,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:08,703 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:39 [2021-03-10 21:58:08,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:08,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:08,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:08,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:08,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:08,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:08,951 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:08,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:08,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:08,958 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:09,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:09,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:58:09,035 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:31 [2021-03-10 21:58:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:09,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:09,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:09,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338278901] [2021-03-10 21:58:09,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:09,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:09,249 INFO L87 Difference]: Start difference. First operand 469 states and 1504 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:09,685 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-03-10 21:58:10,093 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-03-10 21:58:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:10,206 INFO L93 Difference]: Finished difference Result 630 states and 1956 transitions. [2021-03-10 21:58:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:10,209 INFO L225 Difference]: With dead ends: 630 [2021-03-10 21:58:10,209 INFO L226 Difference]: Without dead ends: 611 [2021-03-10 21:58:10,209 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1011.7ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:58:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-03-10 21:58:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 466. [2021-03-10 21:58:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.2086021505376343) internal successors, (1492), 465 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1492 transitions. [2021-03-10 21:58:10,215 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1492 transitions. Word has length 21 [2021-03-10 21:58:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:10,215 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 1492 transitions. [2021-03-10 21:58:10,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1492 transitions. [2021-03-10 21:58:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:10,216 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:10,216 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:10,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3113,272 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:10,416 INFO L428 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 322512813, now seen corresponding path program 272 times [2021-03-10 21:58:10,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:10,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966885097] [2021-03-10 21:58:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:10,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966885097] [2021-03-10 21:58:10,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539130117] [2021-03-10 21:58:10,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:10,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:58:10,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:10,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:11,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:11,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,028 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:11,032 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,175 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 21:58:11,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:11,182 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:11,186 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:11,194 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,329 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 21:58:11,330 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:11,335 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:58:11,335 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:95 [2021-03-10 21:58:11,513 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:58:11,693 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_0]} [2021-03-10 21:58:11,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:11,704 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:11,713 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:11,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:11,796 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:11,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:11,804 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:11,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:11,883 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:58:11,883 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:87, output treesize:31 [2021-03-10 21:58:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:12,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:12,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:12,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457203295] [2021-03-10 21:58:12,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:12,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:12,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:12,170 INFO L87 Difference]: Start difference. First operand 466 states and 1492 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:12,766 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-03-10 21:58:13,019 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2021-03-10 21:58:13,367 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 21:58:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:13,445 INFO L93 Difference]: Finished difference Result 599 states and 1845 transitions. [2021-03-10 21:58:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:13,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:13,448 INFO L225 Difference]: With dead ends: 599 [2021-03-10 21:58:13,448 INFO L226 Difference]: Without dead ends: 578 [2021-03-10 21:58:13,448 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1365.7ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:58:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-03-10 21:58:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 458. [2021-03-10 21:58:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 3.185995623632385) internal successors, (1456), 457 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1456 transitions. [2021-03-10 21:58:13,453 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1456 transitions. Word has length 21 [2021-03-10 21:58:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:13,454 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 1456 transitions. [2021-03-10 21:58:13,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1456 transitions. [2021-03-10 21:58:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:13,454 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:13,454 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:13,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 273 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3121 [2021-03-10 21:58:13,655 INFO L428 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:13,655 INFO L82 PathProgramCache]: Analyzing trace with hash -523816653, now seen corresponding path program 273 times [2021-03-10 21:58:13,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:13,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79703496] [2021-03-10 21:58:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:13,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79703496] [2021-03-10 21:58:13,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228919636] [2021-03-10 21:58:13,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:13,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:58:13,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:13,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:58:14,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:14,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:14,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:14,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:14,311 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:14,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:14,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:14,319 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:14,408 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:14,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:14,417 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:75 [2021-03-10 21:58:15,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:15,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:15,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:15,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:15,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:15,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:15,115 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:15,392 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2021-03-10 21:58:15,393 INFO L628 ElimStorePlain]: treesize reduction 62, result has 63.3 percent of original size [2021-03-10 21:58:15,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:15,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:15,402 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:15,517 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 21:58:15,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:15,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:15,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:58:15,527 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:15,640 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-03-10 21:58:15,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:15,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:15,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-03-10 21:58:15,651 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:15,761 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-03-10 21:58:15,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:15,766 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:58:15,766 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:185, output treesize:43 [2021-03-10 21:58:15,933 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2021-03-10 21:58:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:16,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:16,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:16,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49208930] [2021-03-10 21:58:16,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:16,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:16,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:16,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:16,024 INFO L87 Difference]: Start difference. First operand 458 states and 1456 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:16,664 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-03-10 21:58:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:16,887 INFO L93 Difference]: Finished difference Result 540 states and 1689 transitions. [2021-03-10 21:58:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:58:16,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:16,890 INFO L225 Difference]: With dead ends: 540 [2021-03-10 21:58:16,890 INFO L226 Difference]: Without dead ends: 518 [2021-03-10 21:58:16,890 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1199.7ms TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:58:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-03-10 21:58:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 464. [2021-03-10 21:58:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.1900647948164145) internal successors, (1477), 463 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1477 transitions. [2021-03-10 21:58:16,895 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1477 transitions. Word has length 21 [2021-03-10 21:58:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:16,896 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 1477 transitions. [2021-03-10 21:58:16,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1477 transitions. [2021-03-10 21:58:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:16,896 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:16,896 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:17,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 274 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3141 [2021-03-10 21:58:17,097 INFO L428 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1025607989, now seen corresponding path program 274 times [2021-03-10 21:58:17,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:17,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099834916] [2021-03-10 21:58:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:17,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099834916] [2021-03-10 21:58:17,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297512788] [2021-03-10 21:58:17,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:17,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:58:17,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:17,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:58:17,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:17,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:17,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:17,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:17,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:17,762 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-03-10 21:58:17,763 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2021-03-10 21:58:17,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:17,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:17,849 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:17,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:17,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:17,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:17,879 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:17,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:17,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:58:17,901 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2021-03-10 21:58:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:17,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:17,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:58:17,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965555796] [2021-03-10 21:58:17,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:58:17,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:17,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:58:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:58:17,954 INFO L87 Difference]: Start difference. First operand 464 states and 1477 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:18,427 INFO L93 Difference]: Finished difference Result 549 states and 1713 transitions. [2021-03-10 21:58:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:58:18,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:18,430 INFO L225 Difference]: With dead ends: 549 [2021-03-10 21:58:18,430 INFO L226 Difference]: Without dead ends: 527 [2021-03-10 21:58:18,430 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 497.5ms TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:58:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-03-10 21:58:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 461. [2021-03-10 21:58:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.1847826086956523) internal successors, (1465), 460 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1465 transitions. [2021-03-10 21:58:18,435 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1465 transitions. Word has length 21 [2021-03-10 21:58:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:18,435 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 1465 transitions. [2021-03-10 21:58:18,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1465 transitions. [2021-03-10 21:58:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:18,436 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:18,436 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:18,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3160,275 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:18,636 INFO L428 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1162575187, now seen corresponding path program 275 times [2021-03-10 21:58:18,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:18,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310027680] [2021-03-10 21:58:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:18,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310027680] [2021-03-10 21:58:18,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739427628] [2021-03-10 21:58:18,937 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:18,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:58:18,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:18,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:58:18,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:19,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:19,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:19,241 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:19,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:19,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 21:58:19,263 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2021-03-10 21:58:19,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:19,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:19,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:19,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:19,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:19,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:19,371 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:19,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:19,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:58:19,395 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2021-03-10 21:58:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:19,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:19,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:58:19,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407635644] [2021-03-10 21:58:19,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:58:19,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:58:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:58:19,451 INFO L87 Difference]: Start difference. First operand 461 states and 1465 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:19,932 INFO L93 Difference]: Finished difference Result 537 states and 1680 transitions. [2021-03-10 21:58:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:58:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:19,935 INFO L225 Difference]: With dead ends: 537 [2021-03-10 21:58:19,935 INFO L226 Difference]: Without dead ends: 515 [2021-03-10 21:58:19,936 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 472.8ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:58:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-03-10 21:58:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 458. [2021-03-10 21:58:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 3.185995623632385) internal successors, (1456), 457 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1456 transitions. [2021-03-10 21:58:19,941 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1456 transitions. Word has length 21 [2021-03-10 21:58:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:19,941 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 1456 transitions. [2021-03-10 21:58:19,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1456 transitions. [2021-03-10 21:58:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:19,941 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:19,941 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:20,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 276 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3163 [2021-03-10 21:58:20,142 INFO L428 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2097274599, now seen corresponding path program 276 times [2021-03-10 21:58:20,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:20,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495547577] [2021-03-10 21:58:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:20,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495547577] [2021-03-10 21:58:20,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915411317] [2021-03-10 21:58:20,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:20,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:58:20,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:20,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:20,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:21,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 21:58:21,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,024 INFO L388 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 17 treesize of output 13 [2021-03-10 21:58:21,027 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,165 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-03-10 21:58:21,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:21,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:21,178 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,184 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:21,187 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,310 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 21:58:21,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:21,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:58:21,317 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:82 [2021-03-10 21:58:21,534 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:58:21,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:21,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:58:21,558 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,564 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:21,567 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:21,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:21,660 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:21,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:58:21,670 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:21,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:21,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:58:21,752 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:111, output treesize:26 [2021-03-10 21:58:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:22,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:22,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:22,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830925694] [2021-03-10 21:58:22,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:22,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:22,004 INFO L87 Difference]: Start difference. First operand 458 states and 1456 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:22,554 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-03-10 21:58:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:23,357 INFO L93 Difference]: Finished difference Result 599 states and 1857 transitions. [2021-03-10 21:58:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:58:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:23,360 INFO L225 Difference]: With dead ends: 599 [2021-03-10 21:58:23,360 INFO L226 Difference]: Without dead ends: 572 [2021-03-10 21:58:23,360 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1280.5ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:58:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-03-10 21:58:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 462. [2021-03-10 21:58:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 3.1843817787418653) internal successors, (1468), 461 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1468 transitions. [2021-03-10 21:58:23,365 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1468 transitions. Word has length 21 [2021-03-10 21:58:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:23,365 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 1468 transitions. [2021-03-10 21:58:23,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1468 transitions. [2021-03-10 21:58:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:23,366 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:23,366 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:23,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 277 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3166 [2021-03-10 21:58:23,566 INFO L428 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -410882759, now seen corresponding path program 277 times [2021-03-10 21:58:23,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:23,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313668499] [2021-03-10 21:58:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:23,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313668499] [2021-03-10 21:58:23,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328397070] [2021-03-10 21:58:23,809 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:23,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:23,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:24,333 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_559, v_prenex_557], 1=[o_4, v_prenex_555]} [2021-03-10 21:58:24,340 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:24,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:24,465 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-03-10 21:58:24,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:24,472 INFO L388 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 17 treesize of output 13 [2021-03-10 21:58:24,476 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:24,590 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-03-10 21:58:24,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:24,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:24,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 21:58:24,601 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:24,708 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-03-10 21:58:24,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:24,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:24,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:24,719 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:24,826 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 21:58:24,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:24,833 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:58:24,833 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:137, output treesize:86 [2021-03-10 21:58:25,169 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:58:25,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:25,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:25,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:58:25,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:25,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:25,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:25,191 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:25,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:25,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:25,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:25,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:58:25,265 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:25,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:25,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:25,274 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:25,344 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:25,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:58:25,346 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:87, output treesize:21 [2021-03-10 21:58:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:25,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:25,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:25,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30323130] [2021-03-10 21:58:25,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:25,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:25,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:25,521 INFO L87 Difference]: Start difference. First operand 462 states and 1468 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:25,925 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-03-10 21:58:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:26,380 INFO L93 Difference]: Finished difference Result 542 states and 1685 transitions. [2021-03-10 21:58:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 21:58:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:26,383 INFO L225 Difference]: With dead ends: 542 [2021-03-10 21:58:26,383 INFO L226 Difference]: Without dead ends: 521 [2021-03-10 21:58:26,383 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1137.0ms TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:58:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-03-10 21:58:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 456. [2021-03-10 21:58:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.1890109890109892) internal successors, (1451), 455 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1451 transitions. [2021-03-10 21:58:26,388 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1451 transitions. Word has length 21 [2021-03-10 21:58:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:26,388 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 1451 transitions. [2021-03-10 21:58:26,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1451 transitions. [2021-03-10 21:58:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:26,389 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:26,389 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:26,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3192 [2021-03-10 21:58:26,589 INFO L428 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1399639067, now seen corresponding path program 278 times [2021-03-10 21:58:26,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:26,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060596246] [2021-03-10 21:58:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:26,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060596246] [2021-03-10 21:58:26,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073349167] [2021-03-10 21:58:26,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:26,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:58:26,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:26,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:26,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:27,222 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:27,226 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:27,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:27,236 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:27,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:27,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:27,302 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:38 [2021-03-10 21:58:27,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:27,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:27,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:27,678 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:27,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:27,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:27,764 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:27,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:27,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:27,773 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:27,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:27,842 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:58:27,842 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:29 [2021-03-10 21:58:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:28,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:28,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:28,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693820653] [2021-03-10 21:58:28,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:28,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:28,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:28,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:28,004 INFO L87 Difference]: Start difference. First operand 456 states and 1451 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:28,617 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-03-10 21:58:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:28,662 INFO L93 Difference]: Finished difference Result 589 states and 1838 transitions. [2021-03-10 21:58:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:28,665 INFO L225 Difference]: With dead ends: 589 [2021-03-10 21:58:28,665 INFO L226 Difference]: Without dead ends: 567 [2021-03-10 21:58:28,665 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 854.3ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:58:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-03-10 21:58:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 462. [2021-03-10 21:58:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 3.1973969631236443) internal successors, (1474), 461 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1474 transitions. [2021-03-10 21:58:28,670 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1474 transitions. Word has length 21 [2021-03-10 21:58:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:28,670 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 1474 transitions. [2021-03-10 21:58:28,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1474 transitions. [2021-03-10 21:58:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:28,671 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:28,671 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:28,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3208,279 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:28,871 INFO L428 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:28,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1901430403, now seen corresponding path program 279 times [2021-03-10 21:58:28,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:28,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057197801] [2021-03-10 21:58:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:29,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057197801] [2021-03-10 21:58:29,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639192391] [2021-03-10 21:58:29,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:29,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:58:29,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:29,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:29,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:29,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:29,477 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:29,483 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:29,486 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:29,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:29,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:29,550 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:58:29,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:29,823 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:29,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:29,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:29,927 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:29,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:29,937 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:29,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:29,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:29,946 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:30,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:30,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:58:30,034 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:35 [2021-03-10 21:58:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:30,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:30,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:30,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047334591] [2021-03-10 21:58:30,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:30,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:30,323 INFO L87 Difference]: Start difference. First operand 462 states and 1474 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:31,229 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-03-10 21:58:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:31,311 INFO L93 Difference]: Finished difference Result 580 states and 1814 transitions. [2021-03-10 21:58:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:31,314 INFO L225 Difference]: With dead ends: 580 [2021-03-10 21:58:31,315 INFO L226 Difference]: Without dead ends: 558 [2021-03-10 21:58:31,315 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 929.6ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:58:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-03-10 21:58:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 459. [2021-03-10 21:58:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 3.1921397379912664) internal successors, (1462), 458 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1462 transitions. [2021-03-10 21:58:31,320 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1462 transitions. Word has length 21 [2021-03-10 21:58:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:31,320 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 1462 transitions. [2021-03-10 21:58:31,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1462 transitions. [2021-03-10 21:58:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:31,321 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:31,321 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:31,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3219,280 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:31,521 INFO L428 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:31,521 INFO L82 PathProgramCache]: Analyzing trace with hash -996523561, now seen corresponding path program 280 times [2021-03-10 21:58:31,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:31,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327736346] [2021-03-10 21:58:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:31,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327736346] [2021-03-10 21:58:31,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979503467] [2021-03-10 21:58:31,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:31,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:58:31,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:31,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:31,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:32,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:32,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:32,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:32,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:32,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:32,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:32,161 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:32,266 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 21:58:32,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:32,293 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:32,293 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:58:33,749 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_573, v_prenex_574, v_prenex_575, v_prenex_576], 1=[o_2, o_4, v_prenex_571, v_prenex_572]} [2021-03-10 21:58:33,756 INFO L388 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 11 treesize of output 9 [2021-03-10 21:58:33,760 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:33,900 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-03-10 21:58:33,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:33,901 INFO L518 ElimStorePlain]: Eliminatee v_prenex_574 vanished before elimination [2021-03-10 21:58:33,909 INFO L388 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 21 treesize of output 17 [2021-03-10 21:58:33,913 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:34,031 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-03-10 21:58:34,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:34,032 INFO L518 ElimStorePlain]: Eliminatee v_prenex_576 vanished before elimination [2021-03-10 21:58:34,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:34,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 21:58:34,042 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:34,156 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-03-10 21:58:34,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:34,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:34,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:58:34,167 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:34,277 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-03-10 21:58:34,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:34,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:34,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:34,288 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:34,394 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-03-10 21:58:34,395 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:34,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:34,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:34,405 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:34,514 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 21:58:34,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:34,521 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:58:34,521 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:149, output treesize:25 [2021-03-10 21:58:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:34,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:34,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:34,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725402129] [2021-03-10 21:58:34,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:34,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:34,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:34,668 INFO L87 Difference]: Start difference. First operand 459 states and 1462 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:34,934 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 21:58:35,197 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2021-03-10 21:58:35,847 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-03-10 21:58:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:36,183 INFO L93 Difference]: Finished difference Result 748 states and 2288 transitions. [2021-03-10 21:58:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 21:58:36,185 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:36,186 INFO L225 Difference]: With dead ends: 748 [2021-03-10 21:58:36,186 INFO L226 Difference]: Without dead ends: 688 [2021-03-10 21:58:36,186 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1512.5ms TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:58:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-03-10 21:58:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 459. [2021-03-10 21:58:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 3.185589519650655) internal successors, (1459), 458 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1459 transitions. [2021-03-10 21:58:36,192 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1459 transitions. Word has length 21 [2021-03-10 21:58:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:36,192 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 1459 transitions. [2021-03-10 21:58:36,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1459 transitions. [2021-03-10 21:58:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:36,193 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:36,193 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:36,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 281 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3229 [2021-03-10 21:58:36,393 INFO L428 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1086051491, now seen corresponding path program 281 times [2021-03-10 21:58:36,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:36,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691745875] [2021-03-10 21:58:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:36,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691745875] [2021-03-10 21:58:36,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918576802] [2021-03-10 21:58:36,693 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:36,715 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:58:36,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:36,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:36,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:37,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:37,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:37,029 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:37,033 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:37,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:37,045 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:37,051 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:37,054 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:37,211 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:58:37,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:37,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:58:37,223 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:101 [2021-03-10 21:58:37,410 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-03-10 21:58:37,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:37,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:37,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:37,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:37,863 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:37,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:37,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:37,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:37,962 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:38,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:38,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:38,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:38,055 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:38,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:38,131 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:58:38,132 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:93, output treesize:37 [2021-03-10 21:58:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:38,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:38,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:38,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594563556] [2021-03-10 21:58:38,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:38,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:38,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:38,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:38,352 INFO L87 Difference]: Start difference. First operand 459 states and 1459 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:39,105 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 21:58:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:39,252 INFO L93 Difference]: Finished difference Result 546 states and 1697 transitions. [2021-03-10 21:58:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:39,255 INFO L225 Difference]: With dead ends: 546 [2021-03-10 21:58:39,255 INFO L226 Difference]: Without dead ends: 527 [2021-03-10 21:58:39,256 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 985.9ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:58:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-03-10 21:58:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 455. [2021-03-10 21:58:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.1784140969162995) internal successors, (1443), 454 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1443 transitions. [2021-03-10 21:58:39,260 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1443 transitions. Word has length 21 [2021-03-10 21:58:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:39,261 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1443 transitions. [2021-03-10 21:58:39,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1443 transitions. [2021-03-10 21:58:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:39,261 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:39,261 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:39,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3303,282 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:39,462 INFO L428 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1479953917, now seen corresponding path program 282 times [2021-03-10 21:58:39,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:39,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937131767] [2021-03-10 21:58:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:39,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937131767] [2021-03-10 21:58:39,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753007148] [2021-03-10 21:58:39,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:39,853 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:58:39,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:39,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:39,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:40,090 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:40,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:40,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:40,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:40,166 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:38 [2021-03-10 21:58:40,546 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_585, v_prenex_586], 1=[o_2, o_4]} [2021-03-10 21:58:40,552 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:40,556 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,562 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:40,566 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,699 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-03-10 21:58:40,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:40,700 INFO L518 ElimStorePlain]: Eliminatee v_prenex_586 vanished before elimination [2021-03-10 21:58:40,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:40,710 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:40,719 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,835 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-03-10 21:58:40,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:40,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:40,846 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:40,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:40,854 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:40,962 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-03-10 21:58:40,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:40,966 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:58:40,966 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:115, output treesize:49 [2021-03-10 21:58:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:41,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:41,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:41,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449504282] [2021-03-10 21:58:41,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:41,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:41,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:41,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:41,254 INFO L87 Difference]: Start difference. First operand 455 states and 1443 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:42,003 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-03-10 21:58:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:42,061 INFO L93 Difference]: Finished difference Result 626 states and 1925 transitions. [2021-03-10 21:58:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:42,064 INFO L225 Difference]: With dead ends: 626 [2021-03-10 21:58:42,064 INFO L226 Difference]: Without dead ends: 575 [2021-03-10 21:58:42,064 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 961.3ms TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:58:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-03-10 21:58:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 455. [2021-03-10 21:58:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.1784140969162995) internal successors, (1443), 454 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1443 transitions. [2021-03-10 21:58:42,069 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1443 transitions. Word has length 21 [2021-03-10 21:58:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:42,069 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1443 transitions. [2021-03-10 21:58:42,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1443 transitions. [2021-03-10 21:58:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:42,070 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:42,070 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:42,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3314 [2021-03-10 21:58:42,270 INFO L428 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash 385254999, now seen corresponding path program 283 times [2021-03-10 21:58:42,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:42,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030886657] [2021-03-10 21:58:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:42,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030886657] [2021-03-10 21:58:42,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501464260] [2021-03-10 21:58:42,561 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:42,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:42,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:42,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:42,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:42,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:42,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:42,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:42,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:42,843 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:42,948 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 21:58:42,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:42,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:42,965 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:58:43,754 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2021-03-10 21:58:44,016 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4, v_prenex_593, v_prenex_594], 1=[v_prenex_595, v_prenex_596, v_prenex_599, v_prenex_600]} [2021-03-10 21:58:44,022 INFO L388 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 11 treesize of output 9 [2021-03-10 21:58:44,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:44,190 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-10 21:58:44,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:44,191 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:58:44,197 INFO L388 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 11 treesize of output 9 [2021-03-10 21:58:44,201 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:44,371 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-03-10 21:58:44,372 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:44,372 INFO L518 ElimStorePlain]: Eliminatee v_prenex_594 vanished before elimination [2021-03-10 21:58:44,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:44,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:44,382 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:44,535 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-10 21:58:44,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:44,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:44,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:44,547 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:44,691 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-03-10 21:58:44,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:44,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:44,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:44,701 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:44,843 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-10 21:58:44,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:44,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:44,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:44,854 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:45,002 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:58:45,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:45,013 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:58:45,013 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:165, output treesize:61 [2021-03-10 21:58:45,210 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2021-03-10 21:58:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:45,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:45,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:45,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76788513] [2021-03-10 21:58:45,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:45,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:45,386 INFO L87 Difference]: Start difference. First operand 455 states and 1443 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:46,119 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:58:46,554 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:58:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:46,727 INFO L93 Difference]: Finished difference Result 552 states and 1717 transitions. [2021-03-10 21:58:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 21:58:46,730 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:46,731 INFO L225 Difference]: With dead ends: 552 [2021-03-10 21:58:46,731 INFO L226 Difference]: Without dead ends: 525 [2021-03-10 21:58:46,731 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1476.7ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:58:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-03-10 21:58:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 452. [2021-03-10 21:58:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.1818181818181817) internal successors, (1435), 451 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1435 transitions. [2021-03-10 21:58:46,736 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1435 transitions. Word has length 21 [2021-03-10 21:58:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:46,736 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1435 transitions. [2021-03-10 21:58:46,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1435 transitions. [2021-03-10 21:58:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:46,737 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:46,737 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:46,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3337,284 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:46,937 INFO L428 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash -239030765, now seen corresponding path program 284 times [2021-03-10 21:58:46,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:46,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184303482] [2021-03-10 21:58:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:47,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184303482] [2021-03-10 21:58:47,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828203607] [2021-03-10 21:58:47,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:47,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:58:47,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:47,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:47,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:47,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:47,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:47,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:47,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:47,545 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:47,548 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:47,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:47,609 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:47,609 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:58:47,739 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4], 1=[v_prenex_603, v_prenex_604]} [2021-03-10 21:58:47,746 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:47,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:47,756 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:47,759 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:47,919 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-03-10 21:58:47,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:47,920 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:58:47,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:47,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:47,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:47,931 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:47,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:47,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:47,941 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:48,087 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 21:58:48,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:48,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:48,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:48,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:48,100 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:48,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:48,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:58:48,110 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:48,259 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 21:58:48,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:48,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:58:48,263 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:137, output treesize:61 [2021-03-10 21:58:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:48,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:48,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:48,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270403128] [2021-03-10 21:58:48,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:48,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:48,683 INFO L87 Difference]: Start difference. First operand 452 states and 1435 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:49,622 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-03-10 21:58:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:49,698 INFO L93 Difference]: Finished difference Result 629 states and 1933 transitions. [2021-03-10 21:58:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:58:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:49,701 INFO L225 Difference]: With dead ends: 629 [2021-03-10 21:58:49,701 INFO L226 Difference]: Without dead ends: 578 [2021-03-10 21:58:49,701 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 986.3ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:58:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-03-10 21:58:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 452. [2021-03-10 21:58:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.1818181818181817) internal successors, (1435), 451 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1435 transitions. [2021-03-10 21:58:49,706 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1435 transitions. Word has length 21 [2021-03-10 21:58:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:49,706 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1435 transitions. [2021-03-10 21:58:49,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1435 transitions. [2021-03-10 21:58:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:49,707 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:49,707 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:49,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3395 [2021-03-10 21:58:49,908 INFO L428 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash 58235645, now seen corresponding path program 285 times [2021-03-10 21:58:49,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:49,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398961862] [2021-03-10 21:58:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:50,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398961862] [2021-03-10 21:58:50,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094326076] [2021-03-10 21:58:50,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:50,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:58:50,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:50,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:50,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:50,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:50,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:50,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:50,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:50,692 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:50,695 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:50,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:50,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:50,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:58:50,705 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:50,712 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:50,715 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:50,870 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 21:58:50,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:50,883 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:58:50,884 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:101 [2021-03-10 21:58:51,074 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-03-10 21:58:51,169 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4, v_prenex_611, v_prenex_612], 1=[v_prenex_607, v_prenex_608, v_prenex_609, v_prenex_610]} [2021-03-10 21:58:51,177 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:51,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:51,319 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:58:51,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:51,320 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:58:51,326 INFO L388 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 9 treesize of output 7 [2021-03-10 21:58:51,329 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:51,471 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-03-10 21:58:51,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:51,472 INFO L518 ElimStorePlain]: Eliminatee v_prenex_612 vanished before elimination [2021-03-10 21:58:51,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:51,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:51,481 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:51,616 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-03-10 21:58:51,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:51,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:51,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:51,626 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:51,764 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-03-10 21:58:51,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:51,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:51,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:51,775 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:51,908 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-03-10 21:58:51,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:51,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:51,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:51,918 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:52,055 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-03-10 21:58:52,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:52,059 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:58:52,059 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:137, output treesize:63 [2021-03-10 21:58:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:52,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:52,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:52,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955521104] [2021-03-10 21:58:52,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:52,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:52,497 INFO L87 Difference]: Start difference. First operand 452 states and 1435 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:53,275 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 21:58:53,471 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 21:58:53,738 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 21:58:54,063 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 21:58:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:54,206 INFO L93 Difference]: Finished difference Result 734 states and 2265 transitions. [2021-03-10 21:58:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:58:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:54,210 INFO L225 Difference]: With dead ends: 734 [2021-03-10 21:58:54,210 INFO L226 Difference]: Without dead ends: 692 [2021-03-10 21:58:54,210 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1964.5ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:58:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-03-10 21:58:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 453. [2021-03-10 21:58:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.188053097345133) internal successors, (1441), 452 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1441 transitions. [2021-03-10 21:58:54,216 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1441 transitions. Word has length 21 [2021-03-10 21:58:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:54,216 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 1441 transitions. [2021-03-10 21:58:54,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1441 transitions. [2021-03-10 21:58:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:54,217 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:54,217 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:54,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 286 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3407 [2021-03-10 21:58:54,417 INFO L428 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash -226027039, now seen corresponding path program 286 times [2021-03-10 21:58:54,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:54,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682234320] [2021-03-10 21:58:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:54,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682234320] [2021-03-10 21:58:54,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046086031] [2021-03-10 21:58:54,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:54,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:58:54,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:54,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:58:54,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:58:55,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:55,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:55,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:55,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:55,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:55,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:55,084 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:55,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:55,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:58:55,197 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:89 [2021-03-10 21:58:55,514 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_615, o_2, v_prenex_616, o_4], 1=[v_prenex_617, v_prenex_618, v_prenex_622, v_prenex_623]} [2021-03-10 21:58:55,521 INFO L388 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 11 treesize of output 9 [2021-03-10 21:58:55,525 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:55,707 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-10 21:58:55,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:55,715 INFO L388 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 11 treesize of output 9 [2021-03-10 21:58:55,718 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:55,906 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-03-10 21:58:55,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:55,907 INFO L518 ElimStorePlain]: Eliminatee v_prenex_616 vanished before elimination [2021-03-10 21:58:55,907 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:58:55,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:55,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:55,918 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:56,104 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-03-10 21:58:56,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:56,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:56,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:56,116 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:56,295 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-10 21:58:56,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:56,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:56,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:58:56,306 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:56,480 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-03-10 21:58:56,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:56,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:58:56,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:58:56,491 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:58:56,665 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:58:56,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:58:56,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:58:56,669 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:185, output treesize:64 [2021-03-10 21:58:56,883 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2021-03-10 21:58:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:57,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:58:57,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:58:57,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047793153] [2021-03-10 21:58:57,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:58:57,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:58:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:58:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:58:57,146 INFO L87 Difference]: Start difference. First operand 453 states and 1441 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:57,396 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-03-10 21:58:57,628 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2021-03-10 21:58:58,458 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 21:58:58,698 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 21:58:59,030 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-03-10 21:58:59,276 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 21:58:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:58:59,388 INFO L93 Difference]: Finished difference Result 724 states and 2220 transitions. [2021-03-10 21:58:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 21:58:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:58:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:58:59,391 INFO L225 Difference]: With dead ends: 724 [2021-03-10 21:58:59,391 INFO L226 Difference]: Without dead ends: 676 [2021-03-10 21:58:59,391 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2345.5ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-03-10 21:58:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-03-10 21:58:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 451. [2021-03-10 21:58:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.1777777777777776) internal successors, (1430), 450 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1430 transitions. [2021-03-10 21:58:59,396 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1430 transitions. Word has length 21 [2021-03-10 21:58:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:58:59,396 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 1430 transitions. [2021-03-10 21:58:59,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:58:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1430 transitions. [2021-03-10 21:58:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:58:59,397 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:58:59,397 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:58:59,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3419,287 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:59,597 INFO L428 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:58:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:58:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1157356413, now seen corresponding path program 287 times [2021-03-10 21:58:59,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:58:59,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014319546] [2021-03-10 21:58:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:58:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:58:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:58:59,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014319546] [2021-03-10 21:58:59,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277677668] [2021-03-10 21:58:59,879 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:58:59,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:58:59,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:58:59,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:58:59,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:00,108 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_625], 1=[o_4]} [2021-03-10 21:59:00,113 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:00,116 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:00,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:00,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:00,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:00,169 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:00,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:00,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:00,214 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2021-03-10 21:59:00,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:00,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:00,401 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:00,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:00,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:00,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:00,430 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:00,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:00,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:59:00,450 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2021-03-10 21:59:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:00,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:00,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:59:00,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157634521] [2021-03-10 21:59:00,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:59:00,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:59:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:59:00,499 INFO L87 Difference]: Start difference. First operand 451 states and 1430 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:01,027 INFO L93 Difference]: Finished difference Result 572 states and 1777 transitions. [2021-03-10 21:59:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:59:01,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:01,030 INFO L225 Difference]: With dead ends: 572 [2021-03-10 21:59:01,030 INFO L226 Difference]: Without dead ends: 550 [2021-03-10 21:59:01,030 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 482.5ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:59:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-03-10 21:59:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 451. [2021-03-10 21:59:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.1777777777777776) internal successors, (1430), 450 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1430 transitions. [2021-03-10 21:59:01,035 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1430 transitions. Word has length 21 [2021-03-10 21:59:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:01,035 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 1430 transitions. [2021-03-10 21:59:01,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1430 transitions. [2021-03-10 21:59:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:01,036 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:01,036 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:01,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3431,288 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:01,236 INFO L428 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:01,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1498417847, now seen corresponding path program 288 times [2021-03-10 21:59:01,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:01,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497245374] [2021-03-10 21:59:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:01,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497245374] [2021-03-10 21:59:01,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456270760] [2021-03-10 21:59:01,568 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:01,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:59:01,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:01,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:01,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:01,813 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_628, v_prenex_630], 1=[v_prenex_626, o_4]} [2021-03-10 21:59:01,818 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:01,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:01,977 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-10 21:59:01,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:01,984 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:01,987 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:02,159 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:59:02,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:02,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:02,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:02,171 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:02,335 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:59:02,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:02,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:02,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:02,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:02,485 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:59:02,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:02,492 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:02,492 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:157, output treesize:119 [2021-03-10 21:59:02,760 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-03-10 21:59:03,041 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:59:03,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:03,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:03,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:59:03,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:03,059 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:03,062 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:03,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:03,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:03,071 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:03,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:03,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:03,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:03,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:59:03,158 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:03,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:03,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:03,168 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:03,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:03,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 21:59:03,247 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:111, output treesize:26 [2021-03-10 21:59:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:03,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:03,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:03,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392835504] [2021-03-10 21:59:03,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:03,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:03,491 INFO L87 Difference]: Start difference. First operand 451 states and 1430 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:03,739 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2021-03-10 21:59:04,884 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2021-03-10 21:59:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:05,399 INFO L93 Difference]: Finished difference Result 725 states and 2230 transitions. [2021-03-10 21:59:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 21:59:05,401 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:05,402 INFO L225 Difference]: With dead ends: 725 [2021-03-10 21:59:05,402 INFO L226 Difference]: Without dead ends: 698 [2021-03-10 21:59:05,402 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2019.7ms TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-03-10 21:59:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-03-10 21:59:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 456. [2021-03-10 21:59:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.18021978021978) internal successors, (1447), 455 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1447 transitions. [2021-03-10 21:59:05,410 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1447 transitions. Word has length 21 [2021-03-10 21:59:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:05,410 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 1447 transitions. [2021-03-10 21:59:05,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1447 transitions. [2021-03-10 21:59:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:05,411 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:05,411 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:05,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3436,289 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:05,627 INFO L428 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1110157609, now seen corresponding path program 289 times [2021-03-10 21:59:05,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:05,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337261225] [2021-03-10 21:59:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:05,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337261225] [2021-03-10 21:59:05,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091298870] [2021-03-10 21:59:05,932 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:05,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:05,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:06,177 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_635, o_4], 1=[v_prenex_637, v_prenex_639]} [2021-03-10 21:59:06,182 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:06,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:06,339 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-10 21:59:06,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:06,346 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:06,349 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:06,493 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:59:06,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:06,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:06,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:06,503 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:06,641 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:59:06,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:06,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:06,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:06,651 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:06,783 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:59:06,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:06,791 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:06,791 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:157, output treesize:119 [2021-03-10 21:59:07,074 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-03-10 21:59:07,488 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:59:07,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:07,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:07,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:07,498 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:07,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:07,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:59:07,508 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:07,569 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:07,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:07,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:07,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:07,580 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:07,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:07,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:59:07,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:07,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:07,650 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:07,651 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:87, output treesize:21 [2021-03-10 21:59:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:07,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:07,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:07,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956082224] [2021-03-10 21:59:07,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:07,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:07,824 INFO L87 Difference]: Start difference. First operand 456 states and 1447 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:08,103 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-03-10 21:59:08,547 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2021-03-10 21:59:09,078 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2021-03-10 21:59:09,337 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-03-10 21:59:09,702 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2021-03-10 21:59:10,043 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-03-10 21:59:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:10,254 INFO L93 Difference]: Finished difference Result 668 states and 2026 transitions. [2021-03-10 21:59:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:59:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:10,257 INFO L225 Difference]: With dead ends: 668 [2021-03-10 21:59:10,257 INFO L226 Difference]: Without dead ends: 626 [2021-03-10 21:59:10,257 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2590.9ms TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2021-03-10 21:59:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-03-10 21:59:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 454. [2021-03-10 21:59:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.183222958057395) internal successors, (1442), 453 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1442 transitions. [2021-03-10 21:59:10,262 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1442 transitions. Word has length 21 [2021-03-10 21:59:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:10,262 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 1442 transitions. [2021-03-10 21:59:10,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1442 transitions. [2021-03-10 21:59:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:10,263 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:10,263 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:10,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3452 [2021-03-10 21:59:10,463 INFO L428 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1087653237, now seen corresponding path program 290 times [2021-03-10 21:59:10,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:10,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573784263] [2021-03-10 21:59:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:10,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573784263] [2021-03-10 21:59:10,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840885331] [2021-03-10 21:59:10,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:10,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:59:10,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:10,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:10,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:11,040 INFO L446 ElimStorePlain]: Different costs {0=[o_4], 1=[v_prenex_642]} [2021-03-10 21:59:11,046 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:11,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:11,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:11,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:11,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:11,152 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:39 [2021-03-10 21:59:11,282 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:11,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,291 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:11,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:11,304 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:11,313 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,463 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-03-10 21:59:11,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:11,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:11,473 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:11,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:11,481 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:11,630 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 21:59:11,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:11,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:59:11,633 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:153, output treesize:61 [2021-03-10 21:59:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:12,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:12,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:12,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851302988] [2021-03-10 21:59:12,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:12,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:12,010 INFO L87 Difference]: Start difference. First operand 454 states and 1442 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:12,815 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-03-10 21:59:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:12,919 INFO L93 Difference]: Finished difference Result 628 states and 1936 transitions. [2021-03-10 21:59:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:59:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:12,921 INFO L225 Difference]: With dead ends: 628 [2021-03-10 21:59:12,921 INFO L226 Difference]: Without dead ends: 577 [2021-03-10 21:59:12,922 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 943.5ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:59:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-03-10 21:59:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 454. [2021-03-10 21:59:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.183222958057395) internal successors, (1442), 453 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1442 transitions. [2021-03-10 21:59:12,927 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1442 transitions. Word has length 21 [2021-03-10 21:59:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:12,927 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 1442 transitions. [2021-03-10 21:59:12,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1442 transitions. [2021-03-10 21:59:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:12,927 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:12,927 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:13,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 291 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3471 [2021-03-10 21:59:13,128 INFO L428 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash -790386827, now seen corresponding path program 291 times [2021-03-10 21:59:13,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:13,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395568413] [2021-03-10 21:59:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:13,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395568413] [2021-03-10 21:59:13,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416450914] [2021-03-10 21:59:13,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:13,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 21:59:13,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:13,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:13,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:13,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:13,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:13,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:13,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:13,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:13,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:13,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:13,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:13,855 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:13,855 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:79 [2021-03-10 21:59:14,069 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:59:14,076 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:14,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:14,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:14,090 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:14,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:14,101 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:14,107 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:14,110 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:14,253 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 21:59:14,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:14,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:14,264 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:14,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:14,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:14,272 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:14,421 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 21:59:14,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:14,424 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:59:14,425 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:157, output treesize:60 [2021-03-10 21:59:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:14,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:14,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:14,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870087094] [2021-03-10 21:59:14,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:14,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:14,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:14,802 INFO L87 Difference]: Start difference. First operand 454 states and 1442 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:15,614 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 21:59:15,809 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 21:59:16,063 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 21:59:16,390 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 21:59:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:16,527 INFO L93 Difference]: Finished difference Result 653 states and 2018 transitions. [2021-03-10 21:59:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 21:59:16,528 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:16,529 INFO L225 Difference]: With dead ends: 653 [2021-03-10 21:59:16,529 INFO L226 Difference]: Without dead ends: 611 [2021-03-10 21:59:16,529 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1677.2ms TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:59:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-03-10 21:59:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 453. [2021-03-10 21:59:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.1924778761061945) internal successors, (1443), 452 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1443 transitions. [2021-03-10 21:59:16,534 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1443 transitions. Word has length 21 [2021-03-10 21:59:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:16,534 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 1443 transitions. [2021-03-10 21:59:16,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1443 transitions. [2021-03-10 21:59:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:16,535 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:16,535 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:16,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 292 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3481 [2021-03-10 21:59:16,735 INFO L428 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1074649511, now seen corresponding path program 292 times [2021-03-10 21:59:16,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:16,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809065195] [2021-03-10 21:59:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:17,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809065195] [2021-03-10 21:59:17,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368218628] [2021-03-10 21:59:17,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:17,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:59:17,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:17,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:17,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:17,332 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_646, o_4], 1=[v_prenex_648, v_prenex_650]} [2021-03-10 21:59:17,338 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:17,341 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:17,497 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-10 21:59:17,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:17,504 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:17,507 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:17,673 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:59:17,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:17,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:17,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:17,683 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:17,826 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:59:17,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:17,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:17,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:17,835 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:17,972 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:59:17,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:17,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:17,979 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:157, output treesize:119 [2021-03-10 21:59:18,250 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-03-10 21:59:18,324 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:59:18,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:18,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:18,342 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:18,346 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:18,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:18,357 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:18,363 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:18,367 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:18,509 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-03-10 21:59:18,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:18,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:18,520 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:18,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:18,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:18,530 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:18,672 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 21:59:18,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:18,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:59:18,676 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:165, output treesize:60 [2021-03-10 21:59:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:19,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:19,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:19,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467009634] [2021-03-10 21:59:19,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:19,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:19,070 INFO L87 Difference]: Start difference. First operand 453 states and 1443 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:19,365 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2021-03-10 21:59:20,012 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2021-03-10 21:59:20,629 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2021-03-10 21:59:20,872 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2021-03-10 21:59:21,209 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-03-10 21:59:21,504 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-03-10 21:59:21,936 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2021-03-10 21:59:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:21,942 INFO L93 Difference]: Finished difference Result 770 states and 2363 transitions. [2021-03-10 21:59:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 21:59:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:21,945 INFO L225 Difference]: With dead ends: 770 [2021-03-10 21:59:21,945 INFO L226 Difference]: Without dead ends: 722 [2021-03-10 21:59:21,945 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2839.5ms TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2021-03-10 21:59:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-03-10 21:59:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 456. [2021-03-10 21:59:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.2021978021978024) internal successors, (1457), 455 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1457 transitions. [2021-03-10 21:59:21,950 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1457 transitions. Word has length 21 [2021-03-10 21:59:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:21,950 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 1457 transitions. [2021-03-10 21:59:21,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1457 transitions. [2021-03-10 21:59:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:21,951 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:21,951 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:22,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3490,293 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:22,151 INFO L428 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1001040279, now seen corresponding path program 293 times [2021-03-10 21:59:22,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:22,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865312067] [2021-03-10 21:59:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:22,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865312067] [2021-03-10 21:59:22,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006651048] [2021-03-10 21:59:22,490 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:22,516 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:59:22,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:22,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:22,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:22,750 INFO L446 ElimStorePlain]: Different costs {0=[o_4, v_prenex_652], 1=[v_prenex_654, v_prenex_656]} [2021-03-10 21:59:22,756 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:22,760 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:22,923 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-10 21:59:22,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:22,929 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:22,932 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:23,081 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-03-10 21:59:23,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:23,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:23,091 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:23,237 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-10 21:59:23,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:23,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:23,247 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:23,387 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-03-10 21:59:23,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:23,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:23,394 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:157, output treesize:119 [2021-03-10 21:59:23,697 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-03-10 21:59:23,878 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 21:59:23,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:23,888 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:23,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:23,897 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:23,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:23,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:23,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:23,995 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:24,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:24,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:24,003 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:24,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:24,086 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:24,086 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:31 [2021-03-10 21:59:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:24,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:24,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:24,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437382848] [2021-03-10 21:59:24,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:24,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:24,364 INFO L87 Difference]: Start difference. First operand 456 states and 1457 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:24,596 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-03-10 21:59:24,832 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2021-03-10 21:59:25,608 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-03-10 21:59:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:25,754 INFO L93 Difference]: Finished difference Result 647 states and 2001 transitions. [2021-03-10 21:59:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:59:25,756 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:25,756 INFO L225 Difference]: With dead ends: 647 [2021-03-10 21:59:25,757 INFO L226 Difference]: Without dead ends: 626 [2021-03-10 21:59:25,757 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1510.4ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-03-10 21:59:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-03-10 21:59:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 450. [2021-03-10 21:59:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.1848552338530065) internal successors, (1430), 449 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1430 transitions. [2021-03-10 21:59:25,762 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1430 transitions. Word has length 21 [2021-03-10 21:59:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:25,762 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1430 transitions. [2021-03-10 21:59:25,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1430 transitions. [2021-03-10 21:59:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:25,762 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:25,762 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:25,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 294 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3503 [2021-03-10 21:59:25,963 INFO L428 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:25,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash -324653355, now seen corresponding path program 294 times [2021-03-10 21:59:25,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:25,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005775263] [2021-03-10 21:59:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:26,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005775263] [2021-03-10 21:59:26,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895688280] [2021-03-10 21:59:26,269 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:26,290 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 21:59:26,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:26,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:26,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:26,503 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:26,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:26,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:26,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:26,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:26,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:26,577 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:26,578 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:59:26,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:26,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:26,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:26,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:26,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:26,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:26,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:27,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:27,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:27,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:27,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:27,026 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:27,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:27,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:27,034 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:27,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:27,114 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:27,114 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:29 [2021-03-10 21:59:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:27,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:27,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:27,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298662360] [2021-03-10 21:59:27,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:27,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:27,277 INFO L87 Difference]: Start difference. First operand 450 states and 1430 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:28,054 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-03-10 21:59:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:28,130 INFO L93 Difference]: Finished difference Result 541 states and 1686 transitions. [2021-03-10 21:59:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 21:59:28,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:28,133 INFO L225 Difference]: With dead ends: 541 [2021-03-10 21:59:28,133 INFO L226 Difference]: Without dead ends: 519 [2021-03-10 21:59:28,133 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 785.5ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 21:59:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-03-10 21:59:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 459. [2021-03-10 21:59:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 3.1899563318777293) internal successors, (1461), 458 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1461 transitions. [2021-03-10 21:59:28,138 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1461 transitions. Word has length 21 [2021-03-10 21:59:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:28,138 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 1461 transitions. [2021-03-10 21:59:28,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1461 transitions. [2021-03-10 21:59:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:28,139 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:28,139 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:28,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3512,295 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:28,339 INFO L428 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -826444691, now seen corresponding path program 295 times [2021-03-10 21:59:28,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:28,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088473862] [2021-03-10 21:59:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:28,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088473862] [2021-03-10 21:59:28,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762241175] [2021-03-10 21:59:28,687 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:28,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:59:28,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:28,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:28,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:28,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:28,925 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:28,930 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:28,934 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:28,991 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:28,998 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:28,998 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:59:29,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:29,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:29,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:29,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:29,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:29,241 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:29,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:29,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 21:59:29,265 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2021-03-10 21:59:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:29,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:29,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:59:29,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010387379] [2021-03-10 21:59:29,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:59:29,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:29,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:59:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:59:29,319 INFO L87 Difference]: Start difference. First operand 459 states and 1461 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:29,867 INFO L93 Difference]: Finished difference Result 550 states and 1710 transitions. [2021-03-10 21:59:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:59:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:29,870 INFO L225 Difference]: With dead ends: 550 [2021-03-10 21:59:29,870 INFO L226 Difference]: Without dead ends: 528 [2021-03-10 21:59:29,870 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 513.9ms TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:59:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-03-10 21:59:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 456. [2021-03-10 21:59:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.1846153846153844) internal successors, (1449), 455 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1449 transitions. [2021-03-10 21:59:29,875 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1449 transitions. Word has length 21 [2021-03-10 21:59:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:29,875 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 1449 transitions. [2021-03-10 21:59:29,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1449 transitions. [2021-03-10 21:59:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:29,875 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:29,875 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:30,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3526,296 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:30,076 INFO L428 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 300670763, now seen corresponding path program 296 times [2021-03-10 21:59:30,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:30,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146067260] [2021-03-10 21:59:30,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:30,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146067260] [2021-03-10 21:59:30,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534349653] [2021-03-10 21:59:30,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:30,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:59:30,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:30,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:30,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:30,710 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:30,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:30,719 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:30,723 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:30,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:30,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:30,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:30,734 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:30,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:30,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:30,743 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:30,890 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 21:59:30,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:30,900 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:30,900 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:91 [2021-03-10 21:59:31,102 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:59:31,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:31,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:31,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:31,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:31,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:32,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:32,002 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:32,077 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:32,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:32,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 21:59:32,087 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:32,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:32,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:32,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:59:32,163 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:32,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:32,235 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:32,235 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:21 [2021-03-10 21:59:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:32,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:32,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:32,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415953435] [2021-03-10 21:59:32,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:32,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:32,405 INFO L87 Difference]: Start difference. First operand 456 states and 1449 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:33,329 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2021-03-10 21:59:33,637 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-03-10 21:59:34,089 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2021-03-10 21:59:34,572 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2021-03-10 21:59:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:34,876 INFO L93 Difference]: Finished difference Result 686 states and 2099 transitions. [2021-03-10 21:59:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-10 21:59:34,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:34,879 INFO L225 Difference]: With dead ends: 686 [2021-03-10 21:59:34,879 INFO L226 Difference]: Without dead ends: 648 [2021-03-10 21:59:34,879 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2403.8ms TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-03-10 21:59:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-03-10 21:59:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 458. [2021-03-10 21:59:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 3.1903719912472646) internal successors, (1458), 457 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1458 transitions. [2021-03-10 21:59:34,884 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1458 transitions. Word has length 21 [2021-03-10 21:59:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:34,884 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 1458 transitions. [2021-03-10 21:59:34,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1458 transitions. [2021-03-10 21:59:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:34,885 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:34,885 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:35,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 297 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3532 [2021-03-10 21:59:35,085 INFO L428 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash 78462151, now seen corresponding path program 297 times [2021-03-10 21:59:35,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:35,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875455567] [2021-03-10 21:59:35,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:35,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875455567] [2021-03-10 21:59:35,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919001681] [2021-03-10 21:59:35,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:35,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 21:59:35,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:35,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:35,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:35,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:35,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:35,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:35,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:35,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:35,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:35,606 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:35,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:35,713 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:35,714 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:79 [2021-03-10 21:59:36,907 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_679, v_prenex_680, v_prenex_677, v_prenex_678], 1=[o_2, o_4, v_prenex_675, v_prenex_676]} [2021-03-10 21:59:36,915 INFO L388 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 21 treesize of output 17 [2021-03-10 21:59:36,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:37,028 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-10 21:59:37,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:37,029 INFO L518 ElimStorePlain]: Eliminatee v_prenex_680 vanished before elimination [2021-03-10 21:59:37,036 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:37,039 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:37,143 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-03-10 21:59:37,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:37,144 INFO L518 ElimStorePlain]: Eliminatee v_prenex_678 vanished before elimination [2021-03-10 21:59:37,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:37,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:37,154 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:37,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:37,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:37,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:37,265 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:37,368 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-03-10 21:59:37,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:37,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:37,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 21:59:37,379 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:37,480 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 21:59:37,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:37,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:37,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:59:37,508 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:37,618 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 21:59:37,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:37,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 21:59:37,624 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:129, output treesize:25 [2021-03-10 21:59:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:37,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:37,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:37,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714857019] [2021-03-10 21:59:37,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:37,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:37,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:37,769 INFO L87 Difference]: Start difference. First operand 458 states and 1458 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:38,910 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-03-10 21:59:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:39,338 INFO L93 Difference]: Finished difference Result 686 states and 2103 transitions. [2021-03-10 21:59:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 21:59:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:39,340 INFO L225 Difference]: With dead ends: 686 [2021-03-10 21:59:39,340 INFO L226 Difference]: Without dead ends: 626 [2021-03-10 21:59:39,341 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1290.1ms TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2021-03-10 21:59:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-03-10 21:59:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 458. [2021-03-10 21:59:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 3.183807439824945) internal successors, (1455), 457 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1455 transitions. [2021-03-10 21:59:39,346 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1455 transitions. Word has length 21 [2021-03-10 21:59:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:39,346 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 1455 transitions. [2021-03-10 21:59:39,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1455 transitions. [2021-03-10 21:59:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:39,346 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:39,346 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:39,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 298 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3560 [2021-03-10 21:59:39,547 INFO L428 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash -11065779, now seen corresponding path program 298 times [2021-03-10 21:59:39,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:39,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794485561] [2021-03-10 21:59:39,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:39,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794485561] [2021-03-10 21:59:39,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072074725] [2021-03-10 21:59:39,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:39,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 21:59:39,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:39,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 21:59:39,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:40,231 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:40,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:40,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:40,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:40,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:40,246 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:40,252 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:40,256 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:40,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:40,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:40,265 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:40,429 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 21:59:40,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:40,439 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:40,439 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:91 [2021-03-10 21:59:40,643 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:59:41,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:41,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:41,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:41,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:41,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:41,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:41,164 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:41,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:41,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:41,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:41,260 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:41,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:41,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:41,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:41,348 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:41,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:41,428 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:41,429 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:83, output treesize:31 [2021-03-10 21:59:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:41,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:41,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:41,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549756041] [2021-03-10 21:59:41,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:41,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:41,689 INFO L87 Difference]: Start difference. First operand 458 states and 1455 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:42,782 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 21:59:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:42,967 INFO L93 Difference]: Finished difference Result 643 states and 1989 transitions. [2021-03-10 21:59:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 21:59:42,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:42,970 INFO L225 Difference]: With dead ends: 643 [2021-03-10 21:59:42,970 INFO L226 Difference]: Without dead ends: 624 [2021-03-10 21:59:42,970 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1216.4ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:59:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-03-10 21:59:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 454. [2021-03-10 21:59:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.1766004415011038) internal successors, (1439), 453 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1439 transitions. [2021-03-10 21:59:42,975 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1439 transitions. Word has length 21 [2021-03-10 21:59:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:42,975 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 1439 transitions. [2021-03-10 21:59:42,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1439 transitions. [2021-03-10 21:59:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:42,976 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:42,976 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:43,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3587,299 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:43,176 INFO L428 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1740027667, now seen corresponding path program 299 times [2021-03-10 21:59:43,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:43,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708532471] [2021-03-10 21:59:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:43,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708532471] [2021-03-10 21:59:43,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408706535] [2021-03-10 21:59:43,508 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:43,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 21:59:43,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:43,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:59:43,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:43,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:43,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:43,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:43,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:43,772 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:43,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:43,832 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:43,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:43,838 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:59:44,174 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4], 1=[v_prenex_690, v_prenex_689]} [2021-03-10 21:59:44,180 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:44,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:44,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:44,227 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:59:44,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:44,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:44,235 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:44,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:44,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:44,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:44,280 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:44,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:44,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:44,319 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:15 [2021-03-10 21:59:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:44,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:44,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 21:59:44,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048459838] [2021-03-10 21:59:44,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 21:59:44,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:44,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 21:59:44,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:59:44,418 INFO L87 Difference]: Start difference. First operand 454 states and 1439 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:45,163 INFO L93 Difference]: Finished difference Result 588 states and 1830 transitions. [2021-03-10 21:59:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:59:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:45,166 INFO L225 Difference]: With dead ends: 588 [2021-03-10 21:59:45,166 INFO L226 Difference]: Without dead ends: 559 [2021-03-10 21:59:45,166 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 562.3ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-03-10 21:59:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-03-10 21:59:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 454. [2021-03-10 21:59:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.1766004415011038) internal successors, (1439), 453 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1439 transitions. [2021-03-10 21:59:45,171 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1439 transitions. Word has length 21 [2021-03-10 21:59:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:45,171 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 1439 transitions. [2021-03-10 21:59:45,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1439 transitions. [2021-03-10 21:59:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:45,172 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:45,172 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:45,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3597,300 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:45,372 INFO L428 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1460240711, now seen corresponding path program 300 times [2021-03-10 21:59:45,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:45,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505360244] [2021-03-10 21:59:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:45,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505360244] [2021-03-10 21:59:45,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109697491] [2021-03-10 21:59:45,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:45,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 21:59:45,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:45,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:59:45,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:45,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:45,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:45,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:45,954 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:45,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:45,966 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:45,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:45,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:45,975 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:46,210 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:59:46,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:46,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:46,229 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:205, output treesize:177 [2021-03-10 21:59:46,456 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-10 21:59:47,252 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2021-03-10 21:59:47,926 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_712, o_2, v_prenex_705, o_4, v_prenex_707, v_prenex_709, v_prenex_710, v_prenex_711], 1=[v_prenex_726, v_prenex_715, v_prenex_727, v_prenex_716, v_prenex_717, v_prenex_719, v_prenex_721, v_prenex_722]} [2021-03-10 21:59:47,936 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:47,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:48,543 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2021-03-10 21:59:48,544 INFO L628 ElimStorePlain]: treesize reduction 53, result has 83.7 percent of original size [2021-03-10 21:59:48,553 INFO L388 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 21 treesize of output 17 [2021-03-10 21:59:48,556 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:48,831 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-10 21:59:48,832 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:48,840 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:48,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:49,130 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-10 21:59:49,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:49,131 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:59:49,131 INFO L518 ElimStorePlain]: Eliminatee v_prenex_707 vanished before elimination [2021-03-10 21:59:49,140 INFO L388 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 21 treesize of output 17 [2021-03-10 21:59:49,143 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:49,422 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-10 21:59:49,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:49,423 INFO L518 ElimStorePlain]: Eliminatee v_prenex_710 vanished before elimination [2021-03-10 21:59:49,423 INFO L518 ElimStorePlain]: Eliminatee v_prenex_711 vanished before elimination [2021-03-10 21:59:49,423 INFO L518 ElimStorePlain]: Eliminatee v_prenex_726 vanished before elimination [2021-03-10 21:59:49,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:49,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 21:59:49,436 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:49,708 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-10 21:59:49,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:49,709 INFO L518 ElimStorePlain]: Eliminatee v_prenex_727 vanished before elimination [2021-03-10 21:59:49,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:49,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 21:59:49,722 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:49,984 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-10 21:59:49,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:49,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:49,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:49,997 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:50,254 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-10 21:59:50,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:50,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:50,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:50,267 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:50,522 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-10 21:59:50,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:50,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:50,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:50,535 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:51,021 WARN L205 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2021-03-10 21:59:51,022 INFO L628 ElimStorePlain]: treesize reduction 11, result has 93.9 percent of original size [2021-03-10 21:59:51,022 INFO L518 ElimStorePlain]: Eliminatee v_prenex_722 vanished before elimination [2021-03-10 21:59:51,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 16 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-03-10 21:59:51,026 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 32 variables, input treesize:337, output treesize:91 [2021-03-10 21:59:51,344 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2021-03-10 21:59:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:51,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:51,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 21:59:51,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936790402] [2021-03-10 21:59:51,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 21:59:51,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 21:59:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 21:59:51,534 INFO L87 Difference]: Start difference. First operand 454 states and 1439 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:52,637 WARN L205 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2021-03-10 21:59:53,176 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 21:59:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:53,388 INFO L93 Difference]: Finished difference Result 588 states and 1807 transitions. [2021-03-10 21:59:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 21:59:53,390 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:53,391 INFO L225 Difference]: With dead ends: 588 [2021-03-10 21:59:53,391 INFO L226 Difference]: Without dead ends: 534 [2021-03-10 21:59:53,391 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2204.6ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-03-10 21:59:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-03-10 21:59:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 451. [2021-03-10 21:59:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.18) internal successors, (1431), 450 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1431 transitions. [2021-03-10 21:59:53,396 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1431 transitions. Word has length 21 [2021-03-10 21:59:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:53,396 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 1431 transitions. [2021-03-10 21:59:53,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1431 transitions. [2021-03-10 21:59:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:53,397 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:53,397 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:53,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3619,301 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:53,597 INFO L428 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 835954947, now seen corresponding path program 301 times [2021-03-10 21:59:53,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:53,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174926903] [2021-03-10 21:59:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:53,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174926903] [2021-03-10 21:59:53,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013308700] [2021-03-10 21:59:53,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:53,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 21:59:53,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:54,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:54,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:54,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 21:59:54,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:54,235 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:54,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:54,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:54,304 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 21:59:54,304 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2021-03-10 21:59:54,429 INFO L446 ElimStorePlain]: Different costs {0=[o_2, o_4], 1=[v_prenex_731, v_prenex_732]} [2021-03-10 21:59:54,434 INFO L388 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 9 treesize of output 7 [2021-03-10 21:59:54,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:54,488 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:54,489 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:59:54,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:54,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:54,497 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:54,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:54,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:54,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 21:59:54,550 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:54,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:54,594 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 21:59:54,594 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:59, output treesize:24 [2021-03-10 21:59:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:54,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 21:59:54,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 21:59:54,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155005326] [2021-03-10 21:59:54,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 21:59:54,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:59:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 21:59:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:59:54,725 INFO L87 Difference]: Start difference. First operand 451 states and 1431 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:59:55,248 INFO L93 Difference]: Finished difference Result 591 states and 1838 transitions. [2021-03-10 21:59:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 21:59:55,250 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 [2021-03-10 21:59:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:59:55,251 INFO L225 Difference]: With dead ends: 591 [2021-03-10 21:59:55,251 INFO L226 Difference]: Without dead ends: 562 [2021-03-10 21:59:55,251 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 545.9ms TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 21:59:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-03-10 21:59:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 452. [2021-03-10 21:59:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.186252771618625) internal successors, (1437), 451 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1437 transitions. [2021-03-10 21:59:55,256 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1437 transitions. Word has length 21 [2021-03-10 21:59:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:59:55,256 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1437 transitions. [2021-03-10 21:59:55,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:59:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1437 transitions. [2021-03-10 21:59:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 21:59:55,257 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:59:55,257 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:59:55,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3654,302 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:55,457 INFO L428 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:59:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:59:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash 848958673, now seen corresponding path program 302 times [2021-03-10 21:59:55,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:59:55,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845522206] [2021-03-10 21:59:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:59:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:59:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:59:55,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845522206] [2021-03-10 21:59:55,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548746180] [2021-03-10 21:59:55,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 21:59:55,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 21:59:55,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 21:59:55,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 21:59:55,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:59:56,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:56,085 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:56,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:56,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:56,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:56,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:56,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:56,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:56,117 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:56,340 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 21:59:56,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:56,359 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2021-03-10 21:59:56,359 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:205, output treesize:177 [2021-03-10 21:59:56,598 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-10 21:59:56,960 INFO L446 ElimStorePlain]: Different costs {0=[o_2, v_prenex_739, o_4, v_prenex_740, v_prenex_741, v_prenex_742, v_prenex_743, v_prenex_744], 1=[v_prenex_745, v_prenex_746, v_prenex_747, v_prenex_759, v_prenex_748, v_prenex_749, v_prenex_760, v_prenex_750]} [2021-03-10 21:59:56,969 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:56,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:57,423 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-10 21:59:57,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:57,433 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:57,437 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:57,864 WARN L205 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-10 21:59:57,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:57,865 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 21:59:57,865 INFO L518 ElimStorePlain]: Eliminatee v_prenex_740 vanished before elimination [2021-03-10 21:59:57,874 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:57,878 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:58,297 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2021-03-10 21:59:58,298 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:58,299 INFO L518 ElimStorePlain]: Eliminatee v_prenex_742 vanished before elimination [2021-03-10 21:59:58,307 INFO L388 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 11 treesize of output 9 [2021-03-10 21:59:58,311 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:58,730 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-10 21:59:58,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:58,731 INFO L518 ElimStorePlain]: Eliminatee v_prenex_744 vanished before elimination [2021-03-10 21:59:58,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:58,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:58,746 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:59,209 WARN L205 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-10 21:59:59,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:59,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:59,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 21:59:59,224 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 21:59:59,639 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-03-10 21:59:59,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 21:59:59,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 21:59:59,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 21:59:59,655 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:00,452 WARN L205 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 118 [2021-03-10 22:00:00,453 INFO L628 ElimStorePlain]: treesize reduction 11, result has 96.4 percent of original size [2021-03-10 22:00:00,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:00,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:00,466 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:00,903 WARN L205 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-10 22:00:00,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:00,904 INFO L518 ElimStorePlain]: Eliminatee v_prenex_748 vanished before elimination [2021-03-10 22:00:00,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:00,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:00,918 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:01,356 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-10 22:00:01,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:01,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:01,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:01,370 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:01,792 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-10 22:00:01,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:01,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:01,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:01,806 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:02,295 WARN L205 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-10 22:00:02,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:02,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 16 dim-1 vars, End of recursive call: and 8 xjuncts. [2021-03-10 22:00:02,302 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 32 variables, input treesize:369, output treesize:158 [2021-03-10 22:00:02,920 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-03-10 22:00:03,181 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2021-03-10 22:00:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:03,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:03,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:03,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611184489] [2021-03-10 22:00:03,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:03,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:03,394 INFO L87 Difference]: Start difference. First operand 452 states and 1437 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:03,668 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2021-03-10 22:00:04,936 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-03-10 22:00:05,443 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2021-03-10 22:00:05,943 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2021-03-10 22:00:06,420 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 22:00:06,842 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2021-03-10 22:00:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:06,843 INFO L93 Difference]: Finished difference Result 732 states and 2213 transitions. [2021-03-10 22:00:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 22:00:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:06,844 INFO L225 Difference]: With dead ends: 732 [2021-03-10 22:00:06,844 INFO L226 Difference]: Without dead ends: 657 [2021-03-10 22:00:06,844 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3798.2ms TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2021-03-10 22:00:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-03-10 22:00:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 451. [2021-03-10 22:00:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.18) internal successors, (1431), 450 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1431 transitions. [2021-03-10 22:00:06,849 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1431 transitions. Word has length 21 [2021-03-10 22:00:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:06,849 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 1431 transitions. [2021-03-10 22:00:06,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1431 transitions. [2021-03-10 22:00:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:06,850 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:06,850 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:07,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3663,303 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:07,050 INFO L428 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -575151651, now seen corresponding path program 303 times [2021-03-10 22:00:07,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:07,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366554350] [2021-03-10 22:00:07,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:07,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366554350] [2021-03-10 22:00:07,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109885361] [2021-03-10 22:00:07,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:07,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:00:07,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:07,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:07,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:07,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:07,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:07,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:07,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:07,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:07,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:07,783 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:07,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:07,891 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:07,892 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:65 [2021-03-10 22:00:08,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:08,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 22:00:08,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:09,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:09,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:09,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 22:00:09,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:09,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:09,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:09,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:09,116 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:09,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:09,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:09,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:09,205 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:09,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:09,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:00:09,275 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:21 [2021-03-10 22:00:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:09,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:09,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:09,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919438957] [2021-03-10 22:00:09,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:09,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:09,445 INFO L87 Difference]: Start difference. First operand 451 states and 1431 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:10,180 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-03-10 22:00:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:10,524 INFO L93 Difference]: Finished difference Result 560 states and 1730 transitions. [2021-03-10 22:00:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 22:00:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:10,528 INFO L225 Difference]: With dead ends: 560 [2021-03-10 22:00:10,528 INFO L226 Difference]: Without dead ends: 541 [2021-03-10 22:00:10,528 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1332.4ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:00:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-03-10 22:00:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 455. [2021-03-10 22:00:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.1784140969162995) internal successors, (1443), 454 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1443 transitions. [2021-03-10 22:00:10,534 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1443 transitions. Word has length 21 [2021-03-10 22:00:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:10,534 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1443 transitions. [2021-03-10 22:00:10,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1443 transitions. [2021-03-10 22:00:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:10,535 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:10,535 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:10,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3673,304 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:10,739 INFO L428 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:10,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1686179165, now seen corresponding path program 304 times [2021-03-10 22:00:10,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:10,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793512134] [2021-03-10 22:00:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:11,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793512134] [2021-03-10 22:00:11,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107251148] [2021-03-10 22:00:11,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:11,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:00:11,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:11,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:11,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:11,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:11,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:11,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:11,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:11,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:11,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:11,577 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:11,684 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:00:11,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:11,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:11,696 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:65 [2021-03-10 22:00:12,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:12,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:12,099 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:12,202 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-03-10 22:00:12,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:12,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:12,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:12,214 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:12,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:12,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:12,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:12,320 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:12,411 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:12,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:12,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:12,421 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:12,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:12,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:00:12,515 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:83, output treesize:31 [2021-03-10 22:00:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:12,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:12,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:12,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719329484] [2021-03-10 22:00:12,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:12,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:12,797 INFO L87 Difference]: Start difference. First operand 455 states and 1443 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:13,849 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 22:00:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:14,017 INFO L93 Difference]: Finished difference Result 621 states and 1924 transitions. [2021-03-10 22:00:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 22:00:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:14,021 INFO L225 Difference]: With dead ends: 621 [2021-03-10 22:00:14,021 INFO L226 Difference]: Without dead ends: 602 [2021-03-10 22:00:14,021 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1199.0ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-03-10 22:00:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-03-10 22:00:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 442. [2021-03-10 22:00:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.163265306122449) internal successors, (1395), 441 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1395 transitions. [2021-03-10 22:00:14,026 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1395 transitions. Word has length 21 [2021-03-10 22:00:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:14,026 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 1395 transitions. [2021-03-10 22:00:14,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1395 transitions. [2021-03-10 22:00:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:14,027 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:14,027 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:14,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 305 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3699 [2021-03-10 22:00:14,227 INFO L428 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1990525963, now seen corresponding path program 305 times [2021-03-10 22:00:14,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:14,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391298104] [2021-03-10 22:00:14,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:14,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391298104] [2021-03-10 22:00:14,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153709682] [2021-03-10 22:00:14,633 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:14,654 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:00:14,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:14,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:14,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:15,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:15,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:15,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:15,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 22:00:15,057 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-03-10 22:00:15,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:15,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:15,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:15,196 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:15,326 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-03-10 22:00:15,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:15,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:15,341 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:15,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:15,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:15,353 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:15,456 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-03-10 22:00:15,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:15,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:00:15,459 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:31 [2021-03-10 22:00:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:15,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:15,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:15,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283850806] [2021-03-10 22:00:15,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:15,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:15,723 INFO L87 Difference]: Start difference. First operand 442 states and 1395 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:16,411 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 22:00:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:16,526 INFO L93 Difference]: Finished difference Result 522 states and 1621 transitions. [2021-03-10 22:00:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:00:16,529 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:16,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:16,530 INFO L225 Difference]: With dead ends: 522 [2021-03-10 22:00:16,530 INFO L226 Difference]: Without dead ends: 503 [2021-03-10 22:00:16,530 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1012.9ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:00:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-03-10 22:00:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 439. [2021-03-10 22:00:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.1666666666666665) internal successors, (1387), 438 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1387 transitions. [2021-03-10 22:00:16,534 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1387 transitions. Word has length 21 [2021-03-10 22:00:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:16,534 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 1387 transitions. [2021-03-10 22:00:16,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1387 transitions. [2021-03-10 22:00:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:16,535 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:16,535 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:16,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 306 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3707 [2021-03-10 22:00:16,736 INFO L428 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash 246230357, now seen corresponding path program 306 times [2021-03-10 22:00:16,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:16,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097907290] [2021-03-10 22:00:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:17,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097907290] [2021-03-10 22:00:17,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332178168] [2021-03-10 22:00:17,100 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:17,122 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:00:17,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:17,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:17,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:17,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:17,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:17,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:17,537 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:17,537 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:67 [2021-03-10 22:00:17,788 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_0]} [2021-03-10 22:00:17,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-03-10 22:00:17,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,807 INFO L388 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 10 treesize of output 8 [2021-03-10 22:00:17,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,817 INFO L388 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 10 treesize of output 8 [2021-03-10 22:00:17,821 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-03-10 22:00:17,830 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,976 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-03-10 22:00:17,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:17,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 22:00:17,987 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:17,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:17,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 22:00:17,996 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:18,143 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 22:00:18,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:18,150 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:18,150 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:133, output treesize:49 [2021-03-10 22:00:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:18,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:18,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:18,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145740267] [2021-03-10 22:00:18,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:18,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:18,476 INFO L87 Difference]: Start difference. First operand 439 states and 1387 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:19,528 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-03-10 22:00:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:19,610 INFO L93 Difference]: Finished difference Result 572 states and 1754 transitions. [2021-03-10 22:00:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:00:19,613 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:19,614 INFO L225 Difference]: With dead ends: 572 [2021-03-10 22:00:19,614 INFO L226 Difference]: Without dead ends: 514 [2021-03-10 22:00:19,614 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1023.7ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:00:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-03-10 22:00:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 439. [2021-03-10 22:00:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.1666666666666665) internal successors, (1387), 438 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1387 transitions. [2021-03-10 22:00:19,618 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1387 transitions. Word has length 21 [2021-03-10 22:00:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:19,619 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 1387 transitions. [2021-03-10 22:00:19,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1387 transitions. [2021-03-10 22:00:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:19,619 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:19,619 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:19,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 307 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3713 [2021-03-10 22:00:19,820 INFO L428 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -848468561, now seen corresponding path program 307 times [2021-03-10 22:00:19,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:19,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033610065] [2021-03-10 22:00:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:20,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033610065] [2021-03-10 22:00:20,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322130314] [2021-03-10 22:00:20,180 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:20,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:20,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:20,526 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:20,530 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:20,538 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:20,593 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:20,593 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:28 [2021-03-10 22:00:20,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:20,757 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,765 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:20,769 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:20,780 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,787 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:20,791 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,940 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:00:20,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:20,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:20,951 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:20,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:20,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:20,961 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:21,116 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-03-10 22:00:21,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:21,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:21,120 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:131, output treesize:45 [2021-03-10 22:00:21,270 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-03-10 22:00:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:21,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:21,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:21,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010392330] [2021-03-10 22:00:21,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:21,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:21,493 INFO L87 Difference]: Start difference. First operand 439 states and 1387 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:22,246 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 22:00:22,423 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2021-03-10 22:00:22,683 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 22:00:23,121 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2021-03-10 22:00:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:23,124 INFO L93 Difference]: Finished difference Result 585 states and 1806 transitions. [2021-03-10 22:00:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:00:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:23,128 INFO L225 Difference]: With dead ends: 585 [2021-03-10 22:00:23,128 INFO L226 Difference]: Without dead ends: 558 [2021-03-10 22:00:23,129 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1648.7ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-03-10 22:00:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-03-10 22:00:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 448. [2021-03-10 22:00:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.1767337807606264) internal successors, (1420), 447 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1420 transitions. [2021-03-10 22:00:23,133 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1420 transitions. Word has length 21 [2021-03-10 22:00:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:23,134 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1420 transitions. [2021-03-10 22:00:23,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1420 transitions. [2021-03-10 22:00:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:23,134 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:23,134 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:23,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3723,308 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:23,335 INFO L428 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1032284377, now seen corresponding path program 308 times [2021-03-10 22:00:23,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:23,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323382433] [2021-03-10 22:00:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:23,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323382433] [2021-03-10 22:00:23,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837442168] [2021-03-10 22:00:23,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:23,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:00:23,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:23,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 22:00:23,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:24,246 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2021-03-10 22:00:24,484 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_786, v_prenex_788], 1=[o_2, v_prenex_784]} [2021-03-10 22:00:24,491 INFO L388 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 17 treesize of output 13 [2021-03-10 22:00:24,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:24,616 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-03-10 22:00:24,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:24,624 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:24,628 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:24,745 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 22:00:24,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:24,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:24,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-03-10 22:00:24,757 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:24,864 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-03-10 22:00:24,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:24,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:24,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:24,876 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:24,980 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 22:00:24,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:24,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:00:24,987 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:117, output treesize:72 [2021-03-10 22:00:25,176 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 22:00:25,362 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_0]} [2021-03-10 22:00:25,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 22:00:25,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:25,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 22:00:25,388 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:25,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:25,401 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:25,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:25,413 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:25,715 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2021-03-10 22:00:25,716 INFO L628 ElimStorePlain]: treesize reduction 55, result has 63.1 percent of original size [2021-03-10 22:00:25,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:25,728 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:25,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:25,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 22:00:25,738 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:25,849 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:00:25,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:25,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:00:25,853 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:173, output treesize:39 [2021-03-10 22:00:26,065 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2021-03-10 22:00:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:26,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:26,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:26,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451586286] [2021-03-10 22:00:26,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:26,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:26,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:26,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:26,202 INFO L87 Difference]: Start difference. First operand 448 states and 1420 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:26,758 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-03-10 22:00:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:27,204 INFO L93 Difference]: Finished difference Result 535 states and 1653 transitions. [2021-03-10 22:00:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 22:00:27,207 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:27,207 INFO L225 Difference]: With dead ends: 535 [2021-03-10 22:00:27,207 INFO L226 Difference]: Without dead ends: 514 [2021-03-10 22:00:27,208 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1592.0ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:00:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-03-10 22:00:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 436. [2021-03-10 22:00:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 3.170114942528736) internal successors, (1379), 435 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1379 transitions. [2021-03-10 22:00:27,212 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1379 transitions. Word has length 21 [2021-03-10 22:00:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 1379 transitions. [2021-03-10 22:00:27,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1379 transitions. [2021-03-10 22:00:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:27,213 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:27,213 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:27,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 309 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3735 [2021-03-10 22:00:27,413 INFO L428 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1684577419, now seen corresponding path program 309 times [2021-03-10 22:00:27,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:27,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36807559] [2021-03-10 22:00:27,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:27,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36807559] [2021-03-10 22:00:27,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524861204] [2021-03-10 22:00:27,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:27,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:00:27,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:27,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:00:27,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:27,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:27,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:27,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:27,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:27,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 22:00:27,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2021-03-10 22:00:28,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:28,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:28,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-03-10 22:00:28,147 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:28,155 INFO L388 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 10 treesize of output 8 [2021-03-10 22:00:28,159 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:28,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:28,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:28,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 22:00:28,246 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:28,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:28,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:00:28,311 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:24 [2021-03-10 22:00:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:28,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:28,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:00:28,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338419901] [2021-03-10 22:00:28,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:00:28,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:28,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:00:28,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:00:28,461 INFO L87 Difference]: Start difference. First operand 436 states and 1379 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:29,337 INFO L93 Difference]: Finished difference Result 559 states and 1727 transitions. [2021-03-10 22:00:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:00:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:29,341 INFO L225 Difference]: With dead ends: 559 [2021-03-10 22:00:29,341 INFO L226 Difference]: Without dead ends: 523 [2021-03-10 22:00:29,341 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 508.3ms TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:00:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-03-10 22:00:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 437. [2021-03-10 22:00:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.1743119266055047) internal successors, (1384), 436 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1384 transitions. [2021-03-10 22:00:29,346 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1384 transitions. Word has length 21 [2021-03-10 22:00:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:29,346 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 1384 transitions. [2021-03-10 22:00:29,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1384 transitions. [2021-03-10 22:00:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:29,347 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:29,347 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:29,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3754,310 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:29,547 INFO L428 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1981843829, now seen corresponding path program 310 times [2021-03-10 22:00:29,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:29,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403174872] [2021-03-10 22:00:29,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:29,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403174872] [2021-03-10 22:00:29,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274175325] [2021-03-10 22:00:29,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:29,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:00:29,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:29,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:29,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:30,286 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[v_prenex_790]} [2021-03-10 22:00:30,294 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:30,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:30,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:30,371 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:30,436 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:30,436 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:39 [2021-03-10 22:00:30,604 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:30,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:30,625 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,633 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:30,638 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:30,650 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,860 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 22:00:30,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:30,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:30,873 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:30,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:30,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:30,883 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:31,078 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:00:31,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:31,082 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:31,082 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:153, output treesize:57 [2021-03-10 22:00:31,237 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:00:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:31,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:31,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:31,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074440515] [2021-03-10 22:00:31,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:31,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:31,620 INFO L87 Difference]: Start difference. First operand 437 states and 1384 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:33,089 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2021-03-10 22:00:33,337 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2021-03-10 22:00:33,678 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2021-03-10 22:00:34,080 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-03-10 22:00:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:34,351 INFO L93 Difference]: Finished difference Result 764 states and 2345 transitions. [2021-03-10 22:00:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 22:00:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:34,355 INFO L225 Difference]: With dead ends: 764 [2021-03-10 22:00:34,355 INFO L226 Difference]: Without dead ends: 722 [2021-03-10 22:00:34,355 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2135.9ms TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-03-10 22:00:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-03-10 22:00:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 452. [2021-03-10 22:00:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.190687361419069) internal successors, (1439), 451 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1439 transitions. [2021-03-10 22:00:34,361 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1439 transitions. Word has length 21 [2021-03-10 22:00:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:34,361 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1439 transitions. [2021-03-10 22:00:34,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1439 transitions. [2021-03-10 22:00:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:34,361 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:34,361 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:34,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 311 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3760 [2021-03-10 22:00:34,562 INFO L428 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1697581145, now seen corresponding path program 311 times [2021-03-10 22:00:34,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:34,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817093519] [2021-03-10 22:00:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:34,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817093519] [2021-03-10 22:00:34,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823710365] [2021-03-10 22:00:34,895 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:34,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:00:34,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:34,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:34,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:35,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:35,159 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,166 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:35,171 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,242 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:35,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:35,246 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:38 [2021-03-10 22:00:35,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:35,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,419 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:35,423 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:35,438 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,445 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:35,449 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,629 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 22:00:35,629 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:35,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:35,642 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:35,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:35,653 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:35,828 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:00:35,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:35,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:35,832 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:151, output treesize:57 [2021-03-10 22:00:35,969 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:00:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:36,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:36,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:36,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406165655] [2021-03-10 22:00:36,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:36,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:36,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:36,291 INFO L87 Difference]: Start difference. First operand 452 states and 1439 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:37,114 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:00:37,337 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2021-03-10 22:00:37,637 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-03-10 22:00:38,131 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-03-10 22:00:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:38,132 INFO L93 Difference]: Finished difference Result 629 states and 1928 transitions. [2021-03-10 22:00:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:00:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:38,133 INFO L225 Difference]: With dead ends: 629 [2021-03-10 22:00:38,133 INFO L226 Difference]: Without dead ends: 602 [2021-03-10 22:00:38,133 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1766.0ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-03-10 22:00:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-03-10 22:00:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 462. [2021-03-10 22:00:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 3.2039045553145336) internal successors, (1477), 461 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1477 transitions. [2021-03-10 22:00:38,138 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1477 transitions. Word has length 21 [2021-03-10 22:00:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:38,138 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 1477 transitions. [2021-03-10 22:00:38,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1477 transitions. [2021-03-10 22:00:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:38,139 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:38,139 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:38,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 312 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3771 [2021-03-10 22:00:38,339 INFO L428 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -263165821, now seen corresponding path program 312 times [2021-03-10 22:00:38,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:38,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380861511] [2021-03-10 22:00:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:38,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380861511] [2021-03-10 22:00:38,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889236967] [2021-03-10 22:00:38,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:38,704 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:00:38,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:38,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 22:00:38,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:38,973 INFO L446 ElimStorePlain]: Different costs {0=[o_2], 1=[v_prenex_791]} [2021-03-10 22:00:38,980 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:38,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:38,991 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:38,996 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:39,186 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 22:00:39,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:39,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:39,200 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:39,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:39,211 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:39,390 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 22:00:39,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:39,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:00:39,397 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:97 [2021-03-10 22:00:39,608 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-03-10 22:00:39,824 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_0]} [2021-03-10 22:00:39,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:39,835 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:39,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:39,847 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:39,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:39,859 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:39,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:39,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:39,869 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:40,467 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-03-10 22:00:40,468 INFO L628 ElimStorePlain]: treesize reduction 11, result has 93.8 percent of original size [2021-03-10 22:00:40,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:40,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:40,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:40,480 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:40,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:40,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:40,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:40,492 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:40,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:40,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:40,502 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:40,756 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-03-10 22:00:40,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:40,760 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:40,760 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:205, output treesize:78 [2021-03-10 22:00:40,927 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:00:41,132 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2021-03-10 22:00:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:41,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:41,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:41,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409384154] [2021-03-10 22:00:41,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:41,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:41,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:41,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:41,279 INFO L87 Difference]: Start difference. First operand 462 states and 1477 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:42,406 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-03-10 22:00:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:42,609 INFO L93 Difference]: Finished difference Result 604 states and 1870 transitions. [2021-03-10 22:00:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:00:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:42,612 INFO L225 Difference]: With dead ends: 604 [2021-03-10 22:00:42,612 INFO L226 Difference]: Without dead ends: 585 [2021-03-10 22:00:42,612 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1429.9ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:00:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-03-10 22:00:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 448. [2021-03-10 22:00:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.1946308724832213) internal successors, (1428), 447 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1428 transitions. [2021-03-10 22:00:42,617 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1428 transitions. Word has length 21 [2021-03-10 22:00:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:42,617 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1428 transitions. [2021-03-10 22:00:42,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1428 transitions. [2021-03-10 22:00:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:42,618 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:42,618 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:42,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3783,313 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:42,819 INFO L428 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash 282206833, now seen corresponding path program 313 times [2021-03-10 22:00:42,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:42,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205874017] [2021-03-10 22:00:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:42,968 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 8 [2021-03-10 22:00:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:43,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205874017] [2021-03-10 22:00:43,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278265618] [2021-03-10 22:00:43,274 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:43,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:43,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:43,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:43,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:43,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:43,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:43,562 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:43,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:43,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:43,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:43,653 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:38 [2021-03-10 22:00:44,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:44,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:44,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:44,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:44,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:44,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:44,122 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:44,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:44,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:44,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:44,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:44,227 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:44,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:44,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:44,237 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:44,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:44,320 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:00:44,321 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:25 [2021-03-10 22:00:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:44,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:44,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:44,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748294108] [2021-03-10 22:00:44,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:44,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:44,528 INFO L87 Difference]: Start difference. First operand 448 states and 1428 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:45,391 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2021-03-10 22:00:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:45,558 INFO L93 Difference]: Finished difference Result 560 states and 1729 transitions. [2021-03-10 22:00:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:00:45,560 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:45,561 INFO L225 Difference]: With dead ends: 560 [2021-03-10 22:00:45,562 INFO L226 Difference]: Without dead ends: 539 [2021-03-10 22:00:45,562 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1192.5ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-03-10 22:00:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-03-10 22:00:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 444. [2021-03-10 22:00:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.1963882618510158) internal successors, (1416), 443 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1416 transitions. [2021-03-10 22:00:45,567 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1416 transitions. Word has length 21 [2021-03-10 22:00:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:45,567 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 1416 transitions. [2021-03-10 22:00:45,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1416 transitions. [2021-03-10 22:00:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:45,567 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:45,567 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:45,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3795,314 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:45,768 INFO L428 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1436777849, now seen corresponding path program 314 times [2021-03-10 22:00:45,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:45,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211348707] [2021-03-10 22:00:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:46,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211348707] [2021-03-10 22:00:46,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232693020] [2021-03-10 22:00:46,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:46,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:00:46,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:46,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 22:00:46,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:46,479 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_795, v_prenex_797], 1=[o_2, v_prenex_793]} [2021-03-10 22:00:46,487 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:46,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:46,704 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-10 22:00:46,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:46,711 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:46,717 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:46,906 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-03-10 22:00:46,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:46,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:46,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:46,921 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:47,095 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-03-10 22:00:47,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:47,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:47,107 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:47,271 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-03-10 22:00:47,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:47,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:00:47,279 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:137, output treesize:99 [2021-03-10 22:00:47,622 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2021-03-10 22:00:47,835 INFO L446 ElimStorePlain]: Different costs {1=[o_4], 3=[o_0]} [2021-03-10 22:00:47,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:47,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:47,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:47,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:47,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:47,873 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:47,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:47,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:47,883 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:48,419 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2021-03-10 22:00:48,420 INFO L628 ElimStorePlain]: treesize reduction 11, result has 93.3 percent of original size [2021-03-10 22:00:48,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:48,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:48,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:48,432 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:48,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:48,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:48,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:48,444 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:48,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:48,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:48,454 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:48,672 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-03-10 22:00:48,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:48,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:48,676 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:193, output treesize:78 [2021-03-10 22:00:48,840 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-03-10 22:00:49,014 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2021-03-10 22:00:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:49,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:49,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:49,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626338380] [2021-03-10 22:00:49,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:49,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:49,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:49,159 INFO L87 Difference]: Start difference. First operand 444 states and 1416 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:50,094 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 22:00:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:50,258 INFO L93 Difference]: Finished difference Result 554 states and 1707 transitions. [2021-03-10 22:00:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:00:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:50,262 INFO L225 Difference]: With dead ends: 554 [2021-03-10 22:00:50,262 INFO L226 Difference]: Without dead ends: 533 [2021-03-10 22:00:50,262 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1573.0ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:00:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-03-10 22:00:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 438. [2021-03-10 22:00:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.1784897025171626) internal successors, (1389), 437 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1389 transitions. [2021-03-10 22:00:50,267 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1389 transitions. Word has length 21 [2021-03-10 22:00:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:50,267 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1389 transitions. [2021-03-10 22:00:50,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1389 transitions. [2021-03-10 22:00:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:50,267 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:50,267 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:50,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3805,315 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:50,468 INFO L428 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1694849269, now seen corresponding path program 315 times [2021-03-10 22:00:50,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:50,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679641246] [2021-03-10 22:00:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:50,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679641246] [2021-03-10 22:00:50,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25897262] [2021-03-10 22:00:50,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:50,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:00:50,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:50,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:00:50,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:51,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:51,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:51,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:51,034 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:51,042 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:51,046 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:51,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:51,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:51,108 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:37 [2021-03-10 22:00:51,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:51,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:51,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:51,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:51,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:51,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 22:00:51,366 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:51,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:51,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:00:51,394 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2021-03-10 22:00:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:51,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:51,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:00:51,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176011350] [2021-03-10 22:00:51,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:00:51,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:51,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:00:51,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:00:51,460 INFO L87 Difference]: Start difference. First operand 438 states and 1389 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:52,074 INFO L93 Difference]: Finished difference Result 526 states and 1640 transitions. [2021-03-10 22:00:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:00:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:52,077 INFO L225 Difference]: With dead ends: 526 [2021-03-10 22:00:52,078 INFO L226 Difference]: Without dead ends: 504 [2021-03-10 22:00:52,078 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 504.1ms TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:00:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-03-10 22:00:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 444. [2021-03-10 22:00:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.1828442437923252) internal successors, (1410), 443 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1410 transitions. [2021-03-10 22:00:52,082 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1410 transitions. Word has length 21 [2021-03-10 22:00:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:52,082 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 1410 transitions. [2021-03-10 22:00:52,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1410 transitions. [2021-03-10 22:00:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:52,083 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:52,083 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:52,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3815,316 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:52,283 INFO L428 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1974793909, now seen corresponding path program 316 times [2021-03-10 22:00:52,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:52,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593631671] [2021-03-10 22:00:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:52,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593631671] [2021-03-10 22:00:52,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842275065] [2021-03-10 22:00:52,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:52,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:00:52,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:52,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:52,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:52,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:52,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:52,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:52,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:52,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:52,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:52,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:52,972 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:00:52,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:52,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 22:00:52,978 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 22:00:53,534 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:00:53,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:53,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:53,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-03-10 22:00:53,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:53,555 INFO L388 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 11 treesize of output 9 [2021-03-10 22:00:53,560 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:53,567 INFO L388 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 21 treesize of output 17 [2021-03-10 22:00:53,571 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:53,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:53,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:53,582 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:53,723 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-03-10 22:00:53,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:53,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:53,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:53,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 22:00:53,738 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:53,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:53,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:53,749 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:53,893 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-03-10 22:00:53,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:53,899 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:00:53,899 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:137, output treesize:34 [2021-03-10 22:00:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:54,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:54,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:54,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585299489] [2021-03-10 22:00:54,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:54,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:54,261 INFO L87 Difference]: Start difference. First operand 444 states and 1410 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:55,262 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2021-03-10 22:00:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:00:55,819 INFO L93 Difference]: Finished difference Result 605 states and 1883 transitions. [2021-03-10 22:00:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 22:00:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:00:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:00:55,822 INFO L225 Difference]: With dead ends: 605 [2021-03-10 22:00:55,822 INFO L226 Difference]: Without dead ends: 578 [2021-03-10 22:00:55,822 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1407.4ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-03-10 22:00:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-03-10 22:00:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 444. [2021-03-10 22:00:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.1783295711060946) internal successors, (1408), 443 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1408 transitions. [2021-03-10 22:00:55,827 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1408 transitions. Word has length 21 [2021-03-10 22:00:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:00:55,827 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 1408 transitions. [2021-03-10 22:00:55,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1408 transitions. [2021-03-10 22:00:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:00:55,828 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:00:55,828 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:00:56,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 317 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3822 [2021-03-10 22:00:56,028 INFO L428 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:00:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:00:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2035910703, now seen corresponding path program 317 times [2021-03-10 22:00:56,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:00:56,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60188176] [2021-03-10 22:00:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:00:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:00:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:56,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60188176] [2021-03-10 22:00:56,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012079599] [2021-03-10 22:00:56,400 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:00:56,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:00:56,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:00:56,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:00:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:00:56,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:56,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:56,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:56,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:56,646 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:56,650 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:56,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:56,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:56,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:00:56,663 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:56,669 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:56,673 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:56,848 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:00:56,849 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:56,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:00:56,854 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:145, output treesize:97 [2021-03-10 22:00:57,070 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-03-10 22:00:57,438 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:00:57,445 INFO L388 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 9 treesize of output 7 [2021-03-10 22:00:57,450 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:57,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:57,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:57,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 22:00:57,463 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:57,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:57,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:00:57,475 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:57,578 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-03-10 22:00:57,578 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:57,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:57,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:57,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:00:57,594 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:57,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:00:57,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 22:00:57,607 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:00:57,709 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-03-10 22:00:57,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:00:57,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:00:57,715 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:105, output treesize:26 [2021-03-10 22:00:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:00:58,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:00:58,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:00:58,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603396529] [2021-03-10 22:00:58,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:00:58,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:00:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:00:58,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:00:58,010 INFO L87 Difference]: Start difference. First operand 444 states and 1408 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:00:58,279 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:00:58,797 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2021-03-10 22:00:59,510 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-03-10 22:01:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:00,013 INFO L93 Difference]: Finished difference Result 691 states and 2139 transitions. [2021-03-10 22:01:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 22:01:00,015 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:00,016 INFO L225 Difference]: With dead ends: 691 [2021-03-10 22:01:00,017 INFO L226 Difference]: Without dead ends: 664 [2021-03-10 22:01:00,017 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1980.4ms TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-03-10 22:01:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-03-10 22:01:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 450. [2021-03-10 22:01:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.1826280623608016) internal successors, (1429), 449 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1429 transitions. [2021-03-10 22:01:00,022 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1429 transitions. Word has length 21 [2021-03-10 22:01:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:00,022 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1429 transitions. [2021-03-10 22:01:00,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1429 transitions. [2021-03-10 22:01:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:00,023 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:00,023 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:00,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3840,318 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:00,223 INFO L428 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash -572664753, now seen corresponding path program 318 times [2021-03-10 22:01:00,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:00,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215019393] [2021-03-10 22:01:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:00,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215019393] [2021-03-10 22:01:00,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022035254] [2021-03-10 22:01:00,645 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:00,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:01:00,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:00,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:00,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:00,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:00,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:00,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:00,886 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:00,894 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:00,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:00,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:00,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:00,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:00,913 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:00,920 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:00,925 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:01,125 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:01:01,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:01,131 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:01:01,131 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:145, output treesize:97 [2021-03-10 22:01:01,367 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-03-10 22:01:01,950 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:01:01,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:01,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:01,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 22:01:01,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:01,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:01,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:01,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:02,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:02,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:02,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:02,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 22:01:02,087 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:02,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:02,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:02,100 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:02,197 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:02,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:02,202 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:21 [2021-03-10 22:01:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:02,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:02,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:02,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645613774] [2021-03-10 22:01:02,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:02,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:02,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:02,466 INFO L87 Difference]: Start difference. First operand 450 states and 1429 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:02,739 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2021-03-10 22:01:03,240 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2021-03-10 22:01:03,841 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-03-10 22:01:04,182 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2021-03-10 22:01:04,688 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2021-03-10 22:01:05,179 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2021-03-10 22:01:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:05,411 INFO L93 Difference]: Finished difference Result 660 states and 2009 transitions. [2021-03-10 22:01:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 22:01:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:05,415 INFO L225 Difference]: With dead ends: 660 [2021-03-10 22:01:05,415 INFO L226 Difference]: Without dead ends: 618 [2021-03-10 22:01:05,415 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3197.2ms TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-03-10 22:01:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-03-10 22:01:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 449. [2021-03-10 22:01:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.189732142857143) internal successors, (1429), 448 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1429 transitions. [2021-03-10 22:01:05,420 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1429 transitions. Word has length 21 [2021-03-10 22:01:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:05,421 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 1429 transitions. [2021-03-10 22:01:05,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1429 transitions. [2021-03-10 22:01:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:05,421 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:05,421 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:05,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 319 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3855 [2021-03-10 22:01:05,621 INFO L428 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash -550160381, now seen corresponding path program 319 times [2021-03-10 22:01:05,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:05,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994175185] [2021-03-10 22:01:05,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:05,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994175185] [2021-03-10 22:01:05,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162067264] [2021-03-10 22:01:05,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:05,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:01:05,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:06,199 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:06,203 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:06,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:06,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:06,212 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:06,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:06,273 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:06,274 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:37 [2021-03-10 22:01:06,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:06,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:06,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:06,440 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:06,447 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:06,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:06,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:06,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:06,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 22:01:06,530 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:06,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:06,602 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:06,602 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:65, output treesize:21 [2021-03-10 22:01:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:06,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:06,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:01:06,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113020746] [2021-03-10 22:01:06,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:01:06,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:01:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:01:06,758 INFO L87 Difference]: Start difference. First operand 449 states and 1429 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:07,456 INFO L93 Difference]: Finished difference Result 580 states and 1813 transitions. [2021-03-10 22:01:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:01:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:07,460 INFO L225 Difference]: With dead ends: 580 [2021-03-10 22:01:07,460 INFO L226 Difference]: Without dead ends: 551 [2021-03-10 22:01:07,460 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 552.9ms TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:01:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-03-10 22:01:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 449. [2021-03-10 22:01:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.189732142857143) internal successors, (1429), 448 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1429 transitions. [2021-03-10 22:01:07,465 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1429 transitions. Word has length 21 [2021-03-10 22:01:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:07,465 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 1429 transitions. [2021-03-10 22:01:07,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1429 transitions. [2021-03-10 22:01:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:07,466 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:07,466 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:07,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3874,320 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:07,666 INFO L428 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -252893971, now seen corresponding path program 320 times [2021-03-10 22:01:07,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:07,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862191703] [2021-03-10 22:01:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:08,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862191703] [2021-03-10 22:01:08,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162331097] [2021-03-10 22:01:08,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:08,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:01:08,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:08,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:08,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:08,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:08,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:08,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:08,287 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:08,393 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:01:08,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:08,398 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:08,398 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-03-10 22:01:08,742 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:01:08,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:08,757 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:08,764 INFO L388 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 11 treesize of output 9 [2021-03-10 22:01:08,768 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:08,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:08,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:08,780 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:08,788 INFO L388 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 11 treesize of output 9 [2021-03-10 22:01:08,792 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:08,995 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-03-10 22:01:08,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:09,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:09,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:09,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:09,010 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:09,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:09,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:09,022 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:09,226 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 22:01:09,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:09,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:01:09,231 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:153, output treesize:57 [2021-03-10 22:01:09,396 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:01:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:09,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:09,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:09,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661724304] [2021-03-10 22:01:09,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:09,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:09,733 INFO L87 Difference]: Start difference. First operand 449 states and 1429 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:10,802 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:01:11,043 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 22:01:11,373 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 22:01:11,800 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 22:01:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:11,980 INFO L93 Difference]: Finished difference Result 648 states and 2007 transitions. [2021-03-10 22:01:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 22:01:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:11,984 INFO L225 Difference]: With dead ends: 648 [2021-03-10 22:01:11,984 INFO L226 Difference]: Without dead ends: 606 [2021-03-10 22:01:11,984 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2157.2ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-03-10 22:01:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-03-10 22:01:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 448. [2021-03-10 22:01:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.19910514541387) internal successors, (1430), 447 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1430 transitions. [2021-03-10 22:01:11,990 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1430 transitions. Word has length 21 [2021-03-10 22:01:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:11,990 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1430 transitions. [2021-03-10 22:01:11,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1430 transitions. [2021-03-10 22:01:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:11,990 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:11,990 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:12,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3883,321 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:12,191 INFO L428 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash -537156655, now seen corresponding path program 321 times [2021-03-10 22:01:12,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:12,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377244436] [2021-03-10 22:01:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:12,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377244436] [2021-03-10 22:01:12,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974126157] [2021-03-10 22:01:12,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:12,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:01:12,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:12,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:12,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:12,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:12,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:12,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:12,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:12,834 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:12,839 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:12,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:12,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:12,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:12,854 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:12,861 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:12,865 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,060 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:01:13,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:13,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:01:13,066 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:145, output treesize:97 [2021-03-10 22:01:13,304 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-03-10 22:01:13,401 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:01:13,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:13,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:13,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:13,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,426 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:13,430 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,438 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:13,443 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:13,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:13,455 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,655 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-03-10 22:01:13,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:13,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:13,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:13,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:13,670 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:13,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:13,682 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:13,876 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 22:01:13,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:13,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:01:13,881 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:153, output treesize:57 [2021-03-10 22:01:14,035 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:01:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:14,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:14,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:14,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053159594] [2021-03-10 22:01:14,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:14,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:14,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:14,393 INFO L87 Difference]: Start difference. First operand 448 states and 1430 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:15,378 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:01:15,613 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2021-03-10 22:01:15,935 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-03-10 22:01:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:16,157 INFO L93 Difference]: Finished difference Result 631 states and 1917 transitions. [2021-03-10 22:01:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 22:01:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:16,160 INFO L225 Difference]: With dead ends: 631 [2021-03-10 22:01:16,161 INFO L226 Difference]: Without dead ends: 604 [2021-03-10 22:01:16,161 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1769.7ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-03-10 22:01:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2021-03-10 22:01:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 451. [2021-03-10 22:01:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.2088888888888887) internal successors, (1444), 450 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1444 transitions. [2021-03-10 22:01:16,166 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1444 transitions. Word has length 21 [2021-03-10 22:01:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:16,166 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 1444 transitions. [2021-03-10 22:01:16,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1444 transitions. [2021-03-10 22:01:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:16,166 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:16,167 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:16,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3895,322 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:16,367 INFO L428 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1538533135, now seen corresponding path program 322 times [2021-03-10 22:01:16,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:16,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114288200] [2021-03-10 22:01:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:16,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114288200] [2021-03-10 22:01:16,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132093456] [2021-03-10 22:01:16,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:16,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:01:16,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:16,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:16,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:16,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:16,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:16,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:16,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:16,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:16,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:16,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:16,967 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:16,973 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:16,977 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:16,984 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:16,989 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:17,189 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:01:17,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:17,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2021-03-10 22:01:17,195 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:145, output treesize:97 [2021-03-10 22:01:17,443 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-03-10 22:01:17,701 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:01:17,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:17,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:17,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:17,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:17,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:17,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:17,724 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:17,833 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-03-10 22:01:17,834 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:17,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:17,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:17,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:17,847 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:17,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:17,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:17,858 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:17,966 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:01:17,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:17,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:17,970 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:31 [2021-03-10 22:01:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:18,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:18,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:18,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74325312] [2021-03-10 22:01:18,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:18,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:18,308 INFO L87 Difference]: Start difference. First operand 451 states and 1444 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:19,252 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-03-10 22:01:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:19,418 INFO L93 Difference]: Finished difference Result 563 states and 1749 transitions. [2021-03-10 22:01:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:01:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:19,422 INFO L225 Difference]: With dead ends: 563 [2021-03-10 22:01:19,422 INFO L226 Difference]: Without dead ends: 542 [2021-03-10 22:01:19,422 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1259.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:01:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-03-10 22:01:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 447. [2021-03-10 22:01:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.1995515695067263) internal successors, (1427), 446 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1427 transitions. [2021-03-10 22:01:19,427 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1427 transitions. Word has length 21 [2021-03-10 22:01:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:19,427 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 1427 transitions. [2021-03-10 22:01:19,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1427 transitions. [2021-03-10 22:01:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:19,427 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:19,428 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:19,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 323 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3907 [2021-03-10 22:01:19,628 INFO L428 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1147084563, now seen corresponding path program 323 times [2021-03-10 22:01:19,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:19,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999708747] [2021-03-10 22:01:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:19,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999708747] [2021-03-10 22:01:19,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209281790] [2021-03-10 22:01:19,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:19,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-03-10 22:01:19,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:19,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:01:19,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:20,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:20,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:20,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:20,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:20,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 22:01:20,180 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-03-10 22:01:20,346 INFO L388 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 10 treesize of output 8 [2021-03-10 22:01:20,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:20,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:20,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-03-10 22:01:20,362 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:20,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:20,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:20,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 5 [2021-03-10 22:01:20,445 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:20,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:20,520 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:20,520 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:65, output treesize:21 [2021-03-10 22:01:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:20,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:20,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:01:20,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977557128] [2021-03-10 22:01:20,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:01:20,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:01:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:01:20,679 INFO L87 Difference]: Start difference. First operand 447 states and 1427 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:21,298 INFO L93 Difference]: Finished difference Result 554 states and 1734 transitions. [2021-03-10 22:01:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:01:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:21,302 INFO L225 Difference]: With dead ends: 554 [2021-03-10 22:01:21,302 INFO L226 Difference]: Without dead ends: 518 [2021-03-10 22:01:21,302 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 514.1ms TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:01:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-03-10 22:01:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 448. [2021-03-10 22:01:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.203579418344519) internal successors, (1432), 447 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1432 transitions. [2021-03-10 22:01:21,306 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1432 transitions. Word has length 21 [2021-03-10 22:01:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:21,307 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1432 transitions. [2021-03-10 22:01:21,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1432 transitions. [2021-03-10 22:01:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:21,307 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:21,307 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:21,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 324 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3916 [2021-03-10 22:01:21,508 INFO L428 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1444350973, now seen corresponding path program 324 times [2021-03-10 22:01:21,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:21,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023798232] [2021-03-10 22:01:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:21,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023798232] [2021-03-10 22:01:21,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410360199] [2021-03-10 22:01:21,891 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:21,913 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-03-10 22:01:21,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:21,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:21,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:22,160 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:22,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:22,175 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:22,242 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:22,242 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:37 [2021-03-10 22:01:22,394 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:22,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,406 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:22,410 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:22,425 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:22,436 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,635 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 22:01:22,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:22,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:22,648 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:22,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:22,658 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:22,848 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:01:22,849 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:22,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:01:22,853 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:149, output treesize:57 [2021-03-10 22:01:23,015 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:01:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:23,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:23,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:23,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314153507] [2021-03-10 22:01:23,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:23,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:23,359 INFO L87 Difference]: Start difference. First operand 448 states and 1432 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:24,531 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:01:24,783 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-03-10 22:01:25,133 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 22:01:25,565 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 22:01:26,142 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-03-10 22:01:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:26,144 INFO L93 Difference]: Finished difference Result 708 states and 2199 transitions. [2021-03-10 22:01:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-10 22:01:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:26,145 INFO L225 Difference]: With dead ends: 708 [2021-03-10 22:01:26,145 INFO L226 Difference]: Without dead ends: 666 [2021-03-10 22:01:26,145 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2448.9ms TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2021-03-10 22:01:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-03-10 22:01:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 463. [2021-03-10 22:01:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 3.2186147186147185) internal successors, (1487), 462 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1487 transitions. [2021-03-10 22:01:26,150 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1487 transitions. Word has length 21 [2021-03-10 22:01:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:26,151 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 1487 transitions. [2021-03-10 22:01:26,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1487 transitions. [2021-03-10 22:01:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:26,151 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:26,151 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:26,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3922,325 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:26,351 INFO L428 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1160088289, now seen corresponding path program 325 times [2021-03-10 22:01:26,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:26,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310063001] [2021-03-10 22:01:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:26,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310063001] [2021-03-10 22:01:26,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790457257] [2021-03-10 22:01:26,685 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:26,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:26,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:26,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:26,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:26,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:26,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:26,933 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:26,938 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:27,013 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:27,013 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:39 [2021-03-10 22:01:27,176 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:27,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,188 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:27,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:27,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:27,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:27,207 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:27,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:27,219 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,423 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 22:01:27,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:27,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:27,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:27,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:27,436 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:27,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:27,447 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:27,636 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:01:27,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:27,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:01:27,640 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:153, output treesize:57 [2021-03-10 22:01:27,798 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:01:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:28,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:28,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:28,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592837577] [2021-03-10 22:01:28,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:28,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:28,143 INFO L87 Difference]: Start difference. First operand 463 states and 1487 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:28,910 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:01:29,135 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2021-03-10 22:01:29,459 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-03-10 22:01:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:29,655 INFO L93 Difference]: Finished difference Result 605 states and 1886 transitions. [2021-03-10 22:01:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 22:01:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:29,659 INFO L225 Difference]: With dead ends: 605 [2021-03-10 22:01:29,659 INFO L226 Difference]: Without dead ends: 578 [2021-03-10 22:01:29,659 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1578.5ms TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-03-10 22:01:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-03-10 22:01:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 469. [2021-03-10 22:01:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.215811965811966) internal successors, (1505), 468 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1505 transitions. [2021-03-10 22:01:29,664 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1505 transitions. Word has length 21 [2021-03-10 22:01:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:29,664 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 1505 transitions. [2021-03-10 22:01:29,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1505 transitions. [2021-03-10 22:01:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:29,665 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:29,665 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:29,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 326 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3933 [2021-03-10 22:01:29,865 INFO L428 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -800658677, now seen corresponding path program 326 times [2021-03-10 22:01:29,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:29,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522347702] [2021-03-10 22:01:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:30,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522347702] [2021-03-10 22:01:30,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023261721] [2021-03-10 22:01:30,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:30,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:01:30,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:30,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:30,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:30,460 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:30,464 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:30,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:30,474 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:30,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:30,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:30,539 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:37 [2021-03-10 22:01:30,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:30,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:30,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:30,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:30,918 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:01:30,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:30,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:30,932 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:30,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:30,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:30,942 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:31,055 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:01:31,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:31,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:31,061 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:31 [2021-03-10 22:01:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:31,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:31,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:31,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767009308] [2021-03-10 22:01:31,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:31,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:31,435 INFO L87 Difference]: Start difference. First operand 469 states and 1505 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:32,462 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-03-10 22:01:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:32,644 INFO L93 Difference]: Finished difference Result 560 states and 1752 transitions. [2021-03-10 22:01:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:01:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:32,648 INFO L225 Difference]: With dead ends: 560 [2021-03-10 22:01:32,648 INFO L226 Difference]: Without dead ends: 541 [2021-03-10 22:01:32,648 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1013.1ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:01:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-03-10 22:01:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 455. [2021-03-10 22:01:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.20704845814978) internal successors, (1456), 454 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1456 transitions. [2021-03-10 22:01:32,654 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1456 transitions. Word has length 21 [2021-03-10 22:01:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:32,654 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1456 transitions. [2021-03-10 22:01:32,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1456 transitions. [2021-03-10 22:01:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:32,654 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:32,654 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:32,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 327 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3946 [2021-03-10 22:01:32,855 INFO L428 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -255286023, now seen corresponding path program 327 times [2021-03-10 22:01:32,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:32,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934828600] [2021-03-10 22:01:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:33,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934828600] [2021-03-10 22:01:33,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101962439] [2021-03-10 22:01:33,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:33,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:01:33,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:33,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:33,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:33,604 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:33,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:33,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:33,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:33,619 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:33,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:33,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:33,708 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:39 [2021-03-10 22:01:34,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:34,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:34,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:34,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:34,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:34,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:34,112 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:34,227 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:01:34,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:34,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:34,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:34,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:34,240 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:34,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:34,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:34,250 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:34,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:34,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:34,352 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:25 [2021-03-10 22:01:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:34,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:34,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:34,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216166441] [2021-03-10 22:01:34,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:34,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:34,582 INFO L87 Difference]: Start difference. First operand 455 states and 1456 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:35,399 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2021-03-10 22:01:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:35,537 INFO L93 Difference]: Finished difference Result 569 states and 1771 transitions. [2021-03-10 22:01:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:01:35,540 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:35,541 INFO L225 Difference]: With dead ends: 569 [2021-03-10 22:01:35,541 INFO L226 Difference]: Without dead ends: 548 [2021-03-10 22:01:35,541 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1193.9ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-03-10 22:01:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-03-10 22:01:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 455. [2021-03-10 22:01:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.2158590308370045) internal successors, (1460), 454 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1460 transitions. [2021-03-10 22:01:35,546 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1460 transitions. Word has length 21 [2021-03-10 22:01:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:35,546 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1460 transitions. [2021-03-10 22:01:35,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1460 transitions. [2021-03-10 22:01:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:35,546 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:35,546 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:35,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3955,328 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:35,747 INFO L428 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1974270705, now seen corresponding path program 328 times [2021-03-10 22:01:35,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:35,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481684503] [2021-03-10 22:01:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:36,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481684503] [2021-03-10 22:01:36,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956881535] [2021-03-10 22:01:36,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:36,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:01:36,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:36,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:36,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:36,331 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:36,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:36,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:36,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:36,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:36,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:36,418 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:39 [2021-03-10 22:01:36,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:36,628 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:36,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:36,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:36,762 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:01:36,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:36,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:36,774 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:36,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:36,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:36,785 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:36,893 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-03-10 22:01:36,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:36,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:36,897 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:31 [2021-03-10 22:01:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:37,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:37,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:37,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695421468] [2021-03-10 22:01:37,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:37,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:37,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:37,246 INFO L87 Difference]: Start difference. First operand 455 states and 1460 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:38,122 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-03-10 22:01:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:38,288 INFO L93 Difference]: Finished difference Result 569 states and 1771 transitions. [2021-03-10 22:01:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:01:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:38,292 INFO L225 Difference]: With dead ends: 569 [2021-03-10 22:01:38,292 INFO L226 Difference]: Without dead ends: 548 [2021-03-10 22:01:38,292 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1033.8ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:01:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-03-10 22:01:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 451. [2021-03-10 22:01:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.2066666666666666) internal successors, (1443), 450 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1443 transitions. [2021-03-10 22:01:38,297 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1443 transitions. Word has length 21 [2021-03-10 22:01:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:38,297 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 1443 transitions. [2021-03-10 22:01:38,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1443 transitions. [2021-03-10 22:01:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:38,297 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:38,297 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:38,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 329 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3965 [2021-03-10 22:01:38,498 INFO L428 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -577883527, now seen corresponding path program 329 times [2021-03-10 22:01:38,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:38,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623824760] [2021-03-10 22:01:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:38,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623824760] [2021-03-10 22:01:38,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449287740] [2021-03-10 22:01:38,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:38,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:01:38,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:38,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:38,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:39,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:39,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:39,224 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:39,337 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-03-10 22:01:39,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:39,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:39,342 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:65 [2021-03-10 22:01:39,847 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:01:39,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:39,861 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:39,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-03-10 22:01:39,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:39,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:39,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:39,974 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:39,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:39,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-03-10 22:01:39,987 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:40,077 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:40,082 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:40,082 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:21 [2021-03-10 22:01:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:40,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:40,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:40,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261331653] [2021-03-10 22:01:40,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:40,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:40,304 INFO L87 Difference]: Start difference. First operand 451 states and 1443 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:40,745 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2021-03-10 22:01:41,025 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2021-03-10 22:01:41,226 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2021-03-10 22:01:41,686 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-03-10 22:01:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:41,894 INFO L93 Difference]: Finished difference Result 625 states and 1953 transitions. [2021-03-10 22:01:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 22:01:41,897 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:41,898 INFO L225 Difference]: With dead ends: 625 [2021-03-10 22:01:41,898 INFO L226 Difference]: Without dead ends: 604 [2021-03-10 22:01:41,899 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1853.9ms TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2021-03-10 22:01:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2021-03-10 22:01:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 455. [2021-03-10 22:01:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 3.2048458149779737) internal successors, (1455), 454 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1455 transitions. [2021-03-10 22:01:41,904 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1455 transitions. Word has length 21 [2021-03-10 22:01:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:41,904 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 1455 transitions. [2021-03-10 22:01:41,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1455 transitions. [2021-03-10 22:01:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:41,904 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:41,905 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:42,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3972,330 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:42,105 INFO L428 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:42,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1907811689, now seen corresponding path program 330 times [2021-03-10 22:01:42,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:42,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627526227] [2021-03-10 22:01:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:42,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627526227] [2021-03-10 22:01:42,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569954744] [2021-03-10 22:01:42,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:42,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:01:42,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:42,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:42,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:42,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:42,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:42,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:42,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:42,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:42,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:42,746 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:42,861 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-03-10 22:01:42,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:42,867 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-03-10 22:01:42,868 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:65 [2021-03-10 22:01:43,099 INFO L446 ElimStorePlain]: Different costs {1=[o_2], 3=[o_0]} [2021-03-10 22:01:43,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:43,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:43,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:43,112 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:43,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:43,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:43,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:43,244 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-03-10 22:01:43,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:43,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:43,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:43,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:43,259 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:43,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:43,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:43,271 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:43,386 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:01:43,387 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:43,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:43,390 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:31 [2021-03-10 22:01:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:43,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:43,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:43,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247176389] [2021-03-10 22:01:43,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:43,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:43,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:43,751 INFO L87 Difference]: Start difference. First operand 455 states and 1455 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:44,547 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-03-10 22:01:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:44,676 INFO L93 Difference]: Finished difference Result 556 states and 1735 transitions. [2021-03-10 22:01:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:01:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:44,680 INFO L225 Difference]: With dead ends: 556 [2021-03-10 22:01:44,680 INFO L226 Difference]: Without dead ends: 535 [2021-03-10 22:01:44,680 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1077.6ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:01:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-03-10 22:01:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 452. [2021-03-10 22:01:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.199556541019956) internal successors, (1443), 451 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1443 transitions. [2021-03-10 22:01:44,685 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1443 transitions. Word has length 21 [2021-03-10 22:01:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:44,685 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1443 transitions. [2021-03-10 22:01:44,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1443 transitions. [2021-03-10 22:01:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:44,686 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:44,686 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:44,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 331 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3985 [2021-03-10 22:01:44,886 INFO L428 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1472074119, now seen corresponding path program 331 times [2021-03-10 22:01:44,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:44,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174932477] [2021-03-10 22:01:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:45,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174932477] [2021-03-10 22:01:45,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236273091] [2021-03-10 22:01:45,239 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:45,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:45,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:45,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-10 22:01:45,525 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:45,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:45,552 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-03-10 22:01:45,553 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2021-03-10 22:01:45,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:45,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:45,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:45,660 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:45,779 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-03-10 22:01:45,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:45,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:45,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:45,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-10 22:01:45,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-03-10 22:01:45,803 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:45,915 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-03-10 22:01:45,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:45,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:45,919 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:31 [2021-03-10 22:01:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:46,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:46,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:46,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353648135] [2021-03-10 22:01:46,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:46,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:46,276 INFO L87 Difference]: Start difference. First operand 452 states and 1443 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:47,195 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-03-10 22:01:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:47,354 INFO L93 Difference]: Finished difference Result 556 states and 1721 transitions. [2021-03-10 22:01:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:01:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:47,359 INFO L225 Difference]: With dead ends: 556 [2021-03-10 22:01:47,359 INFO L226 Difference]: Without dead ends: 535 [2021-03-10 22:01:47,359 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1019.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:01:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-03-10 22:01:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 442. [2021-03-10 22:01:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.179138321995465) internal successors, (1402), 441 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1402 transitions. [2021-03-10 22:01:47,363 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1402 transitions. Word has length 21 [2021-03-10 22:01:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:47,364 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 1402 transitions. [2021-03-10 22:01:47,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1402 transitions. [2021-03-10 22:01:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:47,364 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:47,364 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:47,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3992,332 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:47,565 INFO L428 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1119238299, now seen corresponding path program 332 times [2021-03-10 22:01:47,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:47,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581229947] [2021-03-10 22:01:47,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:47,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581229947] [2021-03-10 22:01:47,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683198139] [2021-03-10 22:01:47,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:47,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:01:47,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:47,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 22:01:47,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:48,052 INFO L388 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 17 treesize of output 13 [2021-03-10 22:01:48,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,064 INFO L388 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 17 treesize of output 13 [2021-03-10 22:01:48,068 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,075 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:48,080 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,085 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:48,090 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,199 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:01:48,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:48,203 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:01:48,203 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:57 [2021-03-10 22:01:48,353 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:01:48,685 INFO L388 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 26 treesize of output 20 [2021-03-10 22:01:48,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:48,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,705 INFO L388 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 26 treesize of output 20 [2021-03-10 22:01:48,709 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:48,719 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:48,842 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2021-03-10 22:01:48,843 INFO L628 ElimStorePlain]: treesize reduction 42, result has 39.1 percent of original size [2021-03-10 22:01:48,843 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:01:48,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:48,845 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:129, output treesize:27 [2021-03-10 22:01:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:49,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:49,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 22:01:49,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836213005] [2021-03-10 22:01:49,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 22:01:49,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 22:01:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:01:49,073 INFO L87 Difference]: Start difference. First operand 442 states and 1402 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:49,510 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2021-03-10 22:01:49,748 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2021-03-10 22:01:50,119 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2021-03-10 22:01:50,289 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2021-03-10 22:01:50,576 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2021-03-10 22:01:50,873 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2021-03-10 22:01:51,304 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-03-10 22:01:51,711 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2021-03-10 22:01:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:51,917 INFO L93 Difference]: Finished difference Result 974 states and 2891 transitions. [2021-03-10 22:01:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 22:01:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:51,921 INFO L225 Difference]: With dead ends: 974 [2021-03-10 22:01:51,921 INFO L226 Difference]: Without dead ends: 908 [2021-03-10 22:01:51,922 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2811.7ms TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-03-10 22:01:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-03-10 22:01:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 450. [2021-03-10 22:01:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.1848552338530065) internal successors, (1430), 449 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1430 transitions. [2021-03-10 22:01:51,928 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1430 transitions. Word has length 21 [2021-03-10 22:01:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:51,928 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1430 transitions. [2021-03-10 22:01:51,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1430 transitions. [2021-03-10 22:01:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:51,929 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:51,929 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:52,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 333 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3997 [2021-03-10 22:01:52,129 INFO L428 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1085940175, now seen corresponding path program 333 times [2021-03-10 22:01:52,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:52,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97378801] [2021-03-10 22:01:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:52,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97378801] [2021-03-10 22:01:52,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454850466] [2021-03-10 22:01:52,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:52,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:01:52,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:52,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:52,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:52,589 INFO L388 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 17 treesize of output 13 [2021-03-10 22:01:52,592 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:52,600 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:52,605 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:52,610 INFO L388 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 17 treesize of output 13 [2021-03-10 22:01:52,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:52,620 INFO L388 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 9 treesize of output 7 [2021-03-10 22:01:52,624 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:52,726 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:01:52,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:52,729 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:01:52,730 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:57 [2021-03-10 22:01:52,870 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:01:53,201 INFO L388 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 26 treesize of output 20 [2021-03-10 22:01:53,205 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:53,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:53,214 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:53,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:53,252 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:01:53,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:53,254 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:01:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:53,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:53,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:01:53,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131488536] [2021-03-10 22:01:53,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:01:53,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:53,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:01:53,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:01:53,484 INFO L87 Difference]: Start difference. First operand 450 states and 1430 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:54,364 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:01:54,833 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:01:55,045 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2021-03-10 22:01:55,458 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:01:55,816 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2021-03-10 22:01:56,205 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 22:01:56,600 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 22:01:57,064 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-03-10 22:01:57,512 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-03-10 22:01:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:01:57,784 INFO L93 Difference]: Finished difference Result 853 states and 2597 transitions. [2021-03-10 22:01:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 22:01:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:01:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:01:57,787 INFO L225 Difference]: With dead ends: 853 [2021-03-10 22:01:57,787 INFO L226 Difference]: Without dead ends: 815 [2021-03-10 22:01:57,787 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 3394.9ms TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2021-03-10 22:01:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2021-03-10 22:01:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 456. [2021-03-10 22:01:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.1934065934065936) internal successors, (1453), 455 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1453 transitions. [2021-03-10 22:01:57,793 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1453 transitions. Word has length 21 [2021-03-10 22:01:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:01:57,793 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 1453 transitions. [2021-03-10 22:01:57,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1453 transitions. [2021-03-10 22:01:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:01:57,793 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:01:57,793 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:01:57,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4005,334 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:57,994 INFO L428 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:01:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:01:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2042705297, now seen corresponding path program 334 times [2021-03-10 22:01:57,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:01:57,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629884368] [2021-03-10 22:01:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:01:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:01:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:58,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629884368] [2021-03-10 22:01:58,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906055033] [2021-03-10 22:01:58,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:01:58,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:01:58,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:01:58,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:01:58,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:01:58,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:58,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:58,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:58,388 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:58,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:58,466 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:01:58,466 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 22:01:58,905 INFO L388 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 21 treesize of output 17 [2021-03-10 22:01:58,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:58,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:01:58,920 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:58,927 INFO L388 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 28 treesize of output 22 [2021-03-10 22:01:58,931 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:58,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 22:01:58,939 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:01:58,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:01:58,972 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:01:58,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:01:58,975 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:16 [2021-03-10 22:01:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:01:59,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:01:59,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:01:59,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10289293] [2021-03-10 22:01:59,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:01:59,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:01:59,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:01:59,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:01:59,171 INFO L87 Difference]: Start difference. First operand 456 states and 1453 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:01:59,524 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:01:59,801 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2021-03-10 22:02:00,111 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2021-03-10 22:02:00,325 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:02:00,740 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:02:01,018 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2021-03-10 22:02:01,168 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2021-03-10 22:02:01,608 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 22:02:01,907 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-03-10 22:02:02,232 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2021-03-10 22:02:02,460 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2021-03-10 22:02:02,873 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-03-10 22:02:03,196 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-03-10 22:02:03,527 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 22:02:04,116 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-03-10 22:02:04,414 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2021-03-10 22:02:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:04,659 INFO L93 Difference]: Finished difference Result 1004 states and 3070 transitions. [2021-03-10 22:02:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-03-10 22:02:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:04,664 INFO L225 Difference]: With dead ends: 1004 [2021-03-10 22:02:04,664 INFO L226 Difference]: Without dead ends: 932 [2021-03-10 22:02:04,664 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 4923.4ms TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2021-03-10 22:02:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-03-10 22:02:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 457. [2021-03-10 22:02:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.18640350877193) internal successors, (1453), 456 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1453 transitions. [2021-03-10 22:02:04,671 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1453 transitions. Word has length 21 [2021-03-10 22:02:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:04,671 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 1453 transitions. [2021-03-10 22:02:04,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1453 transitions. [2021-03-10 22:02:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:04,671 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:04,671 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:04,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4014,335 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:04,872 INFO L428 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -856760017, now seen corresponding path program 335 times [2021-03-10 22:02:04,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:04,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348935016] [2021-03-10 22:02:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:05,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348935016] [2021-03-10 22:02:05,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97569043] [2021-03-10 22:02:05,207 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:05,229 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:02:05,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:05,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:05,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:05,355 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:05,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:05,367 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:05,372 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:05,378 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:05,381 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:05,387 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:05,392 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:05,501 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:02:05,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:05,505 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:02:05,505 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:57 [2021-03-10 22:02:05,652 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:02:06,006 INFO L388 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 26 treesize of output 20 [2021-03-10 22:02:06,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:06,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:06,021 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:06,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:06,058 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:06,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:06,061 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:02:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:06,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:06,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:02:06,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333105474] [2021-03-10 22:02:06,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:02:06,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:02:06,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:02:06,258 INFO L87 Difference]: Start difference. First operand 457 states and 1453 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:07,157 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-03-10 22:02:07,580 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:02:07,980 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:02:08,998 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:02:09,363 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2021-03-10 22:02:09,548 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2021-03-10 22:02:10,286 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 22:02:10,664 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2021-03-10 22:02:10,922 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2021-03-10 22:02:11,379 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 22:02:11,793 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-03-10 22:02:12,051 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-03-10 22:02:12,752 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-03-10 22:02:13,118 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-03-10 22:02:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:13,393 INFO L93 Difference]: Finished difference Result 1054 states and 3240 transitions. [2021-03-10 22:02:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-03-10 22:02:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:13,398 INFO L225 Difference]: With dead ends: 1054 [2021-03-10 22:02:13,398 INFO L226 Difference]: Without dead ends: 1016 [2021-03-10 22:02:13,398 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 5838.7ms TimeCoverageRelationStatistics Valid=415, Invalid=1937, Unknown=0, NotChecked=0, Total=2352 [2021-03-10 22:02:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-03-10 22:02:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 467. [2021-03-10 22:02:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 3.1974248927038627) internal successors, (1490), 466 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1490 transitions. [2021-03-10 22:02:13,405 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1490 transitions. Word has length 21 [2021-03-10 22:02:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:13,405 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 1490 transitions. [2021-03-10 22:02:13,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1490 transitions. [2021-03-10 22:02:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:13,405 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:13,405 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:13,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4021,336 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:13,606 INFO L428 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 829631823, now seen corresponding path program 336 times [2021-03-10 22:02:13,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:13,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903285917] [2021-03-10 22:02:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:13,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903285917] [2021-03-10 22:02:13,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390239040] [2021-03-10 22:02:13,918 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:13,939 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:02:13,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:13,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:13,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:14,020 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:14,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:14,029 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:14,034 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:14,066 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:14,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:14,068 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:02:14,301 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:14,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:14,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:14,316 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:14,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:14,346 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:14,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:14,348 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2021-03-10 22:02:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:14,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:14,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:02:14,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675501113] [2021-03-10 22:02:14,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:02:14,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:02:14,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:02:14,573 INFO L87 Difference]: Start difference. First operand 467 states and 1490 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:15,494 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-03-10 22:02:15,983 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:02:16,419 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2021-03-10 22:02:17,197 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 22:02:17,409 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2021-03-10 22:02:18,221 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2021-03-10 22:02:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:18,744 INFO L93 Difference]: Finished difference Result 1029 states and 3134 transitions. [2021-03-10 22:02:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-03-10 22:02:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:18,749 INFO L225 Difference]: With dead ends: 1029 [2021-03-10 22:02:18,749 INFO L226 Difference]: Without dead ends: 1006 [2021-03-10 22:02:18,750 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2956.9ms TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2021-03-10 22:02:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-03-10 22:02:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 470. [2021-03-10 22:02:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.211087420042644) internal successors, (1506), 469 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1506 transitions. [2021-03-10 22:02:18,756 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1506 transitions. Word has length 21 [2021-03-10 22:02:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:18,756 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 1506 transitions. [2021-03-10 22:02:18,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1506 transitions. [2021-03-10 22:02:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:18,757 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:18,757 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:18,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 337 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4030 [2021-03-10 22:02:18,957 INFO L428 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:18,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1493592683, now seen corresponding path program 337 times [2021-03-10 22:02:18,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:18,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381705456] [2021-03-10 22:02:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:19,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381705456] [2021-03-10 22:02:19,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364709091] [2021-03-10 22:02:19,218 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:19,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:19,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:19,325 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:19,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:19,334 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:19,338 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:19,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:19,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:19,371 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:02:19,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:19,489 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:19,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:19,500 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:19,501 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:19,502 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 22:02:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:19,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:19,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 22:02:19,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535343028] [2021-03-10 22:02:19,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 22:02:19,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 22:02:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-10 22:02:19,552 INFO L87 Difference]: Start difference. First operand 470 states and 1506 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:20,442 INFO L93 Difference]: Finished difference Result 884 states and 2718 transitions. [2021-03-10 22:02:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 22:02:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:20,447 INFO L225 Difference]: With dead ends: 884 [2021-03-10 22:02:20,447 INFO L226 Difference]: Without dead ends: 862 [2021-03-10 22:02:20,447 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 520.6ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:02:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-03-10 22:02:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 473. [2021-03-10 22:02:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.207627118644068) internal successors, (1514), 472 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1514 transitions. [2021-03-10 22:02:20,453 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1514 transitions. Word has length 21 [2021-03-10 22:02:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:20,453 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 1514 transitions. [2021-03-10 22:02:20,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1514 transitions. [2021-03-10 22:02:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:20,454 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:20,454 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:20,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4037,338 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:20,654 INFO L428 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -920621675, now seen corresponding path program 338 times [2021-03-10 22:02:20,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:20,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130321085] [2021-03-10 22:02:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:20,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130321085] [2021-03-10 22:02:20,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691426809] [2021-03-10 22:02:20,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:20,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:02:20,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:20,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:20,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:21,201 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:21,205 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,214 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:21,218 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,227 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:21,232 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,239 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:21,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,373 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:02:21,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:21,377 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:02:21,378 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:57 [2021-03-10 22:02:21,554 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-03-10 22:02:21,853 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:21,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:21,872 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,879 INFO L388 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 26 treesize of output 20 [2021-03-10 22:02:21,884 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:21,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:21,946 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:21,948 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:02:21,948 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:30 [2021-03-10 22:02:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:22,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:22,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 22:02:22,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036038413] [2021-03-10 22:02:22,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 22:02:22,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 22:02:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:02:22,349 INFO L87 Difference]: Start difference. First operand 473 states and 1514 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:22,881 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2021-03-10 22:02:23,258 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2021-03-10 22:02:23,461 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2021-03-10 22:02:23,768 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-03-10 22:02:24,113 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2021-03-10 22:02:24,586 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2021-03-10 22:02:24,822 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2021-03-10 22:02:25,306 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2021-03-10 22:02:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:25,567 INFO L93 Difference]: Finished difference Result 1032 states and 3105 transitions. [2021-03-10 22:02:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 22:02:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:25,571 INFO L225 Difference]: With dead ends: 1032 [2021-03-10 22:02:25,571 INFO L226 Difference]: Without dead ends: 974 [2021-03-10 22:02:25,571 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3257.9ms TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-03-10 22:02:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-03-10 22:02:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 464. [2021-03-10 22:02:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.200863930885529) internal successors, (1482), 463 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1482 transitions. [2021-03-10 22:02:25,578 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1482 transitions. Word has length 21 [2021-03-10 22:02:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:25,578 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 1482 transitions. [2021-03-10 22:02:25,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1482 transitions. [2021-03-10 22:02:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:25,579 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:25,579 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:25,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 339 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4041 [2021-03-10 22:02:25,779 INFO L428 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash -294750883, now seen corresponding path program 339 times [2021-03-10 22:02:25,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:25,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750088919] [2021-03-10 22:02:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:26,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750088919] [2021-03-10 22:02:26,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586957924] [2021-03-10 22:02:26,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:26,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:02:26,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:26,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:26,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:26,243 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:26,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:26,252 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:26,256 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:26,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:26,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:26,319 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-03-10 22:02:26,635 INFO L388 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 26 treesize of output 20 [2021-03-10 22:02:26,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:26,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:26,649 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:26,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:26,689 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:26,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:26,692 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:02:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:26,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:26,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:02:26,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810842074] [2021-03-10 22:02:26,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:02:26,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:02:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:02:26,899 INFO L87 Difference]: Start difference. First operand 464 states and 1482 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:27,694 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-03-10 22:02:28,093 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:02:29,370 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2021-03-10 22:02:30,077 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 22:02:30,371 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2021-03-10 22:02:31,155 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2021-03-10 22:02:31,408 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 22:02:32,064 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2021-03-10 22:02:32,436 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2021-03-10 22:02:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:32,682 INFO L93 Difference]: Finished difference Result 961 states and 2937 transitions. [2021-03-10 22:02:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-03-10 22:02:32,686 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:32,687 INFO L225 Difference]: With dead ends: 961 [2021-03-10 22:02:32,687 INFO L226 Difference]: Without dead ends: 923 [2021-03-10 22:02:32,688 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 4556.0ms TimeCoverageRelationStatistics Valid=379, Invalid=1691, Unknown=0, NotChecked=0, Total=2070 [2021-03-10 22:02:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-03-10 22:02:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 472. [2021-03-10 22:02:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.1974522292993632) internal successors, (1506), 471 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1506 transitions. [2021-03-10 22:02:32,694 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1506 transitions. Word has length 21 [2021-03-10 22:02:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:32,694 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 1506 transitions. [2021-03-10 22:02:32,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1506 transitions. [2021-03-10 22:02:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:32,695 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:32,695 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:32,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 340 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4053 [2021-03-10 22:02:32,895 INFO L428 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -96134259, now seen corresponding path program 340 times [2021-03-10 22:02:32,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:32,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563809353] [2021-03-10 22:02:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:33,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563809353] [2021-03-10 22:02:33,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101822938] [2021-03-10 22:02:33,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:33,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:02:33,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:33,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:33,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:33,336 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:33,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:33,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:33,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:33,358 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-03-10 22:02:33,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:33,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:33,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:33,431 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:33,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:33,496 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:33,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:33,499 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 22:02:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:33,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:33,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:02:33,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114878254] [2021-03-10 22:02:33,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:02:33,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:02:33,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:02:33,826 INFO L87 Difference]: Start difference. First operand 472 states and 1506 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:34,746 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2021-03-10 22:02:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:34,921 INFO L93 Difference]: Finished difference Result 603 states and 1881 transitions. [2021-03-10 22:02:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:02:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:34,925 INFO L225 Difference]: With dead ends: 603 [2021-03-10 22:02:34,925 INFO L226 Difference]: Without dead ends: 584 [2021-03-10 22:02:34,925 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 932.3ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:02:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-03-10 22:02:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 469. [2021-03-10 22:02:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.200854700854701) internal successors, (1498), 468 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1498 transitions. [2021-03-10 22:02:34,930 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1498 transitions. Word has length 21 [2021-03-10 22:02:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:34,930 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 1498 transitions. [2021-03-10 22:02:34,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1498 transitions. [2021-03-10 22:02:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:34,931 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:34,931 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:35,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 341 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4061 [2021-03-10 22:02:35,131 INFO L428 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1012015205, now seen corresponding path program 341 times [2021-03-10 22:02:35,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:35,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723197046] [2021-03-10 22:02:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:35,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723197046] [2021-03-10 22:02:35,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821586768] [2021-03-10 22:02:35,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:35,419 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:02:35,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:35,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:35,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:35,559 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:35,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:35,569 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:35,574 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:35,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:35,608 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:35,608 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:02:35,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:35,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:35,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:35,727 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:35,729 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:35,730 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-03-10 22:02:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:35,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:35,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 22:02:35,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766755359] [2021-03-10 22:02:35,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 22:02:35,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 22:02:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-10 22:02:35,781 INFO L87 Difference]: Start difference. First operand 469 states and 1498 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:36,563 INFO L93 Difference]: Finished difference Result 736 states and 2263 transitions. [2021-03-10 22:02:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:36,567 INFO L225 Difference]: With dead ends: 736 [2021-03-10 22:02:36,567 INFO L226 Difference]: Without dead ends: 714 [2021-03-10 22:02:36,568 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 517.2ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-03-10 22:02:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-03-10 22:02:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 476. [2021-03-10 22:02:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.2042105263157894) internal successors, (1522), 475 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1522 transitions. [2021-03-10 22:02:36,573 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1522 transitions. Word has length 21 [2021-03-10 22:02:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:36,573 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 1522 transitions. [2021-03-10 22:02:36,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1522 transitions. [2021-03-10 22:02:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:36,574 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:36,574 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:36,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4066,342 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:36,774 INFO L428 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1436087115, now seen corresponding path program 342 times [2021-03-10 22:02:36,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:36,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36067728] [2021-03-10 22:02:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:37,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36067728] [2021-03-10 22:02:37,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058227371] [2021-03-10 22:02:37,021 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:37,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 22:02:37,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:37,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:37,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:37,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:37,196 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:37,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:37,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:37,214 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-03-10 22:02:37,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:37,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:37,376 INFO L388 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 11 treesize of output 9 [2021-03-10 22:02:37,381 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:37,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:37,393 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:37,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:37,395 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2021-03-10 22:02:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:37,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:37,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 22:02:37,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961283943] [2021-03-10 22:02:37,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 22:02:37,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 22:02:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 22:02:37,447 INFO L87 Difference]: Start difference. First operand 476 states and 1522 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:38,460 INFO L93 Difference]: Finished difference Result 744 states and 2283 transitions. [2021-03-10 22:02:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:38,463 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:38,464 INFO L225 Difference]: With dead ends: 744 [2021-03-10 22:02:38,464 INFO L226 Difference]: Without dead ends: 711 [2021-03-10 22:02:38,464 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 511.3ms TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:02:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-03-10 22:02:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 476. [2021-03-10 22:02:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.1978947368421053) internal successors, (1519), 475 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1519 transitions. [2021-03-10 22:02:38,470 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1519 transitions. Word has length 21 [2021-03-10 22:02:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:38,470 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 1519 transitions. [2021-03-10 22:02:38,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1519 transitions. [2021-03-10 22:02:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:38,470 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:38,471 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:38,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4069,343 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:38,671 INFO L428 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1402199153, now seen corresponding path program 343 times [2021-03-10 22:02:38,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:38,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594577607] [2021-03-10 22:02:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:39,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594577607] [2021-03-10 22:02:39,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166073167] [2021-03-10 22:02:39,012 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-10 22:02:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:39,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:39,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:39,226 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:39,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:39,239 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:39,245 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:39,288 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:39,291 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:39,291 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:02:39,360 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:39,366 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:39,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:39,378 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:39,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:39,421 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:39,424 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:39,424 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 22:02:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:39,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:39,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-03-10 22:02:39,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918430043] [2021-03-10 22:02:39,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 22:02:39,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 22:02:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-10 22:02:39,553 INFO L87 Difference]: Start difference. First operand 476 states and 1519 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:40,556 INFO L93 Difference]: Finished difference Result 782 states and 2401 transitions. [2021-03-10 22:02:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-10 22:02:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:40,562 INFO L225 Difference]: With dead ends: 782 [2021-03-10 22:02:40,562 INFO L226 Difference]: Without dead ends: 753 [2021-03-10 22:02:40,562 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 612.3ms TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:02:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-03-10 22:02:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 477. [2021-03-10 22:02:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.203781512605042) internal successors, (1525), 476 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1525 transitions. [2021-03-10 22:02:40,568 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1525 transitions. Word has length 21 [2021-03-10 22:02:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:40,568 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 1525 transitions. [2021-03-10 22:02:40,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1525 transitions. [2021-03-10 22:02:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:40,569 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:40,569 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:40,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4072,344 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:40,769 INFO L428 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1798069225, now seen corresponding path program 344 times [2021-03-10 22:02:40,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:40,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591442329] [2021-03-10 22:02:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:41,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591442329] [2021-03-10 22:02:41,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041877237] [2021-03-10 22:02:41,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:41,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:02:41,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:41,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:41,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:41,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:41,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:41,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:41,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:41,266 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-03-10 22:02:41,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:41,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:41,372 INFO L388 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 11 treesize of output 9 [2021-03-10 22:02:41,377 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:41,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:41,414 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:41,416 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:41,416 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:13 [2021-03-10 22:02:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:41,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:41,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 22:02:41,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878724570] [2021-03-10 22:02:41,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 22:02:41,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 22:02:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-03-10 22:02:41,594 INFO L87 Difference]: Start difference. First operand 477 states and 1525 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:42,929 INFO L93 Difference]: Finished difference Result 739 states and 2265 transitions. [2021-03-10 22:02:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:42,934 INFO L225 Difference]: With dead ends: 739 [2021-03-10 22:02:42,934 INFO L226 Difference]: Without dead ends: 712 [2021-03-10 22:02:42,934 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 656.4ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:02:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-03-10 22:02:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 472. [2021-03-10 22:02:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.1974522292993632) internal successors, (1506), 471 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1506 transitions. [2021-03-10 22:02:42,939 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1506 transitions. Word has length 21 [2021-03-10 22:02:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:42,940 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 1506 transitions. [2021-03-10 22:02:42,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1506 transitions. [2021-03-10 22:02:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:42,940 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:42,940 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:43,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 345 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4076 [2021-03-10 22:02:43,141 INFO L428 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 704584967, now seen corresponding path program 345 times [2021-03-10 22:02:43,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:43,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738636951] [2021-03-10 22:02:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:43,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738636951] [2021-03-10 22:02:43,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045878296] [2021-03-10 22:02:43,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:43,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:02:43,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:43,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:43,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:43,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:43,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:43,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:43,592 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:43,592 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2021-03-10 22:02:43,670 INFO L388 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 18 treesize of output 14 [2021-03-10 22:02:43,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:43,679 INFO L388 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 10 treesize of output 8 [2021-03-10 22:02:43,683 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:43,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:43,712 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:43,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:43,715 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 22:02:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:43,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:43,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 22:02:43,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138314834] [2021-03-10 22:02:43,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 22:02:43,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 22:02:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-10 22:02:43,812 INFO L87 Difference]: Start difference. First operand 472 states and 1506 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:44,754 INFO L93 Difference]: Finished difference Result 749 states and 2297 transitions. [2021-03-10 22:02:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:44,759 INFO L225 Difference]: With dead ends: 749 [2021-03-10 22:02:44,759 INFO L226 Difference]: Without dead ends: 713 [2021-03-10 22:02:44,759 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 507.7ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-03-10 22:02:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-03-10 22:02:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 473. [2021-03-10 22:02:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2012711864406778) internal successors, (1511), 472 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1511 transitions. [2021-03-10 22:02:44,764 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1511 transitions. Word has length 21 [2021-03-10 22:02:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:44,764 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 1511 transitions. [2021-03-10 22:02:44,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:44,765 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1511 transitions. [2021-03-10 22:02:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:44,765 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:44,765 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:44,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4082,346 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:44,965 INFO L428 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash -390113951, now seen corresponding path program 346 times [2021-03-10 22:02:44,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:44,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393325160] [2021-03-10 22:02:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:45,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393325160] [2021-03-10 22:02:45,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204065050] [2021-03-10 22:02:45,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:45,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:02:45,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:45,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:45,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:45,463 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:45,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:45,474 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:45,479 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:45,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:45,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:45,515 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:02:45,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:45,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:45,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:45,653 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:45,786 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:02:45,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:45,793 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:45,798 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:45,805 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:45,810 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:45,917 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-03-10 22:02:45,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:45,919 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:45,919 INFO L518 ElimStorePlain]: Eliminatee v_prenex_816 vanished before elimination [2021-03-10 22:02:45,921 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:02:45,921 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:45 [2021-03-10 22:02:46,078 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-03-10 22:02:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:46,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:46,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 22:02:46,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765244203] [2021-03-10 22:02:46,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 22:02:46,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 22:02:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-03-10 22:02:46,324 INFO L87 Difference]: Start difference. First operand 473 states and 1511 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 22:02:47,179 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:02:47,614 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-03-10 22:02:47,870 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-03-10 22:02:48,233 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-03-10 22:02:48,832 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2021-03-10 22:02:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:48,842 INFO L93 Difference]: Finished difference Result 790 states and 2412 transitions. [2021-03-10 22:02:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:02:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 21 [2021-03-10 22:02:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:48,847 INFO L225 Difference]: With dead ends: 790 [2021-03-10 22:02:48,847 INFO L226 Difference]: Without dead ends: 763 [2021-03-10 22:02:48,847 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2121.5ms TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-03-10 22:02:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2021-03-10 22:02:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 485. [2021-03-10 22:02:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 3.225206611570248) internal successors, (1561), 484 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1561 transitions. [2021-03-10 22:02:48,853 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1561 transitions. Word has length 21 [2021-03-10 22:02:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:48,853 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 1561 transitions. [2021-03-10 22:02:48,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 22:02:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1561 transitions. [2021-03-10 22:02:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:48,854 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:48,854 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:49,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 347 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4085 [2021-03-10 22:02:49,062 INFO L428 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1490638987, now seen corresponding path program 347 times [2021-03-10 22:02:49,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:49,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095331485] [2021-03-10 22:02:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:49,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095331485] [2021-03-10 22:02:49,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622932940] [2021-03-10 22:02:49,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:49,346 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:02:49,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:49,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:49,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:49,514 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:49,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:49,523 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:49,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:49,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:49,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:49,557 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:02:49,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:49,698 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:49,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:49,708 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:49,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:49,770 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:49,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:49,773 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:25 [2021-03-10 22:02:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:50,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:50,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 22:02:50,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714427741] [2021-03-10 22:02:50,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 22:02:50,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 22:02:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-03-10 22:02:50,034 INFO L87 Difference]: Start difference. First operand 485 states and 1561 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 22:02:51,408 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-03-10 22:02:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:51,631 INFO L93 Difference]: Finished difference Result 750 states and 2297 transitions. [2021-03-10 22:02:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:02:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) Word has length 21 [2021-03-10 22:02:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:51,636 INFO L225 Difference]: With dead ends: 750 [2021-03-10 22:02:51,636 INFO L226 Difference]: Without dead ends: 729 [2021-03-10 22:02:51,636 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1066.3ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-03-10 22:02:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2021-03-10 22:02:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 468. [2021-03-10 22:02:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 3.2141327623126337) internal successors, (1501), 467 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1501 transitions. [2021-03-10 22:02:51,642 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1501 transitions. Word has length 21 [2021-03-10 22:02:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:51,642 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 1501 transitions. [2021-03-10 22:02:51,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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) [2021-03-10 22:02:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1501 transitions. [2021-03-10 22:02:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:51,643 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:51,643 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:51,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4092,348 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:51,843 INFO L428 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -393240531, now seen corresponding path program 348 times [2021-03-10 22:02:51,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:51,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431527111] [2021-03-10 22:02:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:52,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431527111] [2021-03-10 22:02:52,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349091658] [2021-03-10 22:02:52,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:52,244 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:02:52,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:52,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:02:52,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:52,542 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:52,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:52,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:52,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:52,566 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 22:02:52,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:52,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:52,683 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:52,683 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:52,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:02:52,686 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-03-10 22:02:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:52,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:52,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 22:02:52,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115610358] [2021-03-10 22:02:52,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 22:02:52,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 22:02:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-03-10 22:02:52,791 INFO L87 Difference]: Start difference. First operand 468 states and 1501 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:53,659 INFO L93 Difference]: Finished difference Result 644 states and 2011 transitions. [2021-03-10 22:02:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:02:53,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:53,664 INFO L225 Difference]: With dead ends: 644 [2021-03-10 22:02:53,664 INFO L226 Difference]: Without dead ends: 625 [2021-03-10 22:02:53,665 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 676.5ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-03-10 22:02:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-03-10 22:02:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 464. [2021-03-10 22:02:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2159827213822894) internal successors, (1489), 463 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1489 transitions. [2021-03-10 22:02:53,671 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1489 transitions. Word has length 21 [2021-03-10 22:02:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:53,671 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 1489 transitions. [2021-03-10 22:02:53,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1489 transitions. [2021-03-10 22:02:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:53,671 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:53,671 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:53,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4097,349 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:53,872 INFO L428 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash -715838035, now seen corresponding path program 349 times [2021-03-10 22:02:53,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:53,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476379173] [2021-03-10 22:02:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:54,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476379173] [2021-03-10 22:02:54,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509518424] [2021-03-10 22:02:54,269 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:54,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:02:54,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:54,556 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:54,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:54,567 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:54,571 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:54,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:54,616 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:02:54,616 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 22:02:54,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:54,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:54,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:54,755 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:54,914 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-03-10 22:02:54,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:54,915 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:54,921 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:54,926 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:54,934 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:54,939 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:55,073 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:02:55,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:55,074 INFO L518 ElimStorePlain]: Eliminatee v_prenex_818 vanished before elimination [2021-03-10 22:02:55,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:02:55,077 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:57 [2021-03-10 22:02:55,261 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:02:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:55,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:02:55,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:02:55,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910388809] [2021-03-10 22:02:55,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:02:55,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:02:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:02:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:02:55,647 INFO L87 Difference]: Start difference. First operand 464 states and 1489 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:56,356 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-03-10 22:02:56,582 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:02:57,113 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-03-10 22:02:57,354 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2021-03-10 22:02:57,787 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:02:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:02:58,092 INFO L93 Difference]: Finished difference Result 707 states and 2184 transitions. [2021-03-10 22:02:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 22:02:58,096 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:02:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:02:58,097 INFO L225 Difference]: With dead ends: 707 [2021-03-10 22:02:58,097 INFO L226 Difference]: Without dead ends: 684 [2021-03-10 22:02:58,097 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2298.7ms TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2021-03-10 22:02:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-03-10 22:02:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 468. [2021-03-10 22:02:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 3.2119914346895073) internal successors, (1500), 467 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1500 transitions. [2021-03-10 22:02:58,103 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1500 transitions. Word has length 21 [2021-03-10 22:02:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:02:58,103 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 1500 transitions. [2021-03-10 22:02:58,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:02:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1500 transitions. [2021-03-10 22:02:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:02:58,104 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:02:58,104 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:02:58,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 350 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4100 [2021-03-10 22:02:58,304 INFO L428 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:02:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:02:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1334119611, now seen corresponding path program 350 times [2021-03-10 22:02:58,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:02:58,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128613366] [2021-03-10 22:02:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:02:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:02:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:02:58,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128613366] [2021-03-10 22:02:58,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683492320] [2021-03-10 22:02:58,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:02:58,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:02:58,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:02:58,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 22:02:58,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:02:58,933 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:58,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:58,946 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:58,950 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:58,957 INFO L388 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 17 treesize of output 13 [2021-03-10 22:02:58,961 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:58,967 INFO L388 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 9 treesize of output 7 [2021-03-10 22:02:58,972 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:59,104 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:02:59,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:02:59,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:02:59,108 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:69 [2021-03-10 22:02:59,303 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:02:59,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:59,485 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:59,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:59,496 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:59,922 WARN L205 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2021-03-10 22:02:59,924 INFO L628 ElimStorePlain]: treesize reduction 3, result has 97.3 percent of original size [2021-03-10 22:02:59,924 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:02:59,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:59,935 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:02:59,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:02:59,946 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:00,099 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-03-10 22:03:00,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:00,100 INFO L518 ElimStorePlain]: Eliminatee v_prenex_820 vanished before elimination [2021-03-10 22:03:00,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:03:00,103 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:78 [2021-03-10 22:03:00,311 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-03-10 22:03:00,538 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2021-03-10 22:03:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:00,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:00,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:03:00,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188488116] [2021-03-10 22:03:00,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:03:00,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:03:00,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:03:00,703 INFO L87 Difference]: Start difference. First operand 468 states and 1500 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:01,433 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-03-10 22:03:02,358 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-03-10 22:03:02,716 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:03:03,102 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-03-10 22:03:03,730 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2021-03-10 22:03:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:04,029 INFO L93 Difference]: Finished difference Result 790 states and 2427 transitions. [2021-03-10 22:03:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 22:03:04,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:04,034 INFO L225 Difference]: With dead ends: 790 [2021-03-10 22:03:04,034 INFO L226 Difference]: Without dead ends: 752 [2021-03-10 22:03:04,034 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2905.2ms TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2021-03-10 22:03:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-03-10 22:03:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 472. [2021-03-10 22:03:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.2271762208067942) internal successors, (1520), 471 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1520 transitions. [2021-03-10 22:03:04,040 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1520 transitions. Word has length 21 [2021-03-10 22:03:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:04,040 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 1520 transitions. [2021-03-10 22:03:04,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1520 transitions. [2021-03-10 22:03:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:04,041 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:04,041 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:04,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4109,351 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:04,241 INFO L428 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 946949131, now seen corresponding path program 351 times [2021-03-10 22:03:04,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:04,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800211923] [2021-03-10 22:03:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:04,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800211923] [2021-03-10 22:03:04,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129456773] [2021-03-10 22:03:04,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:04,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:03:04,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:04,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:04,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:04,668 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:04,673 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:04,678 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:04,683 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:04,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:04,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:04,756 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-03-10 22:03:05,120 INFO L388 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 26 treesize of output 20 [2021-03-10 22:03:05,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:05,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:05,136 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:05,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:05,181 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:05,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:05,183 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:03:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:05,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:05,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-03-10 22:03:05,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713794911] [2021-03-10 22:03:05,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 22:03:05,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 22:03:05,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-03-10 22:03:05,412 INFO L87 Difference]: Start difference. First operand 472 states and 1520 transitions. Second operand has 16 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) [2021-03-10 22:03:06,717 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-03-10 22:03:08,649 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2021-03-10 22:03:08,901 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 22:03:09,733 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 22:03:09,966 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-03-10 22:03:10,555 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2021-03-10 22:03:10,900 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2021-03-10 22:03:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:11,133 INFO L93 Difference]: Finished difference Result 1079 states and 3284 transitions. [2021-03-10 22:03:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-03-10 22:03:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 16 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 21 [2021-03-10 22:03:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:11,138 INFO L225 Difference]: With dead ends: 1079 [2021-03-10 22:03:11,139 INFO L226 Difference]: Without dead ends: 1041 [2021-03-10 22:03:11,139 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 4285.2ms TimeCoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980 [2021-03-10 22:03:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-03-10 22:03:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 472. [2021-03-10 22:03:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.210191082802548) internal successors, (1512), 471 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1512 transitions. [2021-03-10 22:03:11,146 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1512 transitions. Word has length 21 [2021-03-10 22:03:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:11,146 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 1512 transitions. [2021-03-10 22:03:11,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 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) [2021-03-10 22:03:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1512 transitions. [2021-03-10 22:03:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:11,147 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:11,147 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:11,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4119,352 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:11,347 INFO L428 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1145565755, now seen corresponding path program 352 times [2021-03-10 22:03:11,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:11,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396326657] [2021-03-10 22:03:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:11,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396326657] [2021-03-10 22:03:11,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388650646] [2021-03-10 22:03:11,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:11,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:03:11,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:11,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:11,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:11,840 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:11,845 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:11,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:11,867 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:03:11,868 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-03-10 22:03:11,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:11,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:11,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:11,960 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:12,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:12,045 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:12,047 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:12,047 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 22:03:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:12,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:12,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:12,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494350372] [2021-03-10 22:03:12,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:12,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:12,426 INFO L87 Difference]: Start difference. First operand 472 states and 1512 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:13,438 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 22:03:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:13,557 INFO L93 Difference]: Finished difference Result 757 states and 2323 transitions. [2021-03-10 22:03:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:13,561 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:13,562 INFO L225 Difference]: With dead ends: 757 [2021-03-10 22:03:13,562 INFO L226 Difference]: Without dead ends: 738 [2021-03-10 22:03:13,562 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1006.9ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:03:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-03-10 22:03:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 452. [2021-03-10 22:03:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.2017738359201773) internal successors, (1444), 451 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1444 transitions. [2021-03-10 22:03:13,568 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1444 transitions. Word has length 21 [2021-03-10 22:03:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:13,568 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 1444 transitions. [2021-03-10 22:03:13,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1444 transitions. [2021-03-10 22:03:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:13,569 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:13,569 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:13,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4128,353 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:13,769 INFO L428 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2087738507, now seen corresponding path program 353 times [2021-03-10 22:03:13,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:13,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206789398] [2021-03-10 22:03:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:14,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206789398] [2021-03-10 22:03:14,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274848111] [2021-03-10 22:03:14,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:14,053 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:03:14,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:14,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:14,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:14,187 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:14,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:14,196 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:14,200 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:14,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:14,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:14,284 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-03-10 22:03:14,550 INFO L388 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 26 treesize of output 20 [2021-03-10 22:03:14,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:14,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:14,566 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:14,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:14,610 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:14,612 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:14,612 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:03:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:14,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:14,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:14,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909313624] [2021-03-10 22:03:14,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:14,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:14,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:14,837 INFO L87 Difference]: Start difference. First operand 452 states and 1444 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:15,654 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2021-03-10 22:03:16,010 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 22:03:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:16,433 INFO L93 Difference]: Finished difference Result 722 states and 2225 transitions. [2021-03-10 22:03:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 22:03:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:16,438 INFO L225 Difference]: With dead ends: 722 [2021-03-10 22:03:16,438 INFO L226 Difference]: Without dead ends: 703 [2021-03-10 22:03:16,438 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1166.8ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:03:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-03-10 22:03:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 467. [2021-03-10 22:03:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 3.203862660944206) internal successors, (1493), 466 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1493 transitions. [2021-03-10 22:03:16,444 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1493 transitions. Word has length 21 [2021-03-10 22:03:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:16,444 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 1493 transitions. [2021-03-10 22:03:16,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1493 transitions. [2021-03-10 22:03:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:16,445 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:16,445 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:16,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 354 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4133 [2021-03-10 22:03:16,645 INFO L428 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1822320685, now seen corresponding path program 354 times [2021-03-10 22:03:16,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:16,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812011296] [2021-03-10 22:03:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:16,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812011296] [2021-03-10 22:03:16,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879402666] [2021-03-10 22:03:16,904 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:16,926 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 22:03:16,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:16,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:16,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:17,077 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:17,081 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:17,087 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:17,092 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:17,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:17,182 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:17,182 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-03-10 22:03:17,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:17,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:17,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:17,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:17,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:17,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:17,514 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:17,514 INFO L518 ElimStorePlain]: Eliminatee v_prenex_821 vanished before elimination [2021-03-10 22:03:17,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:17,517 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:31 [2021-03-10 22:03:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:17,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:17,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:17,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482565260] [2021-03-10 22:03:17,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:17,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:17,847 INFO L87 Difference]: Start difference. First operand 467 states and 1493 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:18,453 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2021-03-10 22:03:18,942 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 22:03:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:19,072 INFO L93 Difference]: Finished difference Result 730 states and 2245 transitions. [2021-03-10 22:03:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:19,076 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:19,078 INFO L225 Difference]: With dead ends: 730 [2021-03-10 22:03:19,078 INFO L226 Difference]: Without dead ends: 711 [2021-03-10 22:03:19,078 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1172.2ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:03:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-03-10 22:03:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 463. [2021-03-10 22:03:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 3.196969696969697) internal successors, (1477), 462 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1477 transitions. [2021-03-10 22:03:19,083 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1477 transitions. Word has length 21 [2021-03-10 22:03:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:19,083 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 1477 transitions. [2021-03-10 22:03:19,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1477 transitions. [2021-03-10 22:03:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:19,084 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:19,084 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:19,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 355 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4142 [2021-03-10 22:03:19,284 INFO L428 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -326475851, now seen corresponding path program 355 times [2021-03-10 22:03:19,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:19,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532589753] [2021-03-10 22:03:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:19,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532589753] [2021-03-10 22:03:19,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666229855] [2021-03-10 22:03:19,533 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:19,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:19,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:19,700 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:19,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:19,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:19,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:03:19,725 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 22:03:19,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:19,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:19,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:19,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:19,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:19,890 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:19,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:19,892 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 22:03:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:20,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:20,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:20,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742169508] [2021-03-10 22:03:20,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:20,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:20,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:20,239 INFO L87 Difference]: Start difference. First operand 463 states and 1477 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:21,242 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-10 22:03:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:21,379 INFO L93 Difference]: Finished difference Result 723 states and 2227 transitions. [2021-03-10 22:03:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:21,384 INFO L225 Difference]: With dead ends: 723 [2021-03-10 22:03:21,384 INFO L226 Difference]: Without dead ends: 704 [2021-03-10 22:03:21,384 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 934.0ms TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:03:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-03-10 22:03:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 459. [2021-03-10 22:03:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 3.1986899563318776) internal successors, (1465), 458 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1465 transitions. [2021-03-10 22:03:21,390 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1465 transitions. Word has length 21 [2021-03-10 22:03:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:21,390 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 1465 transitions. [2021-03-10 22:03:21,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1465 transitions. [2021-03-10 22:03:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:21,390 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:21,391 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:21,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4149,356 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:21,591 INFO L428 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash 179870415, now seen corresponding path program 356 times [2021-03-10 22:03:21,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:21,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425009360] [2021-03-10 22:03:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:21,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425009360] [2021-03-10 22:03:21,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921875246] [2021-03-10 22:03:21,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:21,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:03:21,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:21,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:21,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:21,976 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:21,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:21,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:21,994 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:03:21,994 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2021-03-10 22:03:22,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:22,066 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:22,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:22,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:22,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:22,149 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:22,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:22,151 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 22:03:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:22,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:22,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:22,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518822108] [2021-03-10 22:03:22,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:22,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:22,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:22,511 INFO L87 Difference]: Start difference. First operand 459 states and 1465 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:23,326 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:03:23,669 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:03:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:23,814 INFO L93 Difference]: Finished difference Result 839 states and 2578 transitions. [2021-03-10 22:03:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:23,818 INFO L225 Difference]: With dead ends: 839 [2021-03-10 22:03:23,818 INFO L226 Difference]: Without dead ends: 820 [2021-03-10 22:03:23,818 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1074.2ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:03:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-03-10 22:03:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 460. [2021-03-10 22:03:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 3.215686274509804) internal successors, (1476), 459 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1476 transitions. [2021-03-10 22:03:23,824 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1476 transitions. Word has length 21 [2021-03-10 22:03:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:23,824 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 1476 transitions. [2021-03-10 22:03:23,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1476 transitions. [2021-03-10 22:03:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:23,825 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:23,825 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:24,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 357 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4154 [2021-03-10 22:03:24,025 INFO L428 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1671601621, now seen corresponding path program 357 times [2021-03-10 22:03:24,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:24,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875731838] [2021-03-10 22:03:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:24,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875731838] [2021-03-10 22:03:24,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830945889] [2021-03-10 22:03:24,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:24,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-10 22:03:24,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:24,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:24,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:24,462 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:24,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:24,472 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:24,478 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:24,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:24,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:24,512 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:03:24,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:24,611 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:24,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:24,620 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:24,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:24,673 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:24,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:24,675 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:29 [2021-03-10 22:03:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:24,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:24,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 22:03:24,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927930460] [2021-03-10 22:03:24,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 22:03:24,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:24,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 22:03:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-03-10 22:03:24,901 INFO L87 Difference]: Start difference. First operand 460 states and 1476 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:25,470 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2021-03-10 22:03:26,215 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2021-03-10 22:03:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:26,300 INFO L93 Difference]: Finished difference Result 766 states and 2352 transitions. [2021-03-10 22:03:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:26,304 INFO L225 Difference]: With dead ends: 766 [2021-03-10 22:03:26,304 INFO L226 Difference]: Without dead ends: 744 [2021-03-10 22:03:26,304 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1114.7ms TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-03-10 22:03:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-03-10 22:03:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 475. [2021-03-10 22:03:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 3.217299578059072) internal successors, (1525), 474 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1525 transitions. [2021-03-10 22:03:26,310 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1525 transitions. Word has length 21 [2021-03-10 22:03:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:26,310 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 1525 transitions. [2021-03-10 22:03:26,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1525 transitions. [2021-03-10 22:03:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:26,311 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:26,311 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:26,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4159,358 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:26,511 INFO L428 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1247529711, now seen corresponding path program 358 times [2021-03-10 22:03:26,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:26,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413277835] [2021-03-10 22:03:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:26,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413277835] [2021-03-10 22:03:26,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505246332] [2021-03-10 22:03:26,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:26,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:03:26,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:26,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:26,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:26,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:26,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:26,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:26,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:27,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:27,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:27,011 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 22:03:27,285 INFO L388 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 21 treesize of output 17 [2021-03-10 22:03:27,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:27,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:27,302 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:27,309 INFO L388 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 28 treesize of output 22 [2021-03-10 22:03:27,314 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:27,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 22:03:27,322 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:27,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:27,357 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:27,359 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:03:27,359 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:16 [2021-03-10 22:03:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:27,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:27,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:27,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468632577] [2021-03-10 22:03:27,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:27,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:27,554 INFO L87 Difference]: Start difference. First operand 475 states and 1525 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:28,313 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2021-03-10 22:03:28,716 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2021-03-10 22:03:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:29,494 INFO L93 Difference]: Finished difference Result 779 states and 2390 transitions. [2021-03-10 22:03:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:03:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:29,498 INFO L225 Difference]: With dead ends: 779 [2021-03-10 22:03:29,498 INFO L226 Difference]: Without dead ends: 746 [2021-03-10 22:03:29,498 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1425.0ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-03-10 22:03:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-03-10 22:03:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 475. [2021-03-10 22:03:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 3.210970464135021) internal successors, (1522), 474 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1522 transitions. [2021-03-10 22:03:29,504 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1522 transitions. Word has length 21 [2021-03-10 22:03:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:29,504 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 1522 transitions. [2021-03-10 22:03:29,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1522 transitions. [2021-03-10 22:03:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:29,505 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:29,505 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:29,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 359 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4164 [2021-03-10 22:03:29,705 INFO L428 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 209151317, now seen corresponding path program 359 times [2021-03-10 22:03:29,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:29,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780234520] [2021-03-10 22:03:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:29,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780234520] [2021-03-10 22:03:29,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168387074] [2021-03-10 22:03:29,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:30,017 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:03:30,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:30,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:03:30,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:30,194 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:30,199 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:30,206 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:30,212 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:30,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:30,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:30,254 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:03:30,315 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:30,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:30,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:30,335 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:30,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:30,378 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:30,381 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:30,381 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 22:03:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:30,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:30,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-03-10 22:03:30,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095057526] [2021-03-10 22:03:30,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 22:03:30,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 22:03:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-03-10 22:03:30,560 INFO L87 Difference]: Start difference. First operand 475 states and 1522 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:31,789 INFO L93 Difference]: Finished difference Result 811 states and 2493 transitions. [2021-03-10 22:03:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:03:31,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:31,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:31,793 INFO L225 Difference]: With dead ends: 811 [2021-03-10 22:03:31,793 INFO L226 Difference]: Without dead ends: 782 [2021-03-10 22:03:31,793 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 734.3ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:03:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-03-10 22:03:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 475. [2021-03-10 22:03:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 3.210970464135021) internal successors, (1522), 474 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1522 transitions. [2021-03-10 22:03:31,799 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1522 transitions. Word has length 21 [2021-03-10 22:03:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:31,799 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 1522 transitions. [2021-03-10 22:03:31,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1522 transitions. [2021-03-10 22:03:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:31,800 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:31,800 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:32,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4170,360 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:32,000 INFO L428 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -885547601, now seen corresponding path program 360 times [2021-03-10 22:03:32,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:32,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279834297] [2021-03-10 22:03:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:32,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279834297] [2021-03-10 22:03:32,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411206910] [2021-03-10 22:03:32,257 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:32,279 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-10 22:03:32,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:32,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:32,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:32,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:32,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:32,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:32,442 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:32,529 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:32,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:32,532 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:51 [2021-03-10 22:03:32,704 INFO L388 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 11 treesize of output 9 [2021-03-10 22:03:32,709 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:33,016 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2021-03-10 22:03:33,017 INFO L628 ElimStorePlain]: treesize reduction 2, result has 97.8 percent of original size [2021-03-10 22:03:33,017 INFO L518 ElimStorePlain]: Eliminatee v_prenex_824 vanished before elimination [2021-03-10 22:03:33,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:33,027 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:33,161 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 22:03:33,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:33,168 INFO L388 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 11 treesize of output 9 [2021-03-10 22:03:33,174 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:33,421 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2021-03-10 22:03:33,422 INFO L628 ElimStorePlain]: treesize reduction 2, result has 96.8 percent of original size [2021-03-10 22:03:33,423 INFO L518 ElimStorePlain]: Eliminatee v_prenex_826 vanished before elimination [2021-03-10 22:03:33,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:33,433 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:33,546 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-03-10 22:03:33,547 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:33,547 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:33,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_828 vanished before elimination [2021-03-10 22:03:33,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:03:33,550 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:45 [2021-03-10 22:03:33,706 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-03-10 22:03:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:33,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:33,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:33,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507747889] [2021-03-10 22:03:33,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:33,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:33,953 INFO L87 Difference]: Start difference. First operand 475 states and 1522 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:34,717 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2021-03-10 22:03:35,050 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:03:35,386 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-03-10 22:03:35,667 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-03-10 22:03:36,022 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-03-10 22:03:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:36,252 INFO L93 Difference]: Finished difference Result 778 states and 2382 transitions. [2021-03-10 22:03:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 22:03:36,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:36,256 INFO L225 Difference]: With dead ends: 778 [2021-03-10 22:03:36,256 INFO L226 Difference]: Without dead ends: 751 [2021-03-10 22:03:36,256 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1884.1ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-03-10 22:03:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-03-10 22:03:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 473. [2021-03-10 22:03:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2203389830508473) internal successors, (1520), 472 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1520 transitions. [2021-03-10 22:03:36,262 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1520 transitions. Word has length 21 [2021-03-10 22:03:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:36,262 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 1520 transitions. [2021-03-10 22:03:36,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1520 transitions. [2021-03-10 22:03:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:36,262 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:36,262 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:36,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 361 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4174 [2021-03-10 22:03:36,463 INFO L428 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1979031859, now seen corresponding path program 361 times [2021-03-10 22:03:36,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:36,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087489105] [2021-03-10 22:03:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:36,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087489105] [2021-03-10 22:03:36,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867000998] [2021-03-10 22:03:36,718 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:36,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:03:36,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:36,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:36,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:36,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:36,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:03:36,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2021-03-10 22:03:36,972 INFO L388 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 18 treesize of output 14 [2021-03-10 22:03:36,976 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:36,981 INFO L388 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 10 treesize of output 8 [2021-03-10 22:03:36,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:37,018 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:37,018 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:37,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:37,021 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 22:03:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:37,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:37,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 22:03:37,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206926742] [2021-03-10 22:03:37,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 22:03:37,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 22:03:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-03-10 22:03:37,153 INFO L87 Difference]: Start difference. First operand 473 states and 1520 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 22:03:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:38,147 INFO L93 Difference]: Finished difference Result 784 states and 2408 transitions. [2021-03-10 22:03:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:03:38,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 21 [2021-03-10 22:03:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:38,151 INFO L225 Difference]: With dead ends: 784 [2021-03-10 22:03:38,151 INFO L226 Difference]: Without dead ends: 748 [2021-03-10 22:03:38,151 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 584.0ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:03:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-03-10 22:03:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 474. [2021-03-10 22:03:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 3.2241014799154333) internal successors, (1525), 473 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1525 transitions. [2021-03-10 22:03:38,157 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1525 transitions. Word has length 21 [2021-03-10 22:03:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:38,157 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 1525 transitions. [2021-03-10 22:03:38,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 22:03:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1525 transitions. [2021-03-10 22:03:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:38,157 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:38,157 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:38,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4182,362 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:38,358 INFO L428 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1221236519, now seen corresponding path program 362 times [2021-03-10 22:03:38,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:38,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149487178] [2021-03-10 22:03:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:38,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149487178] [2021-03-10 22:03:38,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104628817] [2021-03-10 22:03:38,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:38,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:03:38,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:38,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-10 22:03:38,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:39,106 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:39,110 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,118 INFO L388 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 24 treesize of output 18 [2021-03-10 22:03:39,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,131 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:39,136 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,141 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-03-10 22:03:39,145 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:39,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:03:39,209 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:89, output treesize:42 [2021-03-10 22:03:39,368 INFO L388 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 26 treesize of output 20 [2021-03-10 22:03:39,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,381 INFO L388 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 26 treesize of output 20 [2021-03-10 22:03:39,385 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,780 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2021-03-10 22:03:39,781 INFO L628 ElimStorePlain]: treesize reduction 22, result has 82.9 percent of original size [2021-03-10 22:03:39,781 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:39,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:39,793 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:39,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:39,804 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:40,084 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2021-03-10 22:03:40,086 INFO L628 ElimStorePlain]: treesize reduction 14, result has 81.8 percent of original size [2021-03-10 22:03:40,086 INFO L518 ElimStorePlain]: Eliminatee v_prenex_830 vanished before elimination [2021-03-10 22:03:40,094 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:40,099 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:40,105 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:40,110 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:40,227 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-03-10 22:03:40,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:40,228 INFO L518 ElimStorePlain]: Eliminatee v_prenex_832 vanished before elimination [2021-03-10 22:03:40,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:03:40,231 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:167, output treesize:45 [2021-03-10 22:03:40,385 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-03-10 22:03:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:40,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:40,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-03-10 22:03:40,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302986258] [2021-03-10 22:03:40,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 22:03:40,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 22:03:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-10 22:03:40,644 INFO L87 Difference]: Start difference. First operand 474 states and 1525 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:41,056 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2021-03-10 22:03:41,235 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2021-03-10 22:03:41,585 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:03:41,951 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2021-03-10 22:03:42,313 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-03-10 22:03:43,029 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-03-10 22:03:43,516 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-03-10 22:03:44,117 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-03-10 22:03:44,580 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-03-10 22:03:44,783 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2021-03-10 22:03:45,072 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2021-03-10 22:03:45,654 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-03-10 22:03:46,043 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2021-03-10 22:03:46,472 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2021-03-10 22:03:47,141 WARN L205 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-03-10 22:03:47,518 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-03-10 22:03:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:47,522 INFO L93 Difference]: Finished difference Result 982 states and 2924 transitions. [2021-03-10 22:03:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 22:03:47,524 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:47,526 INFO L225 Difference]: With dead ends: 982 [2021-03-10 22:03:47,526 INFO L226 Difference]: Without dead ends: 901 [2021-03-10 22:03:47,526 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 6072.0ms TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2021-03-10 22:03:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2021-03-10 22:03:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 498. [2021-03-10 22:03:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 3.2515090543259557) internal successors, (1616), 497 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1616 transitions. [2021-03-10 22:03:47,533 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1616 transitions. Word has length 21 [2021-03-10 22:03:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:47,533 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 1616 transitions. [2021-03-10 22:03:47,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1616 transitions. [2021-03-10 22:03:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:47,533 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:47,533 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:47,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 363 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4185 [2021-03-10 22:03:47,734 INFO L428 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1192977839, now seen corresponding path program 363 times [2021-03-10 22:03:47,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:47,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643198604] [2021-03-10 22:03:47,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:47,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643198604] [2021-03-10 22:03:47,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198894774] [2021-03-10 22:03:47,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:47,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:03:47,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:47,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:03:47,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:48,128 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:48,132 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:48,137 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:48,141 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:48,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:48,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:48,171 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:19 [2021-03-10 22:03:48,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:48,295 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:48,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:48,306 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:48,307 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:03:48,308 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2021-03-10 22:03:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:48,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:48,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 22:03:48,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533035149] [2021-03-10 22:03:48,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 22:03:48,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 22:03:48,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-03-10 22:03:48,366 INFO L87 Difference]: Start difference. First operand 498 states and 1616 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 22:03:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:49,363 INFO L93 Difference]: Finished difference Result 806 states and 2476 transitions. [2021-03-10 22:03:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:03:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 21 [2021-03-10 22:03:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:49,367 INFO L225 Difference]: With dead ends: 806 [2021-03-10 22:03:49,367 INFO L226 Difference]: Without dead ends: 785 [2021-03-10 22:03:49,367 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 564.7ms TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:03:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2021-03-10 22:03:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 482. [2021-03-10 22:03:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 3.241164241164241) internal successors, (1559), 481 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1559 transitions. [2021-03-10 22:03:49,373 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1559 transitions. Word has length 21 [2021-03-10 22:03:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:49,373 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 1559 transitions. [2021-03-10 22:03:49,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 22:03:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1559 transitions. [2021-03-10 22:03:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:49,374 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:49,374 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:49,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 364 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4194 [2021-03-10 22:03:49,574 INFO L428 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash 832800499, now seen corresponding path program 364 times [2021-03-10 22:03:49,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:49,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205749924] [2021-03-10 22:03:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:49,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205749924] [2021-03-10 22:03:49,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056079777] [2021-03-10 22:03:49,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:49,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:03:49,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:49,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:03:49,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:50,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:50,011 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:50,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:50,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:03:50,030 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2021-03-10 22:03:50,132 INFO L388 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 18 treesize of output 14 [2021-03-10 22:03:50,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:50,142 INFO L388 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 10 treesize of output 8 [2021-03-10 22:03:50,148 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:50,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:50,184 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:50,186 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:50,186 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2021-03-10 22:03:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:50,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:50,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-03-10 22:03:50,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413957238] [2021-03-10 22:03:50,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 22:03:50,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 22:03:50,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-03-10 22:03:50,338 INFO L87 Difference]: Start difference. First operand 482 states and 1559 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 22:03:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:51,403 INFO L93 Difference]: Finished difference Result 927 states and 2842 transitions. [2021-03-10 22:03:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 22:03:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 21 [2021-03-10 22:03:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:51,407 INFO L225 Difference]: With dead ends: 927 [2021-03-10 22:03:51,407 INFO L226 Difference]: Without dead ends: 880 [2021-03-10 22:03:51,407 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 659.0ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:03:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-03-10 22:03:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 485. [2021-03-10 22:03:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 3.2520661157024793) internal successors, (1574), 484 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1574 transitions. [2021-03-10 22:03:51,413 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1574 transitions. Word has length 21 [2021-03-10 22:03:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:51,413 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 1574 transitions. [2021-03-10 22:03:51,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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) [2021-03-10 22:03:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1574 transitions. [2021-03-10 22:03:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:51,414 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:51,414 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:51,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 365 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4197 [2021-03-10 22:03:51,614 INFO L428 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -261898419, now seen corresponding path program 365 times [2021-03-10 22:03:51,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:51,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614360452] [2021-03-10 22:03:51,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:51,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614360452] [2021-03-10 22:03:51,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495872727] [2021-03-10 22:03:51,874 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:51,896 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:03:51,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:51,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:51,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:52,017 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:52,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:52,027 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:52,031 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:52,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:52,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:52,046 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:11 [2021-03-10 22:03:52,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:52,141 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:52,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:52,153 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:52,160 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:52,165 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:52,171 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:52,176 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:52,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:52,275 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:52,277 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:03:52,277 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:45 [2021-03-10 22:03:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:52,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:52,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:52,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270954687] [2021-03-10 22:03:52,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:52,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:52,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:52,644 INFO L87 Difference]: Start difference. First operand 485 states and 1574 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:53,331 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-03-10 22:03:53,744 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2021-03-10 22:03:54,019 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:03:54,382 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2021-03-10 22:03:54,909 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2021-03-10 22:03:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:54,923 INFO L93 Difference]: Finished difference Result 999 states and 3063 transitions. [2021-03-10 22:03:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:03:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:54,927 INFO L225 Difference]: With dead ends: 999 [2021-03-10 22:03:54,927 INFO L226 Difference]: Without dead ends: 972 [2021-03-10 22:03:54,927 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2044.9ms TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-03-10 22:03:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2021-03-10 22:03:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 508. [2021-03-10 22:03:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 3.272189349112426) internal successors, (1659), 507 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1659 transitions. [2021-03-10 22:03:54,934 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1659 transitions. Word has length 21 [2021-03-10 22:03:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:54,934 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 1659 transitions. [2021-03-10 22:03:54,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1659 transitions. [2021-03-10 22:03:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:54,935 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:54,935 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:55,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 366 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4200 [2021-03-10 22:03:55,135 INFO L428 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1618854519, now seen corresponding path program 366 times [2021-03-10 22:03:55,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:55,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734151290] [2021-03-10 22:03:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:55,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734151290] [2021-03-10 22:03:55,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424651495] [2021-03-10 22:03:55,376 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:55,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:03:55,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:03:55,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:55,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:55,516 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:55,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:55,525 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:55,529 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:55,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:55,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:55,543 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:11 [2021-03-10 22:03:55,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:55,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:55,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:55,686 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:55,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:55,744 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:55,746 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:55,746 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:25 [2021-03-10 22:03:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:55,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:55,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-03-10 22:03:55,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217138512] [2021-03-10 22:03:55,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 22:03:55,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 22:03:55,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-03-10 22:03:55,977 INFO L87 Difference]: Start difference. First operand 508 states and 1659 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:57,218 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2021-03-10 22:03:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:57,414 INFO L93 Difference]: Finished difference Result 975 states and 3000 transitions. [2021-03-10 22:03:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:57,416 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:57,418 INFO L225 Difference]: With dead ends: 975 [2021-03-10 22:03:57,418 INFO L226 Difference]: Without dead ends: 954 [2021-03-10 22:03:57,418 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1008.0ms TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-03-10 22:03:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-03-10 22:03:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 505. [2021-03-10 22:03:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.2757936507936507) internal successors, (1651), 504 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1651 transitions. [2021-03-10 22:03:57,425 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1651 transitions. Word has length 21 [2021-03-10 22:03:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:57,425 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 1651 transitions. [2021-03-10 22:03:57,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1651 transitions. [2021-03-10 22:03:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:57,426 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:57,426 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:57,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4207,367 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:57,626 INFO L428 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2125200785, now seen corresponding path program 367 times [2021-03-10 22:03:57,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:57,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749252644] [2021-03-10 22:03:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:57,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749252644] [2021-03-10 22:03:57,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797393093] [2021-03-10 22:03:57,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:03:57,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:03:57,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:03:57,989 INFO L388 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 9 treesize of output 7 [2021-03-10 22:03:57,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:57,998 INFO L388 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 17 treesize of output 13 [2021-03-10 22:03:58,002 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:58,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:58,016 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:58,016 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:11 [2021-03-10 22:03:58,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:58,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:58,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:03:58,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:03:58,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:03:58,164 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:03:58,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:03:58,166 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:25 [2021-03-10 22:03:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:03:58,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:03:58,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-03-10 22:03:58,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327082970] [2021-03-10 22:03:58,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 22:03:58,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:03:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 22:03:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 22:03:58,401 INFO L87 Difference]: Start difference. First operand 505 states and 1651 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:59,523 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-03-10 22:03:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:03:59,680 INFO L93 Difference]: Finished difference Result 1032 states and 3145 transitions. [2021-03-10 22:03:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:03:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 21 [2021-03-10 22:03:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:03:59,684 INFO L225 Difference]: With dead ends: 1032 [2021-03-10 22:03:59,684 INFO L226 Difference]: Without dead ends: 1011 [2021-03-10 22:03:59,684 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 867.9ms TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-03-10 22:03:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-03-10 22:03:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 497. [2021-03-10 22:03:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 3.256048387096774) internal successors, (1615), 496 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1615 transitions. [2021-03-10 22:03:59,691 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1615 transitions. Word has length 21 [2021-03-10 22:03:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:03:59,691 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 1615 transitions. [2021-03-10 22:03:59,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:03:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1615 transitions. [2021-03-10 22:03:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:03:59,692 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:03:59,692 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:03:59,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4212,368 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:03:59,892 INFO L428 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:03:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:03:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1380365547, now seen corresponding path program 368 times [2021-03-10 22:03:59,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:03:59,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373954450] [2021-03-10 22:03:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:03:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:00,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373954450] [2021-03-10 22:04:00,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41355707] [2021-03-10 22:04:00,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:00,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:04:00,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:00,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:00,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:00,510 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:00,515 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:00,522 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:00,528 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:00,534 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:00,539 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:00,545 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:00,549 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:00,691 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:00,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:00,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:04:00,695 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:69 [2021-03-10 22:04:00,885 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:01,219 INFO L388 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 26 treesize of output 20 [2021-03-10 22:04:01,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:01,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:01,236 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:01,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:01,282 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:01,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:01,285 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:04:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:01,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:01,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:04:01,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885965286] [2021-03-10 22:04:01,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:04:01,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:04:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:04:01,527 INFO L87 Difference]: Start difference. First operand 497 states and 1615 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:02,566 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-03-10 22:04:03,095 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 22:04:03,344 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2021-03-10 22:04:03,721 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-03-10 22:04:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:04,354 INFO L93 Difference]: Finished difference Result 706 states and 2227 transitions. [2021-03-10 22:04:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:04:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:04,359 INFO L225 Difference]: With dead ends: 706 [2021-03-10 22:04:04,359 INFO L226 Difference]: Without dead ends: 687 [2021-03-10 22:04:04,359 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2424.1ms TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2021-03-10 22:04:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-03-10 22:04:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 509. [2021-03-10 22:04:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 3.267716535433071) internal successors, (1660), 508 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1660 transitions. [2021-03-10 22:04:04,365 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1660 transitions. Word has length 21 [2021-03-10 22:04:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:04,365 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 1660 transitions. [2021-03-10 22:04:04,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1660 transitions. [2021-03-10 22:04:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:04,365 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:04,366 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:04,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4217,369 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:04,566 INFO L428 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1228209909, now seen corresponding path program 369 times [2021-03-10 22:04:04,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:04,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951714134] [2021-03-10 22:04:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:04,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951714134] [2021-03-10 22:04:04,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422489421] [2021-03-10 22:04:04,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:04,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:04:04,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:04,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:04,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:05,183 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:05,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,194 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:05,199 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,206 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:05,212 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,220 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:05,225 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,372 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:05,373 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:05,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:04:05,376 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:69 [2021-03-10 22:04:05,557 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:05,759 INFO L388 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 26 treesize of output 20 [2021-03-10 22:04:05,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:05,774 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:05,844 INFO L518 ElimStorePlain]: Eliminatee v_prenex_834 vanished before elimination [2021-03-10 22:04:05,851 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:05,856 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:05,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:05,912 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:05,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-03-10 22:04:05,914 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:26 [2021-03-10 22:04:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:06,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:06,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:04:06,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003543530] [2021-03-10 22:04:06,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:04:06,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:06,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:04:06,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:04:06,286 INFO L87 Difference]: Start difference. First operand 509 states and 1660 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:07,111 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-03-10 22:04:07,588 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-03-10 22:04:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:08,560 INFO L93 Difference]: Finished difference Result 761 states and 2386 transitions. [2021-03-10 22:04:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:04:08,564 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:08,565 INFO L225 Difference]: With dead ends: 761 [2021-03-10 22:04:08,565 INFO L226 Difference]: Without dead ends: 738 [2021-03-10 22:04:08,565 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1992.0ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-03-10 22:04:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-03-10 22:04:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 513. [2021-03-10 22:04:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.265625) internal successors, (1672), 512 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1672 transitions. [2021-03-10 22:04:08,571 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1672 transitions. Word has length 21 [2021-03-10 22:04:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:08,571 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 1672 transitions. [2021-03-10 22:04:08,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1672 transitions. [2021-03-10 22:04:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:08,571 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:08,571 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:08,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4228,370 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:08,772 INFO L428 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1068629005, now seen corresponding path program 370 times [2021-03-10 22:04:08,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:08,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333699782] [2021-03-10 22:04:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:09,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333699782] [2021-03-10 22:04:09,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082881118] [2021-03-10 22:04:09,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:09,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:04:09,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:09,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:09,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:09,391 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:09,395 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:09,403 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:09,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:09,414 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:09,419 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:09,425 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:09,429 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:09,571 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:09,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:09,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:04:09,575 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:69 [2021-03-10 22:04:09,766 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:09,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:09,948 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:10,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:10,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:10,044 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:10,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:10,116 INFO L518 ElimStorePlain]: Eliminatee v_prenex_836 vanished before elimination [2021-03-10 22:04:10,116 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:10,118 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:10,118 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:31 [2021-03-10 22:04:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:10,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:10,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:04:10,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260317599] [2021-03-10 22:04:10,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:04:10,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:10,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:04:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:04:10,477 INFO L87 Difference]: Start difference. First operand 513 states and 1672 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:11,421 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-03-10 22:04:11,827 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:04:12,401 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2021-03-10 22:04:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:12,623 INFO L93 Difference]: Finished difference Result 712 states and 2244 transitions. [2021-03-10 22:04:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:04:12,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:12,628 INFO L225 Difference]: With dead ends: 712 [2021-03-10 22:04:12,628 INFO L226 Difference]: Without dead ends: 693 [2021-03-10 22:04:12,628 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1970.4ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-03-10 22:04:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-03-10 22:04:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 509. [2021-03-10 22:04:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 3.2598425196850394) internal successors, (1656), 508 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1656 transitions. [2021-03-10 22:04:12,633 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1656 transitions. Word has length 21 [2021-03-10 22:04:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:12,633 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 1656 transitions. [2021-03-10 22:04:12,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1656 transitions. [2021-03-10 22:04:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:12,634 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:12,634 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:12,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 371 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4241 [2021-03-10 22:04:12,834 INFO L428 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2082051155, now seen corresponding path program 371 times [2021-03-10 22:04:12,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:12,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284097805] [2021-03-10 22:04:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:13,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284097805] [2021-03-10 22:04:13,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518986197] [2021-03-10 22:04:13,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:13,275 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-10 22:04:13,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:13,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:13,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:13,477 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:13,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:13,490 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:13,495 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:13,501 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:13,506 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:13,512 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:13,516 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:13,649 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:13,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:13,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:04:13,653 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:69 [2021-03-10 22:04:13,838 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-03-10 22:04:13,880 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:13,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:14,032 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-03-10 22:04:14,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:14,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:14,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:14,186 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 22:04:14,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:14,187 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:14,187 INFO L518 ElimStorePlain]: Eliminatee v_prenex_838 vanished before elimination [2021-03-10 22:04:14,195 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:14,200 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:14,345 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-03-10 22:04:14,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:14,347 INFO L518 ElimStorePlain]: Eliminatee v_prenex_840 vanished before elimination [2021-03-10 22:04:14,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:14,356 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:14,487 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:04:14,488 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:14,488 INFO L518 ElimStorePlain]: Eliminatee v_prenex_842 vanished before elimination [2021-03-10 22:04:14,491 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:04:14,491 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:105, output treesize:57 [2021-03-10 22:04:14,675 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:04:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:15,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:15,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:04:15,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196481650] [2021-03-10 22:04:15,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:04:15,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:04:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:04:15,080 INFO L87 Difference]: Start difference. First operand 509 states and 1656 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:16,012 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2021-03-10 22:04:16,500 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-03-10 22:04:17,036 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-03-10 22:04:17,721 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-03-10 22:04:18,061 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2021-03-10 22:04:18,635 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2021-03-10 22:04:19,158 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-03-10 22:04:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:19,493 INFO L93 Difference]: Finished difference Result 986 states and 3034 transitions. [2021-03-10 22:04:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-10 22:04:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:19,498 INFO L225 Difference]: With dead ends: 986 [2021-03-10 22:04:19,498 INFO L226 Difference]: Without dead ends: 944 [2021-03-10 22:04:19,498 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 3666.9ms TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2021-03-10 22:04:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2021-03-10 22:04:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 511. [2021-03-10 22:04:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2666666666666666) internal successors, (1666), 510 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1666 transitions. [2021-03-10 22:04:19,505 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1666 transitions. Word has length 21 [2021-03-10 22:04:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:19,505 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 1666 transitions. [2021-03-10 22:04:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1666 transitions. [2021-03-10 22:04:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:19,506 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:19,506 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:19,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4250,372 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:19,708 INFO L428 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 504543133, now seen corresponding path program 372 times [2021-03-10 22:04:19,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:19,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328664821] [2021-03-10 22:04:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:20,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328664821] [2021-03-10 22:04:20,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534554561] [2021-03-10 22:04:20,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:20,217 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-10 22:04:20,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:20,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:20,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:20,503 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:20,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:20,513 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:20,518 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:20,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:20,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:20,611 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-03-10 22:04:20,937 INFO L388 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 26 treesize of output 20 [2021-03-10 22:04:20,941 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:20,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:20,952 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:20,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:20,994 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:20,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:20,996 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2021-03-10 22:04:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:21,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:21,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:04:21,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699645023] [2021-03-10 22:04:21,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:04:21,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:04:21,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:04:21,245 INFO L87 Difference]: Start difference. First operand 511 states and 1666 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:22,069 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2021-03-10 22:04:22,712 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:04:23,246 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2021-03-10 22:04:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:23,595 INFO L93 Difference]: Finished difference Result 785 states and 2482 transitions. [2021-03-10 22:04:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 22:04:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:23,601 INFO L225 Difference]: With dead ends: 785 [2021-03-10 22:04:23,601 INFO L226 Difference]: Without dead ends: 766 [2021-03-10 22:04:23,601 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2149.3ms TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-03-10 22:04:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-03-10 22:04:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 519. [2021-03-10 22:04:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.27027027027027) internal successors, (1694), 518 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1694 transitions. [2021-03-10 22:04:23,609 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1694 transitions. Word has length 21 [2021-03-10 22:04:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:23,609 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 1694 transitions. [2021-03-10 22:04:23,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1694 transitions. [2021-03-10 22:04:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:23,610 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:23,610 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:23,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 373 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4260 [2021-03-10 22:04:23,811 INFO L428 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1529093347, now seen corresponding path program 373 times [2021-03-10 22:04:23,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:23,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762042676] [2021-03-10 22:04:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:24,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762042676] [2021-03-10 22:04:24,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000421980] [2021-03-10 22:04:24,272 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:24,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:24,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:24,545 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:24,549 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:24,555 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:24,560 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:24,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:24,645 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:24,645 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-03-10 22:04:24,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:24,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:24,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:24,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:24,908 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:24,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:24,981 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:24,981 INFO L518 ElimStorePlain]: Eliminatee v_prenex_843 vanished before elimination [2021-03-10 22:04:24,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:24,984 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:31 [2021-03-10 22:04:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:25,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:25,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:04:25,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322349368] [2021-03-10 22:04:25,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:04:25,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:04:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:04:25,345 INFO L87 Difference]: Start difference. First operand 519 states and 1694 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:26,142 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2021-03-10 22:04:26,787 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2021-03-10 22:04:27,481 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2021-03-10 22:04:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:27,679 INFO L93 Difference]: Finished difference Result 800 states and 2524 transitions. [2021-03-10 22:04:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 22:04:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:27,684 INFO L225 Difference]: With dead ends: 800 [2021-03-10 22:04:27,684 INFO L226 Difference]: Without dead ends: 781 [2021-03-10 22:04:27,685 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2074.3ms TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2021-03-10 22:04:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-03-10 22:04:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 515. [2021-03-10 22:04:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 3.264591439688716) internal successors, (1678), 514 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1678 transitions. [2021-03-10 22:04:27,690 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1678 transitions. Word has length 21 [2021-03-10 22:04:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:27,691 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 1678 transitions. [2021-03-10 22:04:27,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1678 transitions. [2021-03-10 22:04:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:27,691 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:27,691 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:27,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 374 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4270 [2021-03-10 22:04:27,892 INFO L428 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash -910831179, now seen corresponding path program 374 times [2021-03-10 22:04:27,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:27,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369031279] [2021-03-10 22:04:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:28,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369031279] [2021-03-10 22:04:28,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031345940] [2021-03-10 22:04:28,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:28,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-10 22:04:28,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:28,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:28,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:28,539 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:28,543 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:28,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:28,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-10 22:04:28,560 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-03-10 22:04:28,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:28,628 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:28,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:28,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:28,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:28,702 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:28,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:28,704 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2021-03-10 22:04:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:29,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:29,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-03-10 22:04:29,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739274262] [2021-03-10 22:04:29,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 22:04:29,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:29,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 22:04:29,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-03-10 22:04:29,049 INFO L87 Difference]: Start difference. First operand 515 states and 1678 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:30,272 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2021-03-10 22:04:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:30,450 INFO L93 Difference]: Finished difference Result 698 states and 2209 transitions. [2021-03-10 22:04:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 22:04:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:30,454 INFO L225 Difference]: With dead ends: 698 [2021-03-10 22:04:30,454 INFO L226 Difference]: Without dead ends: 679 [2021-03-10 22:04:30,454 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1162.6ms TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-03-10 22:04:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-03-10 22:04:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 511. [2021-03-10 22:04:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2666666666666666) internal successors, (1666), 510 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1666 transitions. [2021-03-10 22:04:30,460 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1666 transitions. Word has length 21 [2021-03-10 22:04:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:30,460 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 1666 transitions. [2021-03-10 22:04:30,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1666 transitions. [2021-03-10 22:04:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:30,460 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:30,460 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:30,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4278,375 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:30,661 INFO L428 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1233428683, now seen corresponding path program 375 times [2021-03-10 22:04:30,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:30,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145931501] [2021-03-10 22:04:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:31,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145931501] [2021-03-10 22:04:31,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794432385] [2021-03-10 22:04:31,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:31,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-10 22:04:31,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:31,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-10 22:04:31,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:31,321 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:31,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:31,331 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:31,335 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:31,376 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:31,378 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:31,379 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 22:04:31,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:31,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:31,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:31,558 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:31,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:31,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:31,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_846 vanished before elimination [2021-03-10 22:04:31,609 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:31,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:31,611 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:19 [2021-03-10 22:04:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:31,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-10 22:04:31,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-03-10 22:04:31,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333131534] [2021-03-10 22:04:31,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 22:04:31,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 22:04:31,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 22:04:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-03-10 22:04:31,989 INFO L87 Difference]: Start difference. First operand 511 states and 1666 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:32,883 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2021-03-10 22:04:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 22:04:33,820 INFO L93 Difference]: Finished difference Result 829 states and 2590 transitions. [2021-03-10 22:04:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 22:04:33,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2021-03-10 22:04:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 22:04:33,825 INFO L225 Difference]: With dead ends: 829 [2021-03-10 22:04:33,825 INFO L226 Difference]: Without dead ends: 806 [2021-03-10 22:04:33,825 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1373.9ms TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2021-03-10 22:04:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-03-10 22:04:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 516. [2021-03-10 22:04:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 3.267961165048544) internal successors, (1683), 515 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1683 transitions. [2021-03-10 22:04:33,831 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1683 transitions. Word has length 21 [2021-03-10 22:04:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 22:04:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 1683 transitions. [2021-03-10 22:04:33,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 22:04:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1683 transitions. [2021-03-10 22:04:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-10 22:04:33,831 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 22:04:33,831 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 22:04:34,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 376 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4284 [2021-03-10 22:04:34,032 INFO L428 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 22:04:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 22:04:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 743639449, now seen corresponding path program 376 times [2021-03-10 22:04:34,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 22:04:34,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981540291] [2021-03-10 22:04:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 22:04:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 22:04:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 22:04:34,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981540291] [2021-03-10 22:04:34,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275026145] [2021-03-10 22:04:34,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-10 22:04:34,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-10 22:04:34,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-10 22:04:34,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-10 22:04:34,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 22:04:34,593 INFO L388 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 17 treesize of output 13 [2021-03-10 22:04:34,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:34,603 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:34,608 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:34,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:34,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-03-10 22:04:34,651 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:25 [2021-03-10 22:04:34,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:34,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:34,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-03-10 22:04:34,777 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:34,923 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-03-10 22:04:34,924 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:34,930 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:34,935 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:34,942 INFO L388 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 9 treesize of output 7 [2021-03-10 22:04:34,947 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-03-10 22:04:35,069 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-03-10 22:04:35,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-10 22:04:35,070 INFO L518 ElimStorePlain]: Eliminatee v_prenex_848 vanished before elimination [2021-03-10 22:04:35,070 INFO L518 ElimStorePlain]: Eliminatee o_4 vanished before elimination [2021-03-10 22:04:35,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-03-10 22:04:35,072 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:57 Received shutdown request... [2021-03-10 22:04:35,136 WARN L222 SmtUtils]: Removed 2 from assertion stack [2021-03-10 22:04:35,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 377 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4293 [2021-03-10 22:04:35,337 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-10 22:04:35,340 WARN L224 ceAbstractionStarter]: Timeout [2021-03-10 22:04:35,340 INFO L202 PluginConnector]: Adding new model chromosome-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 10:04:35 BasicIcfg [2021-03-10 22:04:35,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 22:04:35,341 INFO L168 Benchmark]: Toolchain (without parser) took 838327.42 ms. Allocated memory was 255.9 MB in the beginning and 671.1 MB in the end (delta: 415.2 MB). Free memory was 236.6 MB in the beginning and 349.9 MB in the end (delta: -113.3 MB). Peak memory consumption was 302.4 MB. Max. memory is 16.0 GB. [2021-03-10 22:04:35,341 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 22:04:35,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.59 ms. Allocated memory is still 255.9 MB. Free memory was 236.2 MB in the beginning and 234.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 22:04:35,341 INFO L168 Benchmark]: Boogie Preprocessor took 14.95 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.6 MB in the end (delta: 996.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 22:04:35,341 INFO L168 Benchmark]: RCFGBuilder took 497.31 ms. Allocated memory is still 255.9 MB. Free memory was 233.5 MB in the beginning and 226.4 MB in the end (delta: 7.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.0 GB. [2021-03-10 22:04:35,342 INFO L168 Benchmark]: TraceAbstraction took 837781.54 ms. Allocated memory was 255.9 MB in the beginning and 671.1 MB in the end (delta: 415.2 MB). Free memory was 225.8 MB in the beginning and 349.9 MB in the end (delta: -124.1 MB). Peak memory consumption was 290.4 MB. Max. memory is 16.0 GB. [2021-03-10 22:04:35,342 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 23.59 ms. Allocated memory is still 255.9 MB. Free memory was 236.2 MB in the beginning and 234.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.95 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.6 MB in the end (delta: 996.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 497.31 ms. Allocated memory is still 255.9 MB. Free memory was 233.5 MB in the beginning and 226.4 MB in the end (delta: 7.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 837781.54 ms. Allocated memory was 255.9 MB in the beginning and 671.1 MB in the end (delta: 415.2 MB). Free memory was 225.8 MB in the beginning and 349.9 MB in the end (delta: -124.1 MB). Peak memory consumption was 290.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 107). Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 19 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 837664.2ms, OverallIterations: 388, TraceHistogramMax: 2, EmptinessCheckTime: 246.9ms, AutomataDifference: 384574.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22909 SDtfs, 25470 SDslu, 130123 SDs, 0 SdLazy, 167805 SolverSat, 9147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89961.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13422 GetRequests, 4983 SyntacticMatches, 893 SemanticMatches, 7546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38216 ImplicationChecksByTransitivity, 351496.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=519occurred in iteration=384, InterpolantAutomatonStates: 5059, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2164.8ms AutomataMinimizationTime, 387 MinimizatonAttempts, 66972 StatesRemovedByMinimization, 383 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1640.4ms SsaConstructionTime, 4055.6ms SatisfiabilityAnalysisTime, 361513.6ms InterpolantComputationTime, 15579 NumberOfCodeBlocks, 15579 NumberOfCodeBlocksAsserted, 1135 NumberOfCheckSat, 14817 ConstructedInterpolants, 784 QuantifiedInterpolants, 227267 SizeOfPredicates, 3793 NumberOfNonLiveVariables, 31628 ConjunctsInSsa, 7861 ConjunctsInUnsatCore, 762 InterpolantComputations, 12 PerfectInterpolantSequences, 312/2983 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