/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/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/poker-hand-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 20:10:26,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 20:10:26,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 20:10:26,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 20:10:26,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 20:10:26,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 20:10:26,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 20:10:26,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 20:10:26,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 20:10:26,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 20:10:26,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 20:10:26,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 20:10:26,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 20:10:26,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 20:10:26,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 20:10:26,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 20:10:26,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 20:10:26,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 20:10:26,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 20:10:26,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 20:10:26,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 20:10:26,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 20:10:26,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 20:10:26,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 20:10:26,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 20:10:26,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 20:10:26,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 20:10:26,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 20:10:26,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 20:10:26,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 20:10:26,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 20:10:26,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 20:10:26,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 20:10:26,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 20:10:26,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 20:10:26,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 20:10:26,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 20:10:26,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 20:10:26,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 20:10:26,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 20:10:26,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 20:10:26,853 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-06-12 20:10:26,882 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 20:10:26,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 20:10:26,883 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 20:10:26,883 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 20:10:26,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 20:10:26,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 20:10:26,884 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 20:10:26,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 20:10:26,884 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 20:10:26,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 20:10:26,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 20:10:26,886 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 20:10:26,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 20:10:26,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 20:10:26,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 20:10:26,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 20:10:26,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 20:10:26,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 20:10:26,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 20:10:26,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 20:10:26,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 20:10:26,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 20:10:26,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 20:10:26,887 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 20:10:26,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 20:10:26,888 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-06-12 20:10:27,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 20:10:27,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 20:10:27,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 20:10:27,191 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-12 20:10:27,194 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-12 20:10:27,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl [2021-06-12 20:10:27,195 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl' [2021-06-12 20:10:27,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 20:10:27,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-12 20:10:27,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 20:10:27,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 20:10:27,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 20:10:27,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 20:10:27,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 20:10:27,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 20:10:27,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 20:10:27,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/1) ... [2021-06-12 20:10:27,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 20:10:27,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 20:10:27,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 20:10:27,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 20:10:27,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (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-06-12 20:10:27,523 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-12 20:10:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-12 20:10:27,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-12 20:10:27,523 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-12 20:10:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-12 20:10:27,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-12 20:10:27,524 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-12 20:10:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 20:10:27,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 20:10:27,524 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-12 20:10:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-12 20:10:27,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-12 20:10:27,526 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 20:10:28,418 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 20:10:28,419 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-12 20:10:28,421 INFO L202 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 08:10:28 BoogieIcfgContainer [2021-06-12 20:10:28,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 20:10:28,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 20:10:28,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 20:10:28,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 20:10:28,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:10:27" (1/2) ... [2021-06-12 20:10:28,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73911241 and model type poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 08:10:28, skipping insertion in model container [2021-06-12 20:10:28,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 08:10:28" (2/2) ... [2021-06-12 20:10:28,435 INFO L111 eAbstractionObserver]: Analyzing ICFG poker-hand-subst.wvr.bpl [2021-06-12 20:10:28,440 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 20:10:28,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 20:10:28,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-12 20:10:28,442 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 20:10:28,494 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-12 20:10:28,516 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-12 20:10:28,531 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:10:28,532 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:10:28,532 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:10:28,532 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:10:28,532 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:10:28,532 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:10:28,532 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:10:28,532 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 20:10:28,540 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 37 transitions, 98 flow [2021-06-12 20:10:28,562 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-12 20:10:28,575 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:28,576 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:28,576 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2024028845, now seen corresponding path program 1 times [2021-06-12 20:10:28,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:28,588 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805292262] [2021-06-12 20:10:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:29,427 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-06-12 20:10:29,827 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2021-06-12 20:10:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:29,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:29,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805292262] [2021-06-12 20:10:29,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805292262] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:29,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:29,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:29,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747763753] [2021-06-12 20:10:29,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:29,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:29,924 INFO L87 Difference]: Start difference. First operand has 191 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 0 states have call successors, (0), 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 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:30,237 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-06-12 20:10:30,567 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-12 20:10:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:30,670 INFO L93 Difference]: Finished difference Result 474 states and 1876 transitions. [2021-06-12 20:10:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-12 20:10:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:30,695 INFO L225 Difference]: With dead ends: 474 [2021-06-12 20:10:30,695 INFO L226 Difference]: Without dead ends: 459 [2021-06-12 20:10:30,697 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1117.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-12 20:10:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 223. [2021-06-12 20:10:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 4.324324324324325) internal successors, (960), 222 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-06-12 20:10:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 960 transitions. [2021-06-12 20:10:30,806 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 960 transitions. Word has length 14 [2021-06-12 20:10:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:30,807 INFO L482 AbstractCegarLoop]: Abstraction has 223 states and 960 transitions. [2021-06-12 20:10:30,807 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 960 transitions. [2021-06-12 20:10:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-12 20:10:30,810 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:30,810 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:30,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 20:10:30,810 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1233644461, now seen corresponding path program 2 times [2021-06-12 20:10:30,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:30,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799923364] [2021-06-12 20:10:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:31,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:31,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799923364] [2021-06-12 20:10:31,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799923364] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:31,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:31,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:31,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512342954] [2021-06-12 20:10:31,190 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:31,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:31,191 INFO L87 Difference]: Start difference. First operand 223 states and 960 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:31,440 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-12 20:10:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:31,723 INFO L93 Difference]: Finished difference Result 685 states and 2857 transitions. [2021-06-12 20:10:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:31,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-12 20:10:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:31,728 INFO L225 Difference]: With dead ends: 685 [2021-06-12 20:10:31,729 INFO L226 Difference]: Without dead ends: 670 [2021-06-12 20:10:31,729 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 527.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:10:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-06-12 20:10:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 227. [2021-06-12 20:10:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 4.300884955752212) internal successors, (972), 226 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-06-12 20:10:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 972 transitions. [2021-06-12 20:10:31,747 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 972 transitions. Word has length 14 [2021-06-12 20:10:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:31,747 INFO L482 AbstractCegarLoop]: Abstraction has 227 states and 972 transitions. [2021-06-12 20:10:31,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 972 transitions. [2021-06-12 20:10:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-12 20:10:31,750 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:31,750 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:31,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 20:10:31,750 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:31,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1840634711, now seen corresponding path program 3 times [2021-06-12 20:10:31,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:31,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234110776] [2021-06-12 20:10:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:32,038 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2021-06-12 20:10:32,195 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2021-06-12 20:10:32,615 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2021-06-12 20:10:32,765 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2021-06-12 20:10:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:32,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:32,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234110776] [2021-06-12 20:10:32,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234110776] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:32,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:32,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:32,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736625547] [2021-06-12 20:10:32,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:32,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:32,768 INFO L87 Difference]: Start difference. First operand 227 states and 972 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:33,217 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2021-06-12 20:10:33,567 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2021-06-12 20:10:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:33,711 INFO L93 Difference]: Finished difference Result 506 states and 2014 transitions. [2021-06-12 20:10:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:33,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-12 20:10:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:33,715 INFO L225 Difference]: With dead ends: 506 [2021-06-12 20:10:33,715 INFO L226 Difference]: Without dead ends: 491 [2021-06-12 20:10:33,715 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1390.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-06-12 20:10:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 234. [2021-06-12 20:10:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 4.309012875536481) internal successors, (1004), 233 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-06-12 20:10:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1004 transitions. [2021-06-12 20:10:33,735 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1004 transitions. Word has length 14 [2021-06-12 20:10:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:33,735 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 1004 transitions. [2021-06-12 20:10:33,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1004 transitions. [2021-06-12 20:10:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-12 20:10:33,740 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:33,740 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:33,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 20:10:33,740 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash -867555397, now seen corresponding path program 4 times [2021-06-12 20:10:33,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:33,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303852535] [2021-06-12 20:10:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:34,397 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2021-06-12 20:10:34,544 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 131 [2021-06-12 20:10:35,003 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2021-06-12 20:10:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:35,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:35,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303852535] [2021-06-12 20:10:35,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303852535] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:35,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:35,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:35,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209437485] [2021-06-12 20:10:35,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:35,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:35,119 INFO L87 Difference]: Start difference. First operand 234 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:35,581 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 129 [2021-06-12 20:10:35,938 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 117 [2021-06-12 20:10:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:36,057 INFO L93 Difference]: Finished difference Result 526 states and 2085 transitions. [2021-06-12 20:10:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-12 20:10:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:36,061 INFO L225 Difference]: With dead ends: 526 [2021-06-12 20:10:36,062 INFO L226 Difference]: Without dead ends: 511 [2021-06-12 20:10:36,062 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1732.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-06-12 20:10:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 240. [2021-06-12 20:10:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 4.2803347280334725) internal successors, (1023), 239 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1023 transitions. [2021-06-12 20:10:36,073 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1023 transitions. Word has length 14 [2021-06-12 20:10:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:36,074 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 1023 transitions. [2021-06-12 20:10:36,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1023 transitions. [2021-06-12 20:10:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-12 20:10:36,075 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:36,075 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:36,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 20:10:36,076 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash 922889575, now seen corresponding path program 5 times [2021-06-12 20:10:36,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:36,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745826840] [2021-06-12 20:10:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:36,407 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:36,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745826840] [2021-06-12 20:10:36,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745826840] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:36,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:36,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:36,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046704639] [2021-06-12 20:10:36,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:36,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:36,408 INFO L87 Difference]: Start difference. First operand 240 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:36,824 INFO L93 Difference]: Finished difference Result 697 states and 2896 transitions. [2021-06-12 20:10:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-12 20:10:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:36,830 INFO L225 Difference]: With dead ends: 697 [2021-06-12 20:10:36,830 INFO L226 Difference]: Without dead ends: 682 [2021-06-12 20:10:36,831 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 415.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:10:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-06-12 20:10:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 242. [2021-06-12 20:10:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 4.2987551867219915) internal successors, (1036), 241 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1036 transitions. [2021-06-12 20:10:36,847 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1036 transitions. Word has length 14 [2021-06-12 20:10:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:36,847 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 1036 transitions. [2021-06-12 20:10:36,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1036 transitions. [2021-06-12 20:10:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-12 20:10:36,849 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:36,849 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:36,849 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 20:10:36,849 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:36,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash 594755113, now seen corresponding path program 6 times [2021-06-12 20:10:36,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:36,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479162628] [2021-06-12 20:10:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:37,126 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2021-06-12 20:10:37,441 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2021-06-12 20:10:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:37,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:37,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479162628] [2021-06-12 20:10:37,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479162628] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:37,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:37,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:37,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592752053] [2021-06-12 20:10:37,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:37,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:37,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:37,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:37,495 INFO L87 Difference]: Start difference. First operand 242 states and 1036 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:37,709 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-06-12 20:10:37,914 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-06-12 20:10:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,006 INFO L93 Difference]: Finished difference Result 505 states and 1974 transitions. [2021-06-12 20:10:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-12 20:10:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,010 INFO L225 Difference]: With dead ends: 505 [2021-06-12 20:10:38,010 INFO L226 Difference]: Without dead ends: 490 [2021-06-12 20:10:38,010 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 814.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-06-12 20:10:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 263. [2021-06-12 20:10:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 4.198473282442748) internal successors, (1100), 262 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1100 transitions. [2021-06-12 20:10:38,021 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1100 transitions. Word has length 14 [2021-06-12 20:10:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,021 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 1100 transitions. [2021-06-12 20:10:38,021 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1100 transitions. [2021-06-12 20:10:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-12 20:10:38,022 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,022 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,022 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 20:10:38,022 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1857764697, now seen corresponding path program 1 times [2021-06-12 20:10:38,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349749591] [2021-06-12 20:10:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:38,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349749591] [2021-06-12 20:10:38,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349749591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:10:38,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904035200] [2021-06-12 20:10:38,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:10:38,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:10:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,038 INFO L87 Difference]: Start difference. First operand 263 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,044 INFO L93 Difference]: Finished difference Result 303 states and 1256 transitions. [2021-06-12 20:10:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:10:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-12 20:10:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,046 INFO L225 Difference]: With dead ends: 303 [2021-06-12 20:10:38,046 INFO L226 Difference]: Without dead ends: 303 [2021-06-12 20:10:38,046 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-12 20:10:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2021-06-12 20:10:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 4.158940397350993) internal successors, (1256), 302 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 1256 transitions. [2021-06-12 20:10:38,056 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 1256 transitions. Word has length 15 [2021-06-12 20:10:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,056 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 1256 transitions. [2021-06-12 20:10:38,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 1256 transitions. [2021-06-12 20:10:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-12 20:10:38,057 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,058 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 20:10:38,058 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1693444409, now seen corresponding path program 1 times [2021-06-12 20:10:38,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16531494] [2021-06-12 20:10:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:38,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16531494] [2021-06-12 20:10:38,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16531494] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:10:38,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392853716] [2021-06-12 20:10:38,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:10:38,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:10:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,074 INFO L87 Difference]: Start difference. First operand 303 states and 1256 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,079 INFO L93 Difference]: Finished difference Result 343 states and 1412 transitions. [2021-06-12 20:10:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:10:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-12 20:10:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,082 INFO L225 Difference]: With dead ends: 343 [2021-06-12 20:10:38,082 INFO L226 Difference]: Without dead ends: 343 [2021-06-12 20:10:38,083 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-06-12 20:10:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-06-12 20:10:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 4.128654970760234) internal successors, (1412), 342 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1412 transitions. [2021-06-12 20:10:38,092 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1412 transitions. Word has length 15 [2021-06-12 20:10:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,093 INFO L482 AbstractCegarLoop]: Abstraction has 343 states and 1412 transitions. [2021-06-12 20:10:38,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1412 transitions. [2021-06-12 20:10:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-12 20:10:38,094 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,094 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 20:10:38,094 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2109293491, now seen corresponding path program 1 times [2021-06-12 20:10:38,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236882283] [2021-06-12 20:10:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:38,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236882283] [2021-06-12 20:10:38,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236882283] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:10:38,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219341034] [2021-06-12 20:10:38,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:10:38,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:10:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,138 INFO L87 Difference]: Start difference. First operand 343 states and 1412 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,145 INFO L93 Difference]: Finished difference Result 386 states and 1566 transitions. [2021-06-12 20:10:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:10:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-12 20:10:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,151 INFO L225 Difference]: With dead ends: 386 [2021-06-12 20:10:38,151 INFO L226 Difference]: Without dead ends: 386 [2021-06-12 20:10:38,152 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-12 20:10:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-06-12 20:10:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 4.067532467532468) internal successors, (1566), 385 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1566 transitions. [2021-06-12 20:10:38,163 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1566 transitions. Word has length 15 [2021-06-12 20:10:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,163 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1566 transitions. [2021-06-12 20:10:38,163 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1566 transitions. [2021-06-12 20:10:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-12 20:10:38,165 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,165 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 20:10:38,165 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1748926659, now seen corresponding path program 1 times [2021-06-12 20:10:38,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261871009] [2021-06-12 20:10:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:38,177 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261871009] [2021-06-12 20:10:38,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261871009] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:10:38,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125074855] [2021-06-12 20:10:38,178 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:10:38,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:10:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,179 INFO L87 Difference]: Start difference. First operand 386 states and 1566 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,185 INFO L93 Difference]: Finished difference Result 439 states and 1766 transitions. [2021-06-12 20:10:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:10:38,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-12 20:10:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,189 INFO L225 Difference]: With dead ends: 439 [2021-06-12 20:10:38,189 INFO L226 Difference]: Without dead ends: 439 [2021-06-12 20:10:38,190 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-06-12 20:10:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-06-12 20:10:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 4.031963470319635) internal successors, (1766), 438 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1766 transitions. [2021-06-12 20:10:38,204 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1766 transitions. Word has length 15 [2021-06-12 20:10:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,204 INFO L482 AbstractCegarLoop]: Abstraction has 439 states and 1766 transitions. [2021-06-12 20:10:38,204 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1766 transitions. [2021-06-12 20:10:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-12 20:10:38,206 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,206 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,206 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 20:10:38,206 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash 181705837, now seen corresponding path program 1 times [2021-06-12 20:10:38,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737181652] [2021-06-12 20:10:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:38,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737181652] [2021-06-12 20:10:38,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737181652] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:10:38,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343617892] [2021-06-12 20:10:38,225 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:10:38,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:10:38,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,226 INFO L87 Difference]: Start difference. First operand 439 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,234 INFO L93 Difference]: Finished difference Result 489 states and 1957 transitions. [2021-06-12 20:10:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:10:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-12 20:10:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,238 INFO L225 Difference]: With dead ends: 489 [2021-06-12 20:10:38,238 INFO L226 Difference]: Without dead ends: 489 [2021-06-12 20:10:38,239 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-12 20:10:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2021-06-12 20:10:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 4.010245901639344) internal successors, (1957), 488 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1957 transitions. [2021-06-12 20:10:38,253 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1957 transitions. Word has length 15 [2021-06-12 20:10:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,254 INFO L482 AbstractCegarLoop]: Abstraction has 489 states and 1957 transitions. [2021-06-12 20:10:38,254 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1957 transitions. [2021-06-12 20:10:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-12 20:10:38,256 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,256 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 20:10:38,257 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash 542072669, now seen corresponding path program 1 times [2021-06-12 20:10:38,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128197157] [2021-06-12 20:10:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:38,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128197157] [2021-06-12 20:10:38,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128197157] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:10:38,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119930607] [2021-06-12 20:10:38,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:10:38,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:10:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,273 INFO L87 Difference]: Start difference. First operand 489 states and 1957 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,280 INFO L93 Difference]: Finished difference Result 549 states and 2181 transitions. [2021-06-12 20:10:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:10:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-12 20:10:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,284 INFO L225 Difference]: With dead ends: 549 [2021-06-12 20:10:38,284 INFO L226 Difference]: Without dead ends: 549 [2021-06-12 20:10:38,285 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:10:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-06-12 20:10:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2021-06-12 20:10:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 3.97992700729927) internal successors, (2181), 548 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 2181 transitions. [2021-06-12 20:10:38,307 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 2181 transitions. Word has length 15 [2021-06-12 20:10:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,309 INFO L482 AbstractCegarLoop]: Abstraction has 549 states and 2181 transitions. [2021-06-12 20:10:38,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 2181 transitions. [2021-06-12 20:10:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:38,311 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,311 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 20:10:38,312 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash 705140398, now seen corresponding path program 1 times [2021-06-12 20:10:38,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225909813] [2021-06-12 20:10:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:38,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225909813] [2021-06-12 20:10:38,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225909813] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:38,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302108130] [2021-06-12 20:10:38,335 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:38,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:38,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:38,335 INFO L87 Difference]: Start difference. First operand 549 states and 2181 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,369 INFO L93 Difference]: Finished difference Result 789 states and 2890 transitions. [2021-06-12 20:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 20:10:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,374 INFO L225 Difference]: With dead ends: 789 [2021-06-12 20:10:38,374 INFO L226 Difference]: Without dead ends: 689 [2021-06-12 20:10:38,374 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-06-12 20:10:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 565. [2021-06-12 20:10:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.891843971631206) internal successors, (2195), 564 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 2195 transitions. [2021-06-12 20:10:38,391 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 2195 transitions. Word has length 16 [2021-06-12 20:10:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,391 INFO L482 AbstractCegarLoop]: Abstraction has 565 states and 2195 transitions. [2021-06-12 20:10:38,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 2195 transitions. [2021-06-12 20:10:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:38,393 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,393 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,393 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 20:10:38,393 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1842088947, now seen corresponding path program 1 times [2021-06-12 20:10:38,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038904508] [2021-06-12 20:10:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:38,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038904508] [2021-06-12 20:10:38,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038904508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:38,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742285844] [2021-06-12 20:10:38,554 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:38,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:38,555 INFO L87 Difference]: Start difference. First operand 565 states and 2195 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:38,779 INFO L93 Difference]: Finished difference Result 1056 states and 3563 transitions. [2021-06-12 20:10:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:38,785 INFO L225 Difference]: With dead ends: 1056 [2021-06-12 20:10:38,785 INFO L226 Difference]: Without dead ends: 903 [2021-06-12 20:10:38,785 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 211.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-06-12 20:10:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 566. [2021-06-12 20:10:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 3.720353982300885) internal successors, (2102), 565 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 2102 transitions. [2021-06-12 20:10:38,805 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 2102 transitions. Word has length 16 [2021-06-12 20:10:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:38,806 INFO L482 AbstractCegarLoop]: Abstraction has 566 states and 2102 transitions. [2021-06-12 20:10:38,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 2102 transitions. [2021-06-12 20:10:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:38,808 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:38,808 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:38,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 20:10:38,808 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash -881757258, now seen corresponding path program 1 times [2021-06-12 20:10:38,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:38,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429914448] [2021-06-12 20:10:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:38,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:38,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429914448] [2021-06-12 20:10:38,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429914448] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:38,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:38,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:38,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579959761] [2021-06-12 20:10:38,894 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:38,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:38,895 INFO L87 Difference]: Start difference. First operand 566 states and 2102 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:39,010 INFO L93 Difference]: Finished difference Result 856 states and 2892 transitions. [2021-06-12 20:10:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:39,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:39,014 INFO L225 Difference]: With dead ends: 856 [2021-06-12 20:10:39,014 INFO L226 Difference]: Without dead ends: 814 [2021-06-12 20:10:39,015 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-06-12 20:10:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 540. [2021-06-12 20:10:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 3.640074211502783) internal successors, (1962), 539 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1962 transitions. [2021-06-12 20:10:39,034 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1962 transitions. Word has length 16 [2021-06-12 20:10:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:39,035 INFO L482 AbstractCegarLoop]: Abstraction has 540 states and 1962 transitions. [2021-06-12 20:10:39,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1962 transitions. [2021-06-12 20:10:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:39,037 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:39,037 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:39,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 20:10:39,037 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 768619160, now seen corresponding path program 1 times [2021-06-12 20:10:39,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:39,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446834829] [2021-06-12 20:10:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:39,095 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:39,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446834829] [2021-06-12 20:10:39,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446834829] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:39,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:39,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:39,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264023051] [2021-06-12 20:10:39,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:39,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:39,096 INFO L87 Difference]: Start difference. First operand 540 states and 1962 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:39,175 INFO L93 Difference]: Finished difference Result 783 states and 2585 transitions. [2021-06-12 20:10:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:39,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:39,180 INFO L225 Difference]: With dead ends: 783 [2021-06-12 20:10:39,180 INFO L226 Difference]: Without dead ends: 746 [2021-06-12 20:10:39,180 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-06-12 20:10:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 560. [2021-06-12 20:10:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.5778175313059033) internal successors, (2000), 559 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 2000 transitions. [2021-06-12 20:10:39,199 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 2000 transitions. Word has length 16 [2021-06-12 20:10:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:39,199 INFO L482 AbstractCegarLoop]: Abstraction has 560 states and 2000 transitions. [2021-06-12 20:10:39,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 2000 transitions. [2021-06-12 20:10:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:39,201 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:39,201 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:39,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 20:10:39,202 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1488759573, now seen corresponding path program 1 times [2021-06-12 20:10:39,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:39,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484905798] [2021-06-12 20:10:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:39,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:39,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484905798] [2021-06-12 20:10:39,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484905798] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:39,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:39,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:39,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515027752] [2021-06-12 20:10:39,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:39,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:39,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:39,589 INFO L87 Difference]: Start difference. First operand 560 states and 2000 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:39,792 INFO L93 Difference]: Finished difference Result 839 states and 2793 transitions. [2021-06-12 20:10:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:39,796 INFO L225 Difference]: With dead ends: 839 [2021-06-12 20:10:39,796 INFO L226 Difference]: Without dead ends: 797 [2021-06-12 20:10:39,797 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 390.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-06-12 20:10:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 560. [2021-06-12 20:10:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.5706618962432914) internal successors, (1996), 559 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1996 transitions. [2021-06-12 20:10:39,815 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1996 transitions. Word has length 16 [2021-06-12 20:10:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:39,815 INFO L482 AbstractCegarLoop]: Abstraction has 560 states and 1996 transitions. [2021-06-12 20:10:39,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1996 transitions. [2021-06-12 20:10:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:39,817 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:39,817 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:39,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 20:10:39,817 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash 185156587, now seen corresponding path program 1 times [2021-06-12 20:10:39,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:39,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188397181] [2021-06-12 20:10:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:39,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:39,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188397181] [2021-06-12 20:10:39,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188397181] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:39,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:39,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:39,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79900108] [2021-06-12 20:10:39,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:39,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:39,848 INFO L87 Difference]: Start difference. First operand 560 states and 1996 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:39,886 INFO L93 Difference]: Finished difference Result 694 states and 2293 transitions. [2021-06-12 20:10:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 20:10:39,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:39,890 INFO L225 Difference]: With dead ends: 694 [2021-06-12 20:10:39,890 INFO L226 Difference]: Without dead ends: 613 [2021-06-12 20:10:39,890 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-12 20:10:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 490. [2021-06-12 20:10:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.5337423312883436) internal successors, (1728), 489 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1728 transitions. [2021-06-12 20:10:39,903 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1728 transitions. Word has length 16 [2021-06-12 20:10:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:39,903 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1728 transitions. [2021-06-12 20:10:39,903 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1728 transitions. [2021-06-12 20:10:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:39,905 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:39,905 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:39,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 20:10:39,905 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1866944204, now seen corresponding path program 2 times [2021-06-12 20:10:39,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:39,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545707241] [2021-06-12 20:10:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:39,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:39,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545707241] [2021-06-12 20:10:39,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545707241] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:39,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:39,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:39,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054005234] [2021-06-12 20:10:39,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:39,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:39,969 INFO L87 Difference]: Start difference. First operand 490 states and 1728 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:40,103 INFO L93 Difference]: Finished difference Result 937 states and 3020 transitions. [2021-06-12 20:10:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:40,107 INFO L225 Difference]: With dead ends: 937 [2021-06-12 20:10:40,108 INFO L226 Difference]: Without dead ends: 819 [2021-06-12 20:10:40,108 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-06-12 20:10:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 479. [2021-06-12 20:10:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 3.50418410041841) internal successors, (1675), 478 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1675 transitions. [2021-06-12 20:10:40,123 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1675 transitions. Word has length 16 [2021-06-12 20:10:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:40,123 INFO L482 AbstractCegarLoop]: Abstraction has 479 states and 1675 transitions. [2021-06-12 20:10:40,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1675 transitions. [2021-06-12 20:10:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:40,125 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:40,125 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:40,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 20:10:40,126 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1453708437, now seen corresponding path program 2 times [2021-06-12 20:10:40,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:40,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529312622] [2021-06-12 20:10:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:40,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:40,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529312622] [2021-06-12 20:10:40,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529312622] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:40,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:40,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:40,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107474947] [2021-06-12 20:10:40,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:40,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:40,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:40,294 INFO L87 Difference]: Start difference. First operand 479 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:40,541 INFO L93 Difference]: Finished difference Result 990 states and 3110 transitions. [2021-06-12 20:10:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:40,545 INFO L225 Difference]: With dead ends: 990 [2021-06-12 20:10:40,545 INFO L226 Difference]: Without dead ends: 861 [2021-06-12 20:10:40,545 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 219.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-06-12 20:10:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 447. [2021-06-12 20:10:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.3430493273542603) internal successors, (1491), 446 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1491 transitions. [2021-06-12 20:10:40,558 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1491 transitions. Word has length 16 [2021-06-12 20:10:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:40,559 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1491 transitions. [2021-06-12 20:10:40,559 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1491 transitions. [2021-06-12 20:10:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:40,560 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:40,560 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:40,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 20:10:40,560 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:40,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1227931188, now seen corresponding path program 2 times [2021-06-12 20:10:40,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:40,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246584769] [2021-06-12 20:10:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:40,656 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:40,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246584769] [2021-06-12 20:10:40,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246584769] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:40,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:40,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:40,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226187881] [2021-06-12 20:10:40,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:40,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:40,657 INFO L87 Difference]: Start difference. First operand 447 states and 1491 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:40,836 INFO L93 Difference]: Finished difference Result 772 states and 2437 transitions. [2021-06-12 20:10:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:10:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:40,839 INFO L225 Difference]: With dead ends: 772 [2021-06-12 20:10:40,839 INFO L226 Difference]: Without dead ends: 749 [2021-06-12 20:10:40,840 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 144.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:10:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-06-12 20:10:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 447. [2021-06-12 20:10:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.3430493273542603) internal successors, (1491), 446 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1491 transitions. [2021-06-12 20:10:40,852 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1491 transitions. Word has length 16 [2021-06-12 20:10:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:40,852 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1491 transitions. [2021-06-12 20:10:40,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1491 transitions. [2021-06-12 20:10:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:40,854 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:40,854 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:40,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-12 20:10:40,854 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1214418261, now seen corresponding path program 2 times [2021-06-12 20:10:40,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:40,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401713079] [2021-06-12 20:10:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:41,062 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-12 20:10:41,188 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2021-06-12 20:10:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:41,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:41,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401713079] [2021-06-12 20:10:41,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401713079] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:41,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:41,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:41,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470449151] [2021-06-12 20:10:41,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:41,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:41,224 INFO L87 Difference]: Start difference. First operand 447 states and 1491 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,389 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2021-06-12 20:10:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:41,604 INFO L93 Difference]: Finished difference Result 756 states and 2389 transitions. [2021-06-12 20:10:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:41,608 INFO L225 Difference]: With dead ends: 756 [2021-06-12 20:10:41,608 INFO L226 Difference]: Without dead ends: 729 [2021-06-12 20:10:41,608 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 583.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2021-06-12 20:10:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 447. [2021-06-12 20:10:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.3385650224215246) internal successors, (1489), 446 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-06-12 20:10:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1489 transitions. [2021-06-12 20:10:41,620 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1489 transitions. Word has length 16 [2021-06-12 20:10:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:41,621 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1489 transitions. [2021-06-12 20:10:41,621 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1489 transitions. [2021-06-12 20:10:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:41,622 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:41,622 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:41,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-12 20:10:41,622 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 423749436, now seen corresponding path program 3 times [2021-06-12 20:10:41,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:41,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266925822] [2021-06-12 20:10:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:41,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:41,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266925822] [2021-06-12 20:10:41,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266925822] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:41,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:41,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:41,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633808484] [2021-06-12 20:10:41,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:41,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:41,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:41,671 INFO L87 Difference]: Start difference. First operand 447 states and 1489 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:41,734 INFO L93 Difference]: Finished difference Result 570 states and 1746 transitions. [2021-06-12 20:10:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:41,736 INFO L225 Difference]: With dead ends: 570 [2021-06-12 20:10:41,736 INFO L226 Difference]: Without dead ends: 521 [2021-06-12 20:10:41,736 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-06-12 20:10:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 411. [2021-06-12 20:10:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.3) internal successors, (1353), 410 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1353 transitions. [2021-06-12 20:10:41,746 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1353 transitions. Word has length 16 [2021-06-12 20:10:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:41,747 INFO L482 AbstractCegarLoop]: Abstraction has 411 states and 1353 transitions. [2021-06-12 20:10:41,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1353 transitions. [2021-06-12 20:10:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:41,748 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:41,748 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:41,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-12 20:10:41,748 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash 486403162, now seen corresponding path program 3 times [2021-06-12 20:10:41,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:41,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717512225] [2021-06-12 20:10:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:41,800 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:41,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717512225] [2021-06-12 20:10:41,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717512225] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:41,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:41,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:41,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113065120] [2021-06-12 20:10:41,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:41,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:41,801 INFO L87 Difference]: Start difference. First operand 411 states and 1353 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:41,885 INFO L93 Difference]: Finished difference Result 529 states and 1624 transitions. [2021-06-12 20:10:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:41,887 INFO L225 Difference]: With dead ends: 529 [2021-06-12 20:10:41,887 INFO L226 Difference]: Without dead ends: 506 [2021-06-12 20:10:41,887 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-06-12 20:10:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 430. [2021-06-12 20:10:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.2634032634032635) internal successors, (1400), 429 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1400 transitions. [2021-06-12 20:10:41,898 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1400 transitions. Word has length 16 [2021-06-12 20:10:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:41,898 INFO L482 AbstractCegarLoop]: Abstraction has 430 states and 1400 transitions. [2021-06-12 20:10:41,898 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1400 transitions. [2021-06-12 20:10:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:41,900 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:41,900 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:41,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-12 20:10:41,900 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1119769510, now seen corresponding path program 4 times [2021-06-12 20:10:41,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:41,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008424730] [2021-06-12 20:10:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:41,958 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:41,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008424730] [2021-06-12 20:10:41,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008424730] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:41,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:41,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:41,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806003539] [2021-06-12 20:10:41,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:41,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:41,959 INFO L87 Difference]: Start difference. First operand 430 states and 1400 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:42,054 INFO L93 Difference]: Finished difference Result 537 states and 1643 transitions. [2021-06-12 20:10:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:42,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:42,056 INFO L225 Difference]: With dead ends: 537 [2021-06-12 20:10:42,056 INFO L226 Difference]: Without dead ends: 514 [2021-06-12 20:10:42,056 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-06-12 20:10:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2021-06-12 20:10:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.2460136674259683) internal successors, (1425), 439 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1425 transitions. [2021-06-12 20:10:42,072 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1425 transitions. Word has length 16 [2021-06-12 20:10:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:42,072 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1425 transitions. [2021-06-12 20:10:42,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1425 transitions. [2021-06-12 20:10:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:42,075 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:42,075 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:42,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-12 20:10:42,075 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2014690215, now seen corresponding path program 3 times [2021-06-12 20:10:42,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:42,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123688747] [2021-06-12 20:10:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:42,264 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-12 20:10:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:42,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:42,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123688747] [2021-06-12 20:10:42,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123688747] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:42,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:42,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:42,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432403604] [2021-06-12 20:10:42,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:42,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:42,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:42,294 INFO L87 Difference]: Start difference. First operand 440 states and 1425 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:42,544 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2021-06-12 20:10:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:42,568 INFO L93 Difference]: Finished difference Result 558 states and 1685 transitions. [2021-06-12 20:10:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:42,570 INFO L225 Difference]: With dead ends: 558 [2021-06-12 20:10:42,570 INFO L226 Difference]: Without dead ends: 516 [2021-06-12 20:10:42,570 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 359.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-06-12 20:10:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 440. [2021-06-12 20:10:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.225512528473804) internal successors, (1416), 439 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-06-12 20:10:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1416 transitions. [2021-06-12 20:10:42,580 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1416 transitions. Word has length 16 [2021-06-12 20:10:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:42,581 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1416 transitions. [2021-06-12 20:10:42,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1416 transitions. [2021-06-12 20:10:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:42,582 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:42,582 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:42,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-12 20:10:42,582 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1307197767, now seen corresponding path program 4 times [2021-06-12 20:10:42,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:42,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717184292] [2021-06-12 20:10:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:42,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:42,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717184292] [2021-06-12 20:10:42,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717184292] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:42,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:42,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:42,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196444931] [2021-06-12 20:10:42,752 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:42,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:42,752 INFO L87 Difference]: Start difference. First operand 440 states and 1416 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:42,983 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2021-06-12 20:10:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:43,002 INFO L93 Difference]: Finished difference Result 547 states and 1649 transitions. [2021-06-12 20:10:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:43,004 INFO L225 Difference]: With dead ends: 547 [2021-06-12 20:10:43,004 INFO L226 Difference]: Without dead ends: 514 [2021-06-12 20:10:43,004 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 304.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-06-12 20:10:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2021-06-12 20:10:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.214123006833713) internal successors, (1411), 439 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1411 transitions. [2021-06-12 20:10:43,014 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1411 transitions. Word has length 16 [2021-06-12 20:10:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:43,014 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1411 transitions. [2021-06-12 20:10:43,014 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1411 transitions. [2021-06-12 20:10:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:43,016 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:43,016 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:43,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-12 20:10:43,016 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash 648487496, now seen corresponding path program 2 times [2021-06-12 20:10:43,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:43,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297248480] [2021-06-12 20:10:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:43,099 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:43,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297248480] [2021-06-12 20:10:43,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297248480] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:43,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:43,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:43,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683885586] [2021-06-12 20:10:43,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:43,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:43,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:43,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:43,100 INFO L87 Difference]: Start difference. First operand 440 states and 1411 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:43,187 INFO L93 Difference]: Finished difference Result 727 states and 2197 transitions. [2021-06-12 20:10:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:10:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:43,190 INFO L225 Difference]: With dead ends: 727 [2021-06-12 20:10:43,190 INFO L226 Difference]: Without dead ends: 679 [2021-06-12 20:10:43,190 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-06-12 20:10:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 430. [2021-06-12 20:10:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.191142191142191) internal successors, (1369), 429 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1369 transitions. [2021-06-12 20:10:43,201 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1369 transitions. Word has length 16 [2021-06-12 20:10:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:43,201 INFO L482 AbstractCegarLoop]: Abstraction has 430 states and 1369 transitions. [2021-06-12 20:10:43,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1369 transitions. [2021-06-12 20:10:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:43,202 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:43,202 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:43,202 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-12 20:10:43,202 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 529800585, now seen corresponding path program 2 times [2021-06-12 20:10:43,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:43,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580599557] [2021-06-12 20:10:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:43,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:43,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580599557] [2021-06-12 20:10:43,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580599557] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:43,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:43,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:43,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775155677] [2021-06-12 20:10:43,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:43,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:43,457 INFO L87 Difference]: Start difference. First operand 430 states and 1369 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:43,694 INFO L93 Difference]: Finished difference Result 785 states and 2408 transitions. [2021-06-12 20:10:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 20:10:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:43,696 INFO L225 Difference]: With dead ends: 785 [2021-06-12 20:10:43,696 INFO L226 Difference]: Without dead ends: 737 [2021-06-12 20:10:43,697 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 301.3ms TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2021-06-12 20:10:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 409. [2021-06-12 20:10:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 3.2107843137254903) internal successors, (1310), 408 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1310 transitions. [2021-06-12 20:10:43,707 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1310 transitions. Word has length 16 [2021-06-12 20:10:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:43,707 INFO L482 AbstractCegarLoop]: Abstraction has 409 states and 1310 transitions. [2021-06-12 20:10:43,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1310 transitions. [2021-06-12 20:10:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:43,708 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:43,708 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:43,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-12 20:10:43,708 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash 637834109, now seen corresponding path program 3 times [2021-06-12 20:10:43,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:43,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892021805] [2021-06-12 20:10:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:43,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:43,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892021805] [2021-06-12 20:10:43,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892021805] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:43,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:43,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:43,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003141182] [2021-06-12 20:10:43,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:43,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:43,867 INFO L87 Difference]: Start difference. First operand 409 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:44,039 INFO L93 Difference]: Finished difference Result 646 states and 1995 transitions. [2021-06-12 20:10:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:10:44,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:44,041 INFO L225 Difference]: With dead ends: 646 [2021-06-12 20:10:44,041 INFO L226 Difference]: Without dead ends: 606 [2021-06-12 20:10:44,041 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 176.6ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-06-12 20:10:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 396. [2021-06-12 20:10:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.2430379746835443) internal successors, (1281), 395 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1281 transitions. [2021-06-12 20:10:44,051 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1281 transitions. Word has length 16 [2021-06-12 20:10:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:44,051 INFO L482 AbstractCegarLoop]: Abstraction has 396 states and 1281 transitions. [2021-06-12 20:10:44,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1281 transitions. [2021-06-12 20:10:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:44,052 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:44,052 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:44,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-12 20:10:44,052 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash 784334086, now seen corresponding path program 5 times [2021-06-12 20:10:44,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:44,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375876196] [2021-06-12 20:10:44,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:44,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:44,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375876196] [2021-06-12 20:10:44,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375876196] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:44,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:44,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:44,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220259626] [2021-06-12 20:10:44,173 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:44,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:44,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:44,174 INFO L87 Difference]: Start difference. First operand 396 states and 1281 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:44,352 INFO L93 Difference]: Finished difference Result 680 states and 2107 transitions. [2021-06-12 20:10:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:10:44,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:44,354 INFO L225 Difference]: With dead ends: 680 [2021-06-12 20:10:44,354 INFO L226 Difference]: Without dead ends: 657 [2021-06-12 20:10:44,354 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 174.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-12 20:10:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-06-12 20:10:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 392. [2021-06-12 20:10:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.2455242966751916) internal successors, (1269), 391 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1269 transitions. [2021-06-12 20:10:44,373 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1269 transitions. Word has length 16 [2021-06-12 20:10:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:44,373 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1269 transitions. [2021-06-12 20:10:44,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1269 transitions. [2021-06-12 20:10:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:44,374 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:44,374 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:44,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-12 20:10:44,374 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash 797847013, now seen corresponding path program 5 times [2021-06-12 20:10:44,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:44,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606080334] [2021-06-12 20:10:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:44,559 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-12 20:10:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:44,589 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:44,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606080334] [2021-06-12 20:10:44,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606080334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:44,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:44,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:44,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893677004] [2021-06-12 20:10:44,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:44,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:44,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:44,594 INFO L87 Difference]: Start difference. First operand 392 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,902 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2021-06-12 20:10:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:44,932 INFO L93 Difference]: Finished difference Result 690 states and 2128 transitions. [2021-06-12 20:10:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 20:10:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:44,934 INFO L225 Difference]: With dead ends: 690 [2021-06-12 20:10:44,934 INFO L226 Difference]: Without dead ends: 663 [2021-06-12 20:10:44,934 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 394.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-06-12 20:10:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 392. [2021-06-12 20:10:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.2404092071611252) internal successors, (1267), 391 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1267 transitions. [2021-06-12 20:10:44,944 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1267 transitions. Word has length 16 [2021-06-12 20:10:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:44,944 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1267 transitions. [2021-06-12 20:10:44,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1267 transitions. [2021-06-12 20:10:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:44,945 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:44,945 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:44,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-12 20:10:44,945 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1214532848, now seen corresponding path program 6 times [2021-06-12 20:10:44,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:44,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419365879] [2021-06-12 20:10:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:45,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:45,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419365879] [2021-06-12 20:10:45,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419365879] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:45,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:45,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:45,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578493456] [2021-06-12 20:10:45,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:45,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:45,010 INFO L87 Difference]: Start difference. First operand 392 states and 1267 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:45,084 INFO L93 Difference]: Finished difference Result 595 states and 1821 transitions. [2021-06-12 20:10:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:45,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:45,086 INFO L225 Difference]: With dead ends: 595 [2021-06-12 20:10:45,086 INFO L226 Difference]: Without dead ends: 572 [2021-06-12 20:10:45,086 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-06-12 20:10:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 392. [2021-06-12 20:10:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.2404092071611252) internal successors, (1267), 391 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1267 transitions. [2021-06-12 20:10:45,095 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1267 transitions. Word has length 16 [2021-06-12 20:10:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:45,095 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1267 transitions. [2021-06-12 20:10:45,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1267 transitions. [2021-06-12 20:10:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-12 20:10:45,096 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:45,096 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:45,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-12 20:10:45,097 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1154290151, now seen corresponding path program 6 times [2021-06-12 20:10:45,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:45,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906035677] [2021-06-12 20:10:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:45,337 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-12 20:10:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-12 20:10:45,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:45,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906035677] [2021-06-12 20:10:45,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906035677] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:45,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:45,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 20:10:45,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289428086] [2021-06-12 20:10:45,477 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 20:10:45,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 20:10:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:45,477 INFO L87 Difference]: Start difference. First operand 392 states and 1267 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,656 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-12 20:10:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:45,683 INFO L93 Difference]: Finished difference Result 595 states and 1811 transitions. [2021-06-12 20:10:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:45,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-12 20:10:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:45,685 INFO L225 Difference]: With dead ends: 595 [2021-06-12 20:10:45,685 INFO L226 Difference]: Without dead ends: 562 [2021-06-12 20:10:45,685 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 445.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-12 20:10:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-06-12 20:10:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 392. [2021-06-12 20:10:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.235294117647059) internal successors, (1265), 391 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1265 transitions. [2021-06-12 20:10:45,693 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1265 transitions. Word has length 16 [2021-06-12 20:10:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:45,694 INFO L482 AbstractCegarLoop]: Abstraction has 392 states and 1265 transitions. [2021-06-12 20:10:45,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1265 transitions. [2021-06-12 20:10:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:45,695 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:45,695 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:45,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-12 20:10:45,695 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1318202505, now seen corresponding path program 1 times [2021-06-12 20:10:45,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:45,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110250409] [2021-06-12 20:10:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:45,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:45,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110250409] [2021-06-12 20:10:45,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110250409] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:45,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:45,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:45,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56726314] [2021-06-12 20:10:45,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:45,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:45,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:45,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:45,714 INFO L87 Difference]: Start difference. First operand 392 states and 1265 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-06-12 20:10:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:45,751 INFO L93 Difference]: Finished difference Result 566 states and 1698 transitions. [2021-06-12 20:10:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:45,751 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-06-12 20:10:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:45,753 INFO L225 Difference]: With dead ends: 566 [2021-06-12 20:10:45,753 INFO L226 Difference]: Without dead ends: 566 [2021-06-12 20:10:45,753 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-06-12 20:10:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 420. [2021-06-12 20:10:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.252983293556086) internal successors, (1363), 419 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-06-12 20:10:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1363 transitions. [2021-06-12 20:10:45,761 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1363 transitions. Word has length 18 [2021-06-12 20:10:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:45,761 INFO L482 AbstractCegarLoop]: Abstraction has 420 states and 1363 transitions. [2021-06-12 20:10:45,761 INFO L483 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-06-12 20:10:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1363 transitions. [2021-06-12 20:10:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:45,762 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:45,762 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:45,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-12 20:10:45,762 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:45,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1664376435, now seen corresponding path program 2 times [2021-06-12 20:10:45,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:45,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498021077] [2021-06-12 20:10:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:45,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:45,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498021077] [2021-06-12 20:10:45,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498021077] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:45,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:45,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:45,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777397027] [2021-06-12 20:10:45,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:45,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:45,798 INFO L87 Difference]: Start difference. First operand 420 states and 1363 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-06-12 20:10:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:45,840 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2021-06-12 20:10:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:45,841 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-06-12 20:10:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:45,842 INFO L225 Difference]: With dead ends: 594 [2021-06-12 20:10:45,842 INFO L226 Difference]: Without dead ends: 586 [2021-06-12 20:10:45,842 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-06-12 20:10:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 420. [2021-06-12 20:10:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.243436754176611) internal successors, (1359), 419 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1359 transitions. [2021-06-12 20:10:45,851 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1359 transitions. Word has length 18 [2021-06-12 20:10:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:45,851 INFO L482 AbstractCegarLoop]: Abstraction has 420 states and 1359 transitions. [2021-06-12 20:10:45,851 INFO L483 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-06-12 20:10:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1359 transitions. [2021-06-12 20:10:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:45,852 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:45,853 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:45,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-12 20:10:45,853 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1681246645, now seen corresponding path program 1 times [2021-06-12 20:10:45,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:45,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466347765] [2021-06-12 20:10:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:45,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:45,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466347765] [2021-06-12 20:10:45,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466347765] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:45,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:45,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:45,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477128115] [2021-06-12 20:10:45,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:45,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:45,900 INFO L87 Difference]: Start difference. First operand 420 states and 1359 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-06-12 20:10:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:45,964 INFO L93 Difference]: Finished difference Result 602 states and 1832 transitions. [2021-06-12 20:10:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:45,964 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-06-12 20:10:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:45,965 INFO L225 Difference]: With dead ends: 602 [2021-06-12 20:10:45,965 INFO L226 Difference]: Without dead ends: 602 [2021-06-12 20:10:45,965 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-06-12 20:10:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 457. [2021-06-12 20:10:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.2214912280701755) internal successors, (1469), 456 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1469 transitions. [2021-06-12 20:10:45,976 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1469 transitions. Word has length 18 [2021-06-12 20:10:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:45,976 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1469 transitions. [2021-06-12 20:10:45,976 INFO L483 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-06-12 20:10:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1469 transitions. [2021-06-12 20:10:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:45,977 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:45,977 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:45,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-12 20:10:45,977 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:45,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1406905333, now seen corresponding path program 2 times [2021-06-12 20:10:45,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:45,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426945582] [2021-06-12 20:10:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426945582] [2021-06-12 20:10:46,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426945582] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:46,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959000781] [2021-06-12 20:10:46,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:46,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:46,020 INFO L87 Difference]: Start difference. First operand 457 states and 1469 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-06-12 20:10:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,086 INFO L93 Difference]: Finished difference Result 590 states and 1764 transitions. [2021-06-12 20:10:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,086 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-06-12 20:10:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,089 INFO L225 Difference]: With dead ends: 590 [2021-06-12 20:10:46,089 INFO L226 Difference]: Without dead ends: 582 [2021-06-12 20:10:46,089 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-06-12 20:10:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 457. [2021-06-12 20:10:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.212719298245614) internal successors, (1465), 456 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-06-12 20:10:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1465 transitions. [2021-06-12 20:10:46,100 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1465 transitions. Word has length 18 [2021-06-12 20:10:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,100 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1465 transitions. [2021-06-12 20:10:46,100 INFO L483 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-06-12 20:10:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1465 transitions. [2021-06-12 20:10:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,101 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,101 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-12 20:10:46,101 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash 506049385, now seen corresponding path program 1 times [2021-06-12 20:10:46,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350777722] [2021-06-12 20:10:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350777722] [2021-06-12 20:10:46,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350777722] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:46,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685207221] [2021-06-12 20:10:46,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:46,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,170 INFO L87 Difference]: Start difference. First operand 457 states and 1465 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,254 INFO L93 Difference]: Finished difference Result 537 states and 1634 transitions. [2021-06-12 20:10:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,256 INFO L225 Difference]: With dead ends: 537 [2021-06-12 20:10:46,256 INFO L226 Difference]: Without dead ends: 525 [2021-06-12 20:10:46,256 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-12 20:10:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 453. [2021-06-12 20:10:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.2234513274336285) internal successors, (1457), 452 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-06-12 20:10:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1457 transitions. [2021-06-12 20:10:46,267 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1457 transitions. Word has length 18 [2021-06-12 20:10:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,267 INFO L482 AbstractCegarLoop]: Abstraction has 453 states and 1457 transitions. [2021-06-12 20:10:46,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1457 transitions. [2021-06-12 20:10:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,268 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,268 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-12 20:10:46,268 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1415879781, now seen corresponding path program 3 times [2021-06-12 20:10:46,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569061189] [2021-06-12 20:10:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,285 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569061189] [2021-06-12 20:10:46,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569061189] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:46,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973624879] [2021-06-12 20:10:46,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:46,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:46,287 INFO L87 Difference]: Start difference. First operand 453 states and 1457 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-06-12 20:10:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,324 INFO L93 Difference]: Finished difference Result 549 states and 1641 transitions. [2021-06-12 20:10:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,325 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-06-12 20:10:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,326 INFO L225 Difference]: With dead ends: 549 [2021-06-12 20:10:46,326 INFO L226 Difference]: Without dead ends: 549 [2021-06-12 20:10:46,326 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-06-12 20:10:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 396. [2021-06-12 20:10:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1544303797468354) internal successors, (1246), 395 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1246 transitions. [2021-06-12 20:10:46,335 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1246 transitions. Word has length 18 [2021-06-12 20:10:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,335 INFO L482 AbstractCegarLoop]: Abstraction has 396 states and 1246 transitions. [2021-06-12 20:10:46,335 INFO L483 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-06-12 20:10:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1246 transitions. [2021-06-12 20:10:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,336 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,336 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-12 20:10:46,336 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1243069021, now seen corresponding path program 1 times [2021-06-12 20:10:46,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007925976] [2021-06-12 20:10:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007925976] [2021-06-12 20:10:46,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007925976] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:46,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68942619] [2021-06-12 20:10:46,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:46,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:46,354 INFO L87 Difference]: Start difference. First operand 396 states and 1246 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-06-12 20:10:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,387 INFO L93 Difference]: Finished difference Result 442 states and 1323 transitions. [2021-06-12 20:10:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 20:10:46,387 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-06-12 20:10:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,388 INFO L225 Difference]: With dead ends: 442 [2021-06-12 20:10:46,388 INFO L226 Difference]: Without dead ends: 413 [2021-06-12 20:10:46,388 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-12 20:10:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 396. [2021-06-12 20:10:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.118987341772152) internal successors, (1232), 395 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-06-12 20:10:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1232 transitions. [2021-06-12 20:10:46,395 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1232 transitions. Word has length 18 [2021-06-12 20:10:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,395 INFO L482 AbstractCegarLoop]: Abstraction has 396 states and 1232 transitions. [2021-06-12 20:10:46,395 INFO L483 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-06-12 20:10:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1232 transitions. [2021-06-12 20:10:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,396 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,396 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-12 20:10:46,396 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1059721977, now seen corresponding path program 3 times [2021-06-12 20:10:46,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622406419] [2021-06-12 20:10:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622406419] [2021-06-12 20:10:46,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622406419] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:46,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624319893] [2021-06-12 20:10:46,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:46,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:46,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:46,437 INFO L87 Difference]: Start difference. First operand 396 states and 1232 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-06-12 20:10:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,509 INFO L93 Difference]: Finished difference Result 482 states and 1411 transitions. [2021-06-12 20:10:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,510 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-06-12 20:10:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,511 INFO L225 Difference]: With dead ends: 482 [2021-06-12 20:10:46,511 INFO L226 Difference]: Without dead ends: 482 [2021-06-12 20:10:46,511 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-06-12 20:10:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 359. [2021-06-12 20:10:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0754189944134076) internal successors, (1101), 358 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1101 transitions. [2021-06-12 20:10:46,518 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1101 transitions. Word has length 18 [2021-06-12 20:10:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,519 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1101 transitions. [2021-06-12 20:10:46,519 INFO L483 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-06-12 20:10:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1101 transitions. [2021-06-12 20:10:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,519 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,520 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-12 20:10:46,520 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -197121861, now seen corresponding path program 2 times [2021-06-12 20:10:46,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506053534] [2021-06-12 20:10:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,586 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506053534] [2021-06-12 20:10:46,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506053534] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:46,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641508075] [2021-06-12 20:10:46,587 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:46,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,588 INFO L87 Difference]: Start difference. First operand 359 states and 1101 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,644 INFO L93 Difference]: Finished difference Result 467 states and 1366 transitions. [2021-06-12 20:10:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,651 INFO L225 Difference]: With dead ends: 467 [2021-06-12 20:10:46,651 INFO L226 Difference]: Without dead ends: 467 [2021-06-12 20:10:46,651 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-12 20:10:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 379. [2021-06-12 20:10:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.0714285714285716) internal successors, (1161), 378 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1161 transitions. [2021-06-12 20:10:46,659 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1161 transitions. Word has length 18 [2021-06-12 20:10:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,661 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1161 transitions. [2021-06-12 20:10:46,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1161 transitions. [2021-06-12 20:10:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,662 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,662 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,662 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-12 20:10:46,662 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1939653789, now seen corresponding path program 3 times [2021-06-12 20:10:46,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906756170] [2021-06-12 20:10:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906756170] [2021-06-12 20:10:46,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906756170] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:46,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468645225] [2021-06-12 20:10:46,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:46,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:46,702 INFO L87 Difference]: Start difference. First operand 379 states and 1161 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-06-12 20:10:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,781 INFO L93 Difference]: Finished difference Result 504 states and 1436 transitions. [2021-06-12 20:10:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,782 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-06-12 20:10:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,783 INFO L225 Difference]: With dead ends: 504 [2021-06-12 20:10:46,783 INFO L226 Difference]: Without dead ends: 496 [2021-06-12 20:10:46,783 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-06-12 20:10:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 379. [2021-06-12 20:10:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.060846560846561) internal successors, (1157), 378 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1157 transitions. [2021-06-12 20:10:46,792 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1157 transitions. Word has length 18 [2021-06-12 20:10:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,792 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1157 transitions. [2021-06-12 20:10:46,792 INFO L483 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-06-12 20:10:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1157 transitions. [2021-06-12 20:10:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,793 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,793 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,793 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-12 20:10:46,793 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1583210651, now seen corresponding path program 4 times [2021-06-12 20:10:46,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267823281] [2021-06-12 20:10:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267823281] [2021-06-12 20:10:46,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267823281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:46,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001634343] [2021-06-12 20:10:46,872 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:46,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,873 INFO L87 Difference]: Start difference. First operand 379 states and 1157 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:46,942 INFO L93 Difference]: Finished difference Result 441 states and 1293 transitions. [2021-06-12 20:10:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:46,944 INFO L225 Difference]: With dead ends: 441 [2021-06-12 20:10:46,944 INFO L226 Difference]: Without dead ends: 441 [2021-06-12 20:10:46,944 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-06-12 20:10:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 359. [2021-06-12 20:10:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0083798882681565) internal successors, (1077), 358 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1077 transitions. [2021-06-12 20:10:46,951 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1077 transitions. Word has length 18 [2021-06-12 20:10:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:46,951 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1077 transitions. [2021-06-12 20:10:46,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1077 transitions. [2021-06-12 20:10:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:46,952 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:46,952 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:46,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-12 20:10:46,952 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2015137509, now seen corresponding path program 4 times [2021-06-12 20:10:46,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:46,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652824584] [2021-06-12 20:10:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:46,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:46,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652824584] [2021-06-12 20:10:46,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652824584] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:46,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:46,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:46,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650949528] [2021-06-12 20:10:46,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:46,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:46,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:46,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:46,989 INFO L87 Difference]: Start difference. First operand 359 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:47,018 INFO L93 Difference]: Finished difference Result 439 states and 1246 transitions. [2021-06-12 20:10:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 20:10:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:47,019 INFO L225 Difference]: With dead ends: 439 [2021-06-12 20:10:47,019 INFO L226 Difference]: Without dead ends: 431 [2021-06-12 20:10:47,019 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-12 20:10:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 359. [2021-06-12 20:10:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.0027932960893855) internal successors, (1075), 358 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1075 transitions. [2021-06-12 20:10:47,026 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1075 transitions. Word has length 18 [2021-06-12 20:10:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:47,026 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1075 transitions. [2021-06-12 20:10:47,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1075 transitions. [2021-06-12 20:10:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:47,027 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:47,027 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:47,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-12 20:10:47,028 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash 325544227, now seen corresponding path program 4 times [2021-06-12 20:10:47,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:47,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170699696] [2021-06-12 20:10:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:47,096 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:47,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170699696] [2021-06-12 20:10:47,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170699696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:47,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:47,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 20:10:47,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624321232] [2021-06-12 20:10:47,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 20:10:47,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 20:10:47,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:47,097 INFO L87 Difference]: Start difference. First operand 359 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:47,186 INFO L93 Difference]: Finished difference Result 384 states and 1113 transitions. [2021-06-12 20:10:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-12 20:10:47,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:47,188 INFO L225 Difference]: With dead ends: 384 [2021-06-12 20:10:47,188 INFO L226 Difference]: Without dead ends: 376 [2021-06-12 20:10:47,188 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-12 20:10:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-12 20:10:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 359. [2021-06-12 20:10:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 2.9972067039106145) internal successors, (1073), 358 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1073 transitions. [2021-06-12 20:10:47,194 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1073 transitions. Word has length 18 [2021-06-12 20:10:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:47,194 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1073 transitions. [2021-06-12 20:10:47,194 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06-12 20:10:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1073 transitions. [2021-06-12 20:10:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-12 20:10:47,195 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:47,195 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:47,195 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-12 20:10:47,195 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash 724624817, now seen corresponding path program 5 times [2021-06-12 20:10:47,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:47,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143774032] [2021-06-12 20:10:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-12 20:10:47,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:47,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143774032] [2021-06-12 20:10:47,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143774032] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:10:47,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:10:47,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 20:10:47,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815002250] [2021-06-12 20:10:47,214 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 20:10:47,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 20:10:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 20:10:47,215 INFO L87 Difference]: Start difference. First operand 359 states and 1073 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-06-12 20:10:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:47,244 INFO L93 Difference]: Finished difference Result 386 states and 1114 transitions. [2021-06-12 20:10:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 20:10:47,244 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-06-12 20:10:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:47,245 INFO L225 Difference]: With dead ends: 386 [2021-06-12 20:10:47,245 INFO L226 Difference]: Without dead ends: 374 [2021-06-12 20:10:47,246 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 20:10:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-12 20:10:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 357. [2021-06-12 20:10:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.002808988764045) internal successors, (1069), 356 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-06-12 20:10:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1069 transitions. [2021-06-12 20:10:47,254 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1069 transitions. Word has length 18 [2021-06-12 20:10:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:47,254 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1069 transitions. [2021-06-12 20:10:47,254 INFO L483 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-06-12 20:10:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1069 transitions. [2021-06-12 20:10:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:10:47,255 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:47,255 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:47,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-12 20:10:47,255 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2111156678, now seen corresponding path program 1 times [2021-06-12 20:10:47,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:47,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062066142] [2021-06-12 20:10:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:47,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-06-12 20:10:47,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:47,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062066142] [2021-06-12 20:10:47,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062066142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:10:47,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111353429] [2021-06-12 20:10:47,645 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-06-12 20:10:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:47,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-12 20:10:47,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:10:47,959 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-06-12 20:10:48,452 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-06-12 20:10:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:48,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111353429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:10:48,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:10:48,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:10:48,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284443852] [2021-06-12 20:10:48,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:10:48,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:10:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:10:48,772 INFO L87 Difference]: Start difference. First operand 357 states and 1069 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:49,524 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-12 20:10:49,792 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2021-06-12 20:10:49,938 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-12 20:10:50,136 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-12 20:10:50,494 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2021-06-12 20:10:50,708 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-06-12 20:10:50,867 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-12 20:10:51,026 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-12 20:10:51,197 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2021-06-12 20:10:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:51,342 INFO L93 Difference]: Finished difference Result 620 states and 1813 transitions. [2021-06-12 20:10:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-12 20:10:51,343 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:10:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:51,344 INFO L225 Difference]: With dead ends: 620 [2021-06-12 20:10:51,344 INFO L226 Difference]: Without dead ends: 605 [2021-06-12 20:10:51,345 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 3107.7ms TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2021-06-12 20:10:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-06-12 20:10:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 378. [2021-06-12 20:10:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.981432360742706) internal successors, (1124), 377 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1124 transitions. [2021-06-12 20:10:51,356 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1124 transitions. Word has length 20 [2021-06-12 20:10:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:51,356 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1124 transitions. [2021-06-12 20:10:51,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1124 transitions. [2021-06-12 20:10:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:10:51,357 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:51,357 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:51,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-12 20:10:51,573 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash 301436920, now seen corresponding path program 2 times [2021-06-12 20:10:51,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:51,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842400422] [2021-06-12 20:10:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:52,139 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:52,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842400422] [2021-06-12 20:10:52,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842400422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:10:52,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310131791] [2021-06-12 20:10:52,139 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-06-12 20:10:52,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:10:52,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:10:52,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:10:52,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:10:52,755 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-06-12 20:10:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:53,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310131791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:10:53,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:10:53,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:10:53,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068545012] [2021-06-12 20:10:53,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:10:53,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:10:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:10:53,031 INFO L87 Difference]: Start difference. First operand 378 states and 1124 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:10:53,195 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-06-12 20:10:53,522 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-06-12 20:10:54,113 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-12 20:10:54,497 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2021-06-12 20:10:54,680 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2021-06-12 20:10:54,842 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2021-06-12 20:10:55,071 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2021-06-12 20:10:55,618 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2021-06-12 20:10:55,802 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2021-06-12 20:10:56,027 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2021-06-12 20:10:56,345 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-12 20:10:56,609 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2021-06-12 20:10:56,781 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2021-06-12 20:10:56,971 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2021-06-12 20:10:57,372 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2021-06-12 20:10:57,612 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2021-06-12 20:10:57,784 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2021-06-12 20:10:57,943 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2021-06-12 20:10:58,195 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-06-12 20:10:58,383 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2021-06-12 20:10:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:10:58,420 INFO L93 Difference]: Finished difference Result 704 states and 2057 transitions. [2021-06-12 20:10:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-12 20:10:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:10:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:10:58,422 INFO L225 Difference]: With dead ends: 704 [2021-06-12 20:10:58,422 INFO L226 Difference]: Without dead ends: 689 [2021-06-12 20:10:58,423 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 5705.9ms TimeCoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2021-06-12 20:10:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-06-12 20:10:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 398. [2021-06-12 20:10:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.025188916876574) internal successors, (1201), 397 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:10:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1201 transitions. [2021-06-12 20:10:58,434 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1201 transitions. Word has length 20 [2021-06-12 20:10:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:10:58,435 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1201 transitions. [2021-06-12 20:10:58,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:10:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1201 transitions. [2021-06-12 20:10:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:10:58,435 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:10:58,436 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:10:58,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:10:58,649 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:10:58,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:10:58,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1134434440, now seen corresponding path program 3 times [2021-06-12 20:10:58,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:10:58,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713784401] [2021-06-12 20:10:58,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:10:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:10:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:59,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:10:59,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713784401] [2021-06-12 20:10:59,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713784401] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:10:59,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953297502] [2021-06-12 20:10:59,050 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-06-12 20:10:59,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-12 20:10:59,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:10:59,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:10:59,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:10:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:10:59,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953297502] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:10:59,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:10:59,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:10:59,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262251544] [2021-06-12 20:10:59,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:10:59,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:10:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:10:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:10:59,786 INFO L87 Difference]: Start difference. First operand 398 states and 1201 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:00,316 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-06-12 20:11:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:00,340 INFO L93 Difference]: Finished difference Result 596 states and 1774 transitions. [2021-06-12 20:11:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 20:11:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:11:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:00,342 INFO L225 Difference]: With dead ends: 596 [2021-06-12 20:11:00,342 INFO L226 Difference]: Without dead ends: 581 [2021-06-12 20:11:00,342 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1121.2ms TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2021-06-12 20:11:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-06-12 20:11:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 407. [2021-06-12 20:11:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.0246305418719213) internal successors, (1228), 406 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1228 transitions. [2021-06-12 20:11:00,351 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1228 transitions. Word has length 20 [2021-06-12 20:11:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:00,351 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 1228 transitions. [2021-06-12 20:11:00,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1228 transitions. [2021-06-12 20:11:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:00,352 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:00,352 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:00,572 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:00,573 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash 464235032, now seen corresponding path program 4 times [2021-06-12 20:11:00,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:00,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780730438] [2021-06-12 20:11:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:00,885 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2021-06-12 20:11:01,013 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2021-06-12 20:11:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:01,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:01,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780730438] [2021-06-12 20:11:01,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780730438] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:01,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224958604] [2021-06-12 20:11:01,227 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-06-12 20:11:01,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-12 20:11:01,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:01,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:01,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:01,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-06-12 20:11:01,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224958604] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:01,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:01,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:01,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924279374] [2021-06-12 20:11:01,937 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:01,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:01,937 INFO L87 Difference]: Start difference. First operand 407 states and 1228 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:02,742 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-12 20:11:02,986 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2021-06-12 20:11:03,139 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2021-06-12 20:11:03,270 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-06-12 20:11:03,424 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2021-06-12 20:11:03,604 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2021-06-12 20:11:03,808 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2021-06-12 20:11:03,981 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-06-12 20:11:04,131 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-06-12 20:11:04,281 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-12 20:11:04,425 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-06-12 20:11:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:04,473 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2021-06-12 20:11:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 20:11:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:04,475 INFO L225 Difference]: With dead ends: 628 [2021-06-12 20:11:04,475 INFO L226 Difference]: Without dead ends: 613 [2021-06-12 20:11:04,475 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3103.2ms TimeCoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2021-06-12 20:11:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-12 20:11:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 407. [2021-06-12 20:11:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.0246305418719213) internal successors, (1228), 406 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1228 transitions. [2021-06-12 20:11:04,483 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1228 transitions. Word has length 20 [2021-06-12 20:11:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:04,483 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 1228 transitions. [2021-06-12 20:11:04,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1228 transitions. [2021-06-12 20:11:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:04,484 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:04,484 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:04,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:04,701 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 812620716, now seen corresponding path program 5 times [2021-06-12 20:11:04,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:04,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538879178] [2021-06-12 20:11:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:04,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:04,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538879178] [2021-06-12 20:11:04,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538879178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:04,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698464769] [2021-06-12 20:11:04,966 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-06-12 20:11:05,006 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:11:05,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:05,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:05,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:05,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-06-12 20:11:05,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698464769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:05,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:05,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:05,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985980361] [2021-06-12 20:11:05,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:05,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:05,576 INFO L87 Difference]: Start difference. First operand 407 states and 1228 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:06,015 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-06-12 20:11:06,328 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-12 20:11:06,472 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-06-12 20:11:06,609 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2021-06-12 20:11:06,833 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-06-12 20:11:06,967 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-06-12 20:11:07,207 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2021-06-12 20:11:07,358 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-06-12 20:11:07,737 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-06-12 20:11:07,964 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2021-06-12 20:11:08,164 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-06-12 20:11:08,401 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2021-06-12 20:11:08,584 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2021-06-12 20:11:08,774 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2021-06-12 20:11:09,067 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2021-06-12 20:11:09,340 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2021-06-12 20:11:09,611 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2021-06-12 20:11:09,958 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2021-06-12 20:11:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:10,013 INFO L93 Difference]: Finished difference Result 753 states and 2206 transitions. [2021-06-12 20:11:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-12 20:11:10,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:10,015 INFO L225 Difference]: With dead ends: 753 [2021-06-12 20:11:10,015 INFO L226 Difference]: Without dead ends: 738 [2021-06-12 20:11:10,015 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 4415.7ms TimeCoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2021-06-12 20:11:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-06-12 20:11:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 432. [2021-06-12 20:11:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.0255220417633413) internal successors, (1304), 431 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1304 transitions. [2021-06-12 20:11:10,023 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1304 transitions. Word has length 20 [2021-06-12 20:11:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:10,024 INFO L482 AbstractCegarLoop]: Abstraction has 432 states and 1304 transitions. [2021-06-12 20:11:10,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1304 transitions. [2021-06-12 20:11:10,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:10,024 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:10,025 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:10,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:10,241 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1379795916, now seen corresponding path program 6 times [2021-06-12 20:11:10,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:10,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498599686] [2021-06-12 20:11:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:10,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:10,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498599686] [2021-06-12 20:11:10,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498599686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:10,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475559170] [2021-06-12 20:11:10,485 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-06-12 20:11:10,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-12 20:11:10,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:10,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:10,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:10,930 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-06-12 20:11:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:11,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475559170] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:11,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:11,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:11:11,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526631783] [2021-06-12 20:11:11,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:11:11,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:11:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:11:11,209 INFO L87 Difference]: Start difference. First operand 432 states and 1304 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:11,597 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2021-06-12 20:11:11,855 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2021-06-12 20:11:12,094 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2021-06-12 20:11:12,311 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2021-06-12 20:11:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:12,353 INFO L93 Difference]: Finished difference Result 700 states and 2057 transitions. [2021-06-12 20:11:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 20:11:12,354 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:11:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:12,355 INFO L225 Difference]: With dead ends: 700 [2021-06-12 20:11:12,355 INFO L226 Difference]: Without dead ends: 685 [2021-06-12 20:11:12,356 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1492.9ms TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2021-06-12 20:11:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-06-12 20:11:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 435. [2021-06-12 20:11:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.032258064516129) internal successors, (1316), 434 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1316 transitions. [2021-06-12 20:11:12,364 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1316 transitions. Word has length 20 [2021-06-12 20:11:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:12,364 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1316 transitions. [2021-06-12 20:11:12,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1316 transitions. [2021-06-12 20:11:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:12,365 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:12,365 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:12,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:12,581 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:12,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1032797682, now seen corresponding path program 7 times [2021-06-12 20:11:12,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:12,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814899265] [2021-06-12 20:11:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:12,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-06-12 20:11:12,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:12,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814899265] [2021-06-12 20:11:12,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814899265] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:12,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947659541] [2021-06-12 20:11:12,856 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-06-12 20:11:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:12,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:12,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:13,240 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-12 20:11:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:13,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947659541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:13,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:13,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:11:13,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722196702] [2021-06-12 20:11:13,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:11:13,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:11:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:11:13,560 INFO L87 Difference]: Start difference. First operand 435 states and 1316 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:13,714 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-12 20:11:13,883 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2021-06-12 20:11:14,104 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2021-06-12 20:11:14,361 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2021-06-12 20:11:14,801 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-12 20:11:15,054 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-12 20:11:15,270 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2021-06-12 20:11:15,475 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2021-06-12 20:11:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:15,522 INFO L93 Difference]: Finished difference Result 745 states and 2194 transitions. [2021-06-12 20:11:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 20:11:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:11:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:15,524 INFO L225 Difference]: With dead ends: 745 [2021-06-12 20:11:15,524 INFO L226 Difference]: Without dead ends: 730 [2021-06-12 20:11:15,524 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2332.5ms TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 20:11:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-06-12 20:11:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 433. [2021-06-12 20:11:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 3.0300925925925926) internal successors, (1309), 432 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1309 transitions. [2021-06-12 20:11:15,532 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1309 transitions. Word has length 20 [2021-06-12 20:11:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:15,532 INFO L482 AbstractCegarLoop]: Abstraction has 433 states and 1309 transitions. [2021-06-12 20:11:15,532 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1309 transitions. [2021-06-12 20:11:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:15,533 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:15,533 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:15,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:15,757 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -280993702, now seen corresponding path program 8 times [2021-06-12 20:11:15,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:15,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101455397] [2021-06-12 20:11:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:16,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:16,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101455397] [2021-06-12 20:11:16,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101455397] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:16,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236871278] [2021-06-12 20:11:16,158 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-06-12 20:11:16,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:11:16,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:16,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:16,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:16,640 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-12 20:11:16,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-06-12 20:11:16,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236871278] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:16,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:16,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:16,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627553812] [2021-06-12 20:11:16,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:16,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:16,847 INFO L87 Difference]: Start difference. First operand 433 states and 1309 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:17,030 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2021-06-12 20:11:17,426 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-06-12 20:11:17,650 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2021-06-12 20:11:17,833 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2021-06-12 20:11:18,016 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-12 20:11:18,259 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2021-06-12 20:11:18,437 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2021-06-12 20:11:18,697 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2021-06-12 20:11:18,835 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2021-06-12 20:11:19,140 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-12 20:11:19,501 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-12 20:11:19,755 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-12 20:11:20,225 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2021-06-12 20:11:20,493 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-06-12 20:11:20,739 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-06-12 20:11:20,883 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2021-06-12 20:11:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:20,934 INFO L93 Difference]: Finished difference Result 718 states and 2099 transitions. [2021-06-12 20:11:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-12 20:11:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:20,936 INFO L225 Difference]: With dead ends: 718 [2021-06-12 20:11:20,936 INFO L226 Difference]: Without dead ends: 703 [2021-06-12 20:11:20,936 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4377.8ms TimeCoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2021-06-12 20:11:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-06-12 20:11:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 442. [2021-06-12 20:11:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.036281179138322) internal successors, (1339), 441 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1339 transitions. [2021-06-12 20:11:20,943 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1339 transitions. Word has length 20 [2021-06-12 20:11:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:20,943 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1339 transitions. [2021-06-12 20:11:20,943 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1339 transitions. [2021-06-12 20:11:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:20,944 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:20,944 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:21,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable207 [2021-06-12 20:11:21,145 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2131599896, now seen corresponding path program 9 times [2021-06-12 20:11:21,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:21,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426299906] [2021-06-12 20:11:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:21,518 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:21,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426299906] [2021-06-12 20:11:21,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426299906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:21,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822264281] [2021-06-12 20:11:21,518 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-06-12 20:11:21,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-12 20:11:21,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:21,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:21,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:22,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822264281] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:22,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:22,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:22,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432155664] [2021-06-12 20:11:22,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:22,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:22,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:22,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:22,132 INFO L87 Difference]: Start difference. First operand 442 states and 1339 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:22,247 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2021-06-12 20:11:22,452 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-06-12 20:11:22,762 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-12 20:11:22,987 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-06-12 20:11:23,465 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-06-12 20:11:23,725 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2021-06-12 20:11:23,846 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2021-06-12 20:11:24,009 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-06-12 20:11:24,149 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-06-12 20:11:24,323 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-06-12 20:11:24,456 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2021-06-12 20:11:24,673 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-12 20:11:24,809 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-06-12 20:11:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:24,843 INFO L93 Difference]: Finished difference Result 691 states and 2058 transitions. [2021-06-12 20:11:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-12 20:11:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:24,844 INFO L225 Difference]: With dead ends: 691 [2021-06-12 20:11:24,845 INFO L226 Difference]: Without dead ends: 676 [2021-06-12 20:11:24,845 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 3130.0ms TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2021-06-12 20:11:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-06-12 20:11:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 439. [2021-06-12 20:11:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.029680365296804) internal successors, (1327), 438 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-06-12 20:11:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1327 transitions. [2021-06-12 20:11:24,853 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1327 transitions. Word has length 20 [2021-06-12 20:11:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:24,853 INFO L482 AbstractCegarLoop]: Abstraction has 439 states and 1327 transitions. [2021-06-12 20:11:24,853 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1327 transitions. [2021-06-12 20:11:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:24,854 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:24,854 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:25,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:25,069 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 695728536, now seen corresponding path program 10 times [2021-06-12 20:11:25,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:25,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304974795] [2021-06-12 20:11:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:25,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-06-12 20:11:25,340 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:25,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304974795] [2021-06-12 20:11:25,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304974795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:25,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923029889] [2021-06-12 20:11:25,340 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-06-12 20:11:25,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-12 20:11:25,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:25,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:25,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:25,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923029889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:25,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:25,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:11:25,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056076299] [2021-06-12 20:11:25,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:11:25,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:11:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:11:25,885 INFO L87 Difference]: Start difference. First operand 439 states and 1327 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:26,457 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2021-06-12 20:11:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:26,481 INFO L93 Difference]: Finished difference Result 653 states and 1947 transitions. [2021-06-12 20:11:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 20:11:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:11:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:26,483 INFO L225 Difference]: With dead ends: 653 [2021-06-12 20:11:26,483 INFO L226 Difference]: Without dead ends: 638 [2021-06-12 20:11:26,483 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 920.8ms TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2021-06-12 20:11:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-12 20:11:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 442. [2021-06-12 20:11:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.036281179138322) internal successors, (1339), 441 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1339 transitions. [2021-06-12 20:11:26,491 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1339 transitions. Word has length 20 [2021-06-12 20:11:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:26,491 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1339 transitions. [2021-06-12 20:11:26,491 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1339 transitions. [2021-06-12 20:11:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:26,492 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:26,492 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:26,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:26,708 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2000569288, now seen corresponding path program 11 times [2021-06-12 20:11:26,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:26,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401703866] [2021-06-12 20:11:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:26,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:26,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401703866] [2021-06-12 20:11:26,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401703866] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:26,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653440467] [2021-06-12 20:11:26,957 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:26,995 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:11:26,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:26,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:26,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:27,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-06-12 20:11:27,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653440467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:27,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:27,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:11:27,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370968294] [2021-06-12 20:11:27,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:11:27,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:11:27,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:11:27,509 INFO L87 Difference]: Start difference. First operand 442 states and 1339 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:27,807 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-12 20:11:28,163 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-06-12 20:11:28,400 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-12 20:11:28,699 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2021-06-12 20:11:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:28,729 INFO L93 Difference]: Finished difference Result 689 states and 2044 transitions. [2021-06-12 20:11:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-12 20:11:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:11:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:28,731 INFO L225 Difference]: With dead ends: 689 [2021-06-12 20:11:28,731 INFO L226 Difference]: Without dead ends: 674 [2021-06-12 20:11:28,731 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1465.8ms TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2021-06-12 20:11:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-06-12 20:11:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 437. [2021-06-12 20:11:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.032110091743119) internal successors, (1322), 436 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1322 transitions. [2021-06-12 20:11:28,739 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1322 transitions. Word has length 20 [2021-06-12 20:11:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:28,739 INFO L482 AbstractCegarLoop]: Abstraction has 437 states and 1322 transitions. [2021-06-12 20:11:28,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1322 transitions. [2021-06-12 20:11:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:28,740 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:28,740 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:28,963 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:28,963 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash -616411988, now seen corresponding path program 12 times [2021-06-12 20:11:28,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:28,964 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173906801] [2021-06-12 20:11:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:29,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:29,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173906801] [2021-06-12 20:11:29,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173906801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:29,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437772633] [2021-06-12 20:11:29,425 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:29,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-12 20:11:29,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:29,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:29,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:30,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437772633] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:30,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:30,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:30,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283063204] [2021-06-12 20:11:30,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:30,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:30,018 INFO L87 Difference]: Start difference. First operand 437 states and 1322 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:30,463 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-12 20:11:30,712 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2021-06-12 20:11:30,856 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2021-06-12 20:11:31,226 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2021-06-12 20:11:31,454 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-06-12 20:11:31,651 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-06-12 20:11:31,885 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-06-12 20:11:32,018 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2021-06-12 20:11:32,241 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2021-06-12 20:11:32,483 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2021-06-12 20:11:32,658 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2021-06-12 20:11:32,972 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2021-06-12 20:11:33,196 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2021-06-12 20:11:33,497 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-06-12 20:11:33,715 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2021-06-12 20:11:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:33,765 INFO L93 Difference]: Finished difference Result 768 states and 2264 transitions. [2021-06-12 20:11:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-12 20:11:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:33,767 INFO L225 Difference]: With dead ends: 768 [2021-06-12 20:11:33,767 INFO L226 Difference]: Without dead ends: 753 [2021-06-12 20:11:33,767 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 4052.6ms TimeCoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2021-06-12 20:11:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-06-12 20:11:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 446. [2021-06-12 20:11:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.0314606741573034) internal successors, (1349), 445 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1349 transitions. [2021-06-12 20:11:33,776 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1349 transitions. Word has length 20 [2021-06-12 20:11:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:33,776 INFO L482 AbstractCegarLoop]: Abstraction has 446 states and 1349 transitions. [2021-06-12 20:11:33,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1349 transitions. [2021-06-12 20:11:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:33,777 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:33,777 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:33,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:33,993 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1559034530, now seen corresponding path program 13 times [2021-06-12 20:11:33,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:33,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810470547] [2021-06-12 20:11:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:34,372 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:34,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810470547] [2021-06-12 20:11:34,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810470547] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:34,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811385210] [2021-06-12 20:11:34,372 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:34,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-12 20:11:34,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:35,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811385210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:35,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:35,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:11:35,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495004502] [2021-06-12 20:11:35,064 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:11:35,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:11:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:11:35,065 INFO L87 Difference]: Start difference. First operand 446 states and 1349 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:35,892 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-06-12 20:11:36,128 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-06-12 20:11:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:36,202 INFO L93 Difference]: Finished difference Result 636 states and 1870 transitions. [2021-06-12 20:11:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 20:11:36,203 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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-06-12 20:11:36,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:36,204 INFO L225 Difference]: With dead ends: 636 [2021-06-12 20:11:36,204 INFO L226 Difference]: Without dead ends: 621 [2021-06-12 20:11:36,204 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1641.6ms TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2021-06-12 20:11:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-12 20:11:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 442. [2021-06-12 20:11:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.036281179138322) internal successors, (1339), 441 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1339 transitions. [2021-06-12 20:11:36,209 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1339 transitions. Word has length 20 [2021-06-12 20:11:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:36,210 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1339 transitions. [2021-06-12 20:11:36,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1339 transitions. [2021-06-12 20:11:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:36,210 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:36,210 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:36,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable303 [2021-06-12 20:11:36,411 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1464824568, now seen corresponding path program 14 times [2021-06-12 20:11:36,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:36,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625453205] [2021-06-12 20:11:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:36,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:36,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625453205] [2021-06-12 20:11:36,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625453205] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:36,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892797046] [2021-06-12 20:11:36,859 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-06-12 20:11:36,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:11:36,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:36,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:36,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:37,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892797046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:37,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:37,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:37,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298062563] [2021-06-12 20:11:37,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:37,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:37,590 INFO L87 Difference]: Start difference. First operand 442 states and 1339 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:38,038 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2021-06-12 20:11:38,338 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-06-12 20:11:38,497 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-12 20:11:38,835 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2021-06-12 20:11:39,018 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2021-06-12 20:11:39,269 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2021-06-12 20:11:39,522 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2021-06-12 20:11:39,878 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2021-06-12 20:11:40,054 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-06-12 20:11:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:40,098 INFO L93 Difference]: Finished difference Result 699 states and 2057 transitions. [2021-06-12 20:11:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 20:11:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:40,099 INFO L225 Difference]: With dead ends: 699 [2021-06-12 20:11:40,099 INFO L226 Difference]: Without dead ends: 684 [2021-06-12 20:11:40,099 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2905.9ms TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 20:11:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-06-12 20:11:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 436. [2021-06-12 20:11:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 3.0298850574712644) internal successors, (1318), 435 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1318 transitions. [2021-06-12 20:11:40,105 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1318 transitions. Word has length 20 [2021-06-12 20:11:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:40,105 INFO L482 AbstractCegarLoop]: Abstraction has 436 states and 1318 transitions. [2021-06-12 20:11:40,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1318 transitions. [2021-06-12 20:11:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:40,106 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:40,106 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:40,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:40,306 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1005557752, now seen corresponding path program 15 times [2021-06-12 20:11:40,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:40,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702994047] [2021-06-12 20:11:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:40,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:40,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702994047] [2021-06-12 20:11:40,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702994047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:40,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702224609] [2021-06-12 20:11:40,685 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-06-12 20:11:40,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-12 20:11:40,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:40,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:40,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:41,075 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2021-06-12 20:11:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:41,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702224609] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:41,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:41,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:41,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135486609] [2021-06-12 20:11:41,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:41,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:41,312 INFO L87 Difference]: Start difference. First operand 436 states and 1318 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:42,121 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2021-06-12 20:11:42,333 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2021-06-12 20:11:42,530 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2021-06-12 20:11:42,822 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2021-06-12 20:11:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:42,894 INFO L93 Difference]: Finished difference Result 557 states and 1658 transitions. [2021-06-12 20:11:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 20:11:42,895 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:42,895 INFO L225 Difference]: With dead ends: 557 [2021-06-12 20:11:42,895 INFO L226 Difference]: Without dead ends: 542 [2021-06-12 20:11:42,896 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1997.7ms TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2021-06-12 20:11:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-06-12 20:11:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 449. [2021-06-12 20:11:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.0401785714285716) internal successors, (1362), 448 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1362 transitions. [2021-06-12 20:11:42,901 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1362 transitions. Word has length 20 [2021-06-12 20:11:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:42,901 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1362 transitions. [2021-06-12 20:11:42,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1362 transitions. [2021-06-12 20:11:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:42,902 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:42,902 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:43,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable347 [2021-06-12 20:11:43,102 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -876815946, now seen corresponding path program 16 times [2021-06-12 20:11:43,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:43,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373216285] [2021-06-12 20:11:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:43,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-06-12 20:11:43,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:43,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373216285] [2021-06-12 20:11:43,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373216285] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:43,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878046705] [2021-06-12 20:11:43,478 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-06-12 20:11:43,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-12 20:11:43,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:43,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:43,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:44,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878046705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:44,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:44,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:44,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284774678] [2021-06-12 20:11:44,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:44,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:44,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:44,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:44,051 INFO L87 Difference]: Start difference. First operand 449 states and 1362 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:44,230 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-12 20:11:44,433 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-12 20:11:44,621 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-06-12 20:11:44,891 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-12 20:11:45,015 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-06-12 20:11:45,451 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-12 20:11:45,650 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2021-06-12 20:11:45,920 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2021-06-12 20:11:46,057 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-06-12 20:11:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:46,220 INFO L93 Difference]: Finished difference Result 637 states and 1899 transitions. [2021-06-12 20:11:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 20:11:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:46,221 INFO L225 Difference]: With dead ends: 637 [2021-06-12 20:11:46,221 INFO L226 Difference]: Without dead ends: 622 [2021-06-12 20:11:46,222 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2493.9ms TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 20:11:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2021-06-12 20:11:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 447. [2021-06-12 20:11:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.0381165919282513) internal successors, (1355), 446 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-06-12 20:11:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1355 transitions. [2021-06-12 20:11:46,228 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1355 transitions. Word has length 20 [2021-06-12 20:11:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:46,228 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1355 transitions. [2021-06-12 20:11:46,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1355 transitions. [2021-06-12 20:11:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:46,229 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:46,229 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:46,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable365 [2021-06-12 20:11:46,429 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1982279990, now seen corresponding path program 17 times [2021-06-12 20:11:46,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:46,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698551971] [2021-06-12 20:11:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:46,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-06-12 20:11:46,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:46,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698551971] [2021-06-12 20:11:46,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698551971] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:46,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522392567] [2021-06-12 20:11:46,726 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-06-12 20:11:46,766 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:11:46,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:46,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:46,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:47,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-06-12 20:11:47,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522392567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:47,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:47,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:47,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992566740] [2021-06-12 20:11:47,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:47,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:47,315 INFO L87 Difference]: Start difference. First operand 447 states and 1355 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:47,847 INFO L93 Difference]: Finished difference Result 571 states and 1708 transitions. [2021-06-12 20:11:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 20:11:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:47,849 INFO L225 Difference]: With dead ends: 571 [2021-06-12 20:11:47,849 INFO L226 Difference]: Without dead ends: 556 [2021-06-12 20:11:47,849 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 918.4ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-06-12 20:11:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-06-12 20:11:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 449. [2021-06-12 20:11:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.0401785714285716) internal successors, (1362), 448 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1362 transitions. [2021-06-12 20:11:47,857 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1362 transitions. Word has length 20 [2021-06-12 20:11:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:47,857 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1362 transitions. [2021-06-12 20:11:47,857 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1362 transitions. [2021-06-12 20:11:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:47,858 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:47,858 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:48,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:11:48,073 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash -714017834, now seen corresponding path program 18 times [2021-06-12 20:11:48,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:48,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531993870] [2021-06-12 20:11:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:48,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:48,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531993870] [2021-06-12 20:11:48,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531993870] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:48,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726631285] [2021-06-12 20:11:48,497 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-06-12 20:11:48,543 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-12 20:11:48,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:11:48,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:48,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:11:49,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726631285] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:49,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:11:49,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:11:49,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848594784] [2021-06-12 20:11:49,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:11:49,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:11:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:11:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:11:49,162 INFO L87 Difference]: Start difference. First operand 449 states and 1362 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:11:50,415 INFO L93 Difference]: Finished difference Result 604 states and 1799 transitions. [2021-06-12 20:11:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 20:11:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:11:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:11:50,417 INFO L225 Difference]: With dead ends: 604 [2021-06-12 20:11:50,417 INFO L226 Difference]: Without dead ends: 589 [2021-06-12 20:11:50,417 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1711.4ms TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2021-06-12 20:11:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-12 20:11:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 445. [2021-06-12 20:11:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.0405405405405403) internal successors, (1350), 444 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:11:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1350 transitions. [2021-06-12 20:11:50,423 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1350 transitions. Word has length 20 [2021-06-12 20:11:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:11:50,423 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1350 transitions. [2021-06-12 20:11:50,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:11:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1350 transitions. [2021-06-12 20:11:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:11:50,424 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:11:50,424 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:11:50,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable406 [2021-06-12 20:11:50,624 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:11:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:11:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 670139466, now seen corresponding path program 19 times [2021-06-12 20:11:50,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:11:50,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655563782] [2021-06-12 20:11:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:11:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:50,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-06-12 20:11:50,800 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:11:50,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655563782] [2021-06-12 20:11:50,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655563782] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:11:50,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997456365] [2021-06-12 20:11:50,800 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-06-12 20:11:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:11:50,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:11:50,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:11:52,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 3 [2021-06-12 20:11:52,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:11:52,054 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-12 20:11:52,064 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,075 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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-06-12 20:11:52,086 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 7 [2021-06-12 20:11:52,097 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:11:52,106 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,113 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,114 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-06-12 20:11:52,123 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,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 5 treesize of output 3 [2021-06-12 20:11:52,132 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,146 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,147 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,157 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 7 [2021-06-12 20:11:52,168 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,178 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,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 13 treesize of output 9 [2021-06-12 20:11:52,188 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,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 5 treesize of output 3 [2021-06-12 20:11:52,198 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,205 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,206 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,216 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:11:52,226 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 7 [2021-06-12 20:11:52,236 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,247 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 3 [2021-06-12 20:11:52,258 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,268 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,269 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 25 treesize of output 9 [2021-06-12 20:11:52,280 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,290 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,298 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,299 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,305 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,305 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,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 5 treesize of output 3 [2021-06-12 20:11:52,312 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,320 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,321 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 3 [2021-06-12 20:11:52,331 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,338 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,353 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 7 [2021-06-12 20:11:52,372 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 3 [2021-06-12 20:11:52,381 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,387 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,388 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,395 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,403 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,410 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,410 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,419 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,425 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,425 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,431 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,432 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,438 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,438 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,448 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,455 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,456 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11: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 11 treesize of output 3 [2021-06-12 20:11:52,465 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,474 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,480 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,481 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,488 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,489 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,495 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,496 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 25 treesize of output 9 [2021-06-12 20:11:52,508 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,514 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,515 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,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 13 treesize of output 9 [2021-06-12 20:11:52,522 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 3 [2021-06-12 20:11:52,532 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,538 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,539 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 11 treesize of output 3 [2021-06-12 20:11:52,548 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,553 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,554 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,560 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,560 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,566 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,569 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,578 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,583 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,584 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,589 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,590 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:11:52,598 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,603 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,605 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,611 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,617 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,623 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,628 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,629 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,636 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,642 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,643 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,647 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,648 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,655 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,661 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,661 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,670 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,675 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,676 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,680 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,681 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 25 treesize of output 9 [2021-06-12 20:11:52,689 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,695 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,700 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,701 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,705 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,706 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:11:52,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 18 treesize of output 1 [2021-06-12 20:11:52,712 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,716 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,717 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:11:52,722 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-12 20:11:52,974 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2021-06-12 20:11:52,975 INFO L628 ElimStorePlain]: treesize reduction 257, result has 56.4 percent of original size [2021-06-12 20:11:52,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 14 xjuncts. [2021-06-12 20:11:52,984 INFO L247 ElimStorePlain]: Needed 82 recursive calls to eliminate 2 variables, input treesize:3475, output treesize:293 [2021-06-12 20:11:53,159 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-06-12 20:11:53,456 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-12 20:11:53,718 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-12 20:11:56,316 WARN L205 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-12 20:11:56,688 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 129 [2021-06-12 20:11:57,423 WARN L205 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-12 20:11:58,220 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2021-06-12 20:11:59,042 WARN L205 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 132 [2021-06-12 20:11:59,569 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 126 [2021-06-12 20:12:00,530 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-12 20:12:00,693 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 131 [2021-06-12 20:12:00,977 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 131 [2021-06-12 20:12:01,585 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 121 [2021-06-12 20:12:02,498 WARN L205 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 132 [2021-06-12 20:12:03,478 WARN L205 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 126 [2021-06-12 20:12:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:12:06,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997456365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:06,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:12:06,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-12 20:12:06,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900341726] [2021-06-12 20:12:06,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 20:12:06,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:12:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 20:12:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-12 20:12:06,796 INFO L87 Difference]: Start difference. First operand 445 states and 1350 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-06-12 20:12:07,548 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 108 [2021-06-12 20:12:07,746 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2021-06-12 20:12:08,024 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 136 [2021-06-12 20:12:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:12:08,072 INFO L93 Difference]: Finished difference Result 646 states and 1918 transitions. [2021-06-12 20:12:08,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 20:12:08,073 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-06-12 20:12:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:12:08,074 INFO L225 Difference]: With dead ends: 646 [2021-06-12 20:12:08,074 INFO L226 Difference]: Without dead ends: 631 [2021-06-12 20:12:08,074 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1798.8ms TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2021-06-12 20:12:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2021-06-12 20:12:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 443. [2021-06-12 20:12:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0429864253393664) internal successors, (1345), 442 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-06-12 20:12:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1345 transitions. [2021-06-12 20:12:08,080 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1345 transitions. Word has length 20 [2021-06-12 20:12:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:12:08,080 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1345 transitions. [2021-06-12 20:12:08,081 INFO L483 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-06-12 20:12:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1345 transitions. [2021-06-12 20:12:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:12:08,081 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:12:08,082 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:12:08,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable422 [2021-06-12 20:12:08,289 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:12:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:12:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -365457786, now seen corresponding path program 20 times [2021-06-12 20:12:08,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:12:08,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732508710] [2021-06-12 20:12:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:12:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:12:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:12:08,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:12:08,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732508710] [2021-06-12 20:12:08,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732508710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:08,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537059053] [2021-06-12 20:12:08,501 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:12:08,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:12:08,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:12:08,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:12:08,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:12:08,819 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-06-12 20:12:11,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,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 11 treesize of output 3 [2021-06-12 20:12:11,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,659 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-12 20:12:11,686 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,708 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,709 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,729 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,730 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,751 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,752 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,773 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,774 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,791 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,792 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:11,814 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,832 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,832 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,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 16 treesize of output 7 [2021-06-12 20:12:11,862 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,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 11 treesize of output 7 [2021-06-12 20:12:11,880 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,900 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,901 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,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 11 treesize of output 7 [2021-06-12 20:12:11,922 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,938 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,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 23 treesize of output 1 [2021-06-12 20:12:11,964 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,980 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:11,981 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:11,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:11,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 11 treesize of output 3 [2021-06-12 20:12:11,999 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,020 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,036 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,037 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-12 20:12:12,056 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,070 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,071 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,084 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,085 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,102 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,102 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,120 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,121 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,138 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,139 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,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 11 treesize of output 3 [2021-06-12 20:12:12,158 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,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 18 treesize of output 1 [2021-06-12 20:12:12,177 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,194 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,195 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,212 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,230 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,230 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,248 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,249 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,266 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,267 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,284 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,285 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,302 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,303 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,317 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,318 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,336 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,337 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2021-06-12 20:12:12,357 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,375 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,376 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,406 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,407 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,425 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,426 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,444 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,463 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,463 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,483 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,501 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,502 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,523 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,524 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:12,548 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,564 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:12,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:12,584 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,600 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,601 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,629 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,646 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,647 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,663 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,663 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,683 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,683 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,699 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,700 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,719 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,720 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,736 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,755 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,756 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,781 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,782 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,801 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,802 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,821 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,822 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,841 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,842 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,858 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,859 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,878 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,879 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,898 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,899 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,918 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,919 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,936 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,954 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,955 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,974 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,975 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:12,994 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:12,995 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,014 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,015 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,034 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,035 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,055 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,055 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,072 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,073 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,093 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,094 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,110 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,111 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,131 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,151 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,152 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,172 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,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 18 treesize of output 1 [2021-06-12 20:12:13,194 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,214 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,214 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,234 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,235 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,254 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,255 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,276 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,295 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,296 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,315 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,316 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,335 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,336 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,355 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,356 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,376 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,376 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,396 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,396 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,416 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,416 INFO L550 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,436 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,436 INFO L550 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 7 [2021-06-12 20:12:13,457 INFO L550 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,477 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,477 INFO L550 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,497 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,498 INFO L550 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,517 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,518 INFO L550 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,537 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,538 INFO L550 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,559 INFO L550 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,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 18 treesize of output 1 [2021-06-12 20:12:13,580 INFO L550 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,599 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,600 INFO L550 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,619 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,620 INFO L550 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,639 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,640 INFO L550 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,659 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,660 INFO L550 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,678 INFO L550 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,697 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,697 INFO L550 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,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 18 treesize of output 1 [2021-06-12 20:12:13,719 INFO L550 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,738 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,739 INFO L550 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:13,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 11 treesize of output 3 [2021-06-12 20:12:13,760 INFO L550 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,779 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,780 INFO L550 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,802 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,803 INFO L550 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,822 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,823 INFO L550 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,842 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,843 INFO L550 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,862 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,863 INFO L550 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,881 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,889 INFO L550 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,911 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,912 INFO L550 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,930 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,930 INFO L550 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,948 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,948 INFO L550 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,968 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,968 INFO L550 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:13,987 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:13,988 INFO L550 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,008 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,008 INFO L550 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,026 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,027 INFO L550 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,046 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,046 INFO L550 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,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 18 treesize of output 1 [2021-06-12 20:12:14,070 INFO L550 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,089 INFO L550 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,107 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,108 INFO L550 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,127 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,127 INFO L550 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,146 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,147 INFO L550 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,165 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,166 INFO L550 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,184 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,185 INFO L550 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:14,205 INFO L550 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,223 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,224 INFO L550 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,242 INFO L550 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,260 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,261 INFO L550 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,278 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,278 INFO L550 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,297 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,298 INFO L550 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,315 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,322 INFO L550 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,341 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,342 INFO L550 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,359 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,360 INFO L550 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,378 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,379 INFO L550 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,395 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,430 INFO L550 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,438 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,438 INFO L550 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,445 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,446 INFO L550 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,453 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,454 INFO L550 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,462 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,463 INFO L550 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,472 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,473 INFO L550 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,480 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,481 INFO L550 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,488 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,488 INFO L550 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,495 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,496 INFO L550 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,501 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,502 INFO L550 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,509 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,510 INFO L550 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,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 18 treesize of output 1 [2021-06-12 20:12:14,517 INFO L550 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,525 INFO L550 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,534 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,535 INFO L550 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,541 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,542 INFO L550 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,549 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,549 INFO L550 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,557 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,558 INFO L550 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,565 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,566 INFO L550 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,572 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,573 INFO L550 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,579 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,580 INFO L550 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,587 INFO L550 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,593 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,594 INFO L550 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,602 INFO L550 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,607 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,608 INFO L550 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,614 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,615 INFO L550 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,621 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,621 INFO L550 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,628 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,629 INFO L550 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,635 INFO L550 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,642 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,643 INFO L550 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,649 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,650 INFO L550 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,656 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,657 INFO L550 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,664 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,665 INFO L550 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,670 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,671 INFO L550 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,678 INFO L550 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,686 INFO L550 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,695 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,696 INFO L550 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:14,705 INFO L550 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,711 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,712 INFO L550 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,717 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,718 INFO L550 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,724 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,724 INFO L550 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,730 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,730 INFO L550 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,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 13 treesize of output 9 [2021-06-12 20:12:14,737 INFO L550 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,742 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,743 INFO L550 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,748 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,748 INFO L550 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,754 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,755 INFO L550 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,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 25 treesize of output 9 [2021-06-12 20:12:14,763 INFO L550 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,769 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,769 INFO L550 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:14,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:14,777 INFO L550 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,782 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,783 INFO L550 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,788 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,788 INFO L550 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,793 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,794 INFO L550 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,799 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,800 INFO L550 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:14,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:14,806 INFO L550 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,044 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2021-06-12 20:12:15,045 INFO L628 ElimStorePlain]: treesize reduction 969, result has 21.8 percent of original size [2021-06-12 20:12:15,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 5 treesize of output 3 [2021-06-12 20:12:15,049 INFO L550 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-12 20:12:15,054 INFO L550 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,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 13 treesize of output 9 [2021-06-12 20:12:15,059 INFO L550 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,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 5 treesize of output 3 [2021-06-12 20:12:15,063 INFO L550 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,065 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:15,066 INFO L550 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,068 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:15,068 INFO L550 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-12 20:12:15,073 INFO L550 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:15,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 13 treesize of output 9 [2021-06-12 20:12:15,077 INFO L550 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:15,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-12 20:12:15,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-12 20:12:15,133 INFO L247 ElimStorePlain]: Needed 201 recursive calls to eliminate 3 variables, input treesize:11142, output treesize:103 [2021-06-12 20:12:15,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-06-12 20:12:15,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537059053] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:15,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:12:15,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-12 20:12:15,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956298369] [2021-06-12 20:12:15,303 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 20:12:15,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:12:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 20:12:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-12 20:12:15,303 INFO L87 Difference]: Start difference. First operand 443 states and 1345 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-06-12 20:12:15,772 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-06-12 20:12:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:12:15,828 INFO L93 Difference]: Finished difference Result 560 states and 1663 transitions. [2021-06-12 20:12:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 20:12:15,828 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-06-12 20:12:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:12:15,829 INFO L225 Difference]: With dead ends: 560 [2021-06-12 20:12:15,829 INFO L226 Difference]: Without dead ends: 545 [2021-06-12 20:12:15,829 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 890.5ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-12 20:12:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-12 20:12:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 440. [2021-06-12 20:12:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0387243735763096) internal successors, (1334), 439 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:12:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1334 transitions. [2021-06-12 20:12:15,835 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1334 transitions. Word has length 20 [2021-06-12 20:12:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:12:15,835 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1334 transitions. [2021-06-12 20:12:15,835 INFO L483 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-06-12 20:12:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1334 transitions. [2021-06-12 20:12:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:12:15,836 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:12:15,836 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:12:16,057 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1819 [2021-06-12 20:12:16,057 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:12:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:12:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash 20773330, now seen corresponding path program 21 times [2021-06-12 20:12:16,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:12:16,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389477568] [2021-06-12 20:12:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:12:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:12:16,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-06-12 20:12:16,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:12:16,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389477568] [2021-06-12 20:12:16,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389477568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:16,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889846902] [2021-06-12 20:12:16,303 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-06-12 20:12:16,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-12 20:12:16,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:12:16,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:12:16,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:12:16,638 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-06-12 20:12:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:12:16,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889846902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:16,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:12:16,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:12:16,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298788802] [2021-06-12 20:12:16,862 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:12:16,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:12:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:12:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:12:16,862 INFO L87 Difference]: Start difference. First operand 440 states and 1334 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-06-12 20:12:17,089 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2021-06-12 20:12:17,523 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-06-12 20:12:17,956 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-06-12 20:12:18,231 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2021-06-12 20:12:18,360 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-12 20:12:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:12:18,545 INFO L93 Difference]: Finished difference Result 658 states and 1956 transitions. [2021-06-12 20:12:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 20:12:18,545 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-06-12 20:12:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:12:18,546 INFO L225 Difference]: With dead ends: 658 [2021-06-12 20:12:18,546 INFO L226 Difference]: Without dead ends: 643 [2021-06-12 20:12:18,546 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1904.1ms TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2021-06-12 20:12:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-12 20:12:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 439. [2021-06-12 20:12:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.0342465753424657) internal successors, (1329), 438 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:12:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1329 transitions. [2021-06-12 20:12:18,552 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1329 transitions. Word has length 20 [2021-06-12 20:12:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:12:18,552 INFO L482 AbstractCegarLoop]: Abstraction has 439 states and 1329 transitions. [2021-06-12 20:12:18,552 INFO L483 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-06-12 20:12:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1329 transitions. [2021-06-12 20:12:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:12:18,553 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:12:18,553 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:12:18,753 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2748,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:12:18,753 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:12:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:12:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1121094966, now seen corresponding path program 22 times [2021-06-12 20:12:18,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:12:18,754 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693917445] [2021-06-12 20:12:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:12:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:12:19,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-06-12 20:12:19,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:12:19,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693917445] [2021-06-12 20:12:19,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693917445] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:19,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502349753] [2021-06-12 20:12:19,116 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-06-12 20:12:19,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-12 20:12:19,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:12:19,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:12:19,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:12:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:12:19,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502349753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:19,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:12:19,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:12:19,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492158249] [2021-06-12 20:12:19,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:12:19,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:12:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:12:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:12:19,597 INFO L87 Difference]: Start difference. First operand 439 states and 1329 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:12:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:12:20,085 INFO L93 Difference]: Finished difference Result 586 states and 1747 transitions. [2021-06-12 20:12:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 20:12:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:12:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:12:20,086 INFO L225 Difference]: With dead ends: 586 [2021-06-12 20:12:20,086 INFO L226 Difference]: Without dead ends: 571 [2021-06-12 20:12:20,086 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 923.3ms TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2021-06-12 20:12:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-12 20:12:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 444. [2021-06-12 20:12:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.0428893905191874) internal successors, (1348), 443 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:12:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1348 transitions. [2021-06-12 20:12:20,100 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1348 transitions. Word has length 20 [2021-06-12 20:12:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:12:20,100 INFO L482 AbstractCegarLoop]: Abstraction has 444 states and 1348 transitions. [2021-06-12 20:12:20,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:12:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1348 transitions. [2021-06-12 20:12:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:12:20,101 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:12:20,101 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:12:20,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2766,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:12:20,302 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:12:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:12:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1167101614, now seen corresponding path program 23 times [2021-06-12 20:12:20,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:12:20,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083374131] [2021-06-12 20:12:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:12:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:12:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:12:20,549 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:12:20,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083374131] [2021-06-12 20:12:20,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083374131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:12:20,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682760699] [2021-06-12 20:12:20,549 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-06-12 20:12:20,582 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-12 20:12:20,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:12:20,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:12:20,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:12:21,339 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2021-06-12 20:12:22,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 3 [2021-06-12 20:12:22,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,739 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,740 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 7 [2021-06-12 20:12:22,750 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 7 [2021-06-12 20:12:22,759 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 18 treesize of output 1 [2021-06-12 20:12:22,768 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-12 20:12:22,777 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 7 [2021-06-12 20:12:22,786 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,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 13 treesize of output 9 [2021-06-12 20:12:22,794 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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-06-12 20:12:22,803 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,811 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,811 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 18 treesize of output 1 [2021-06-12 20:12:22,820 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-12 20:12:22,828 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 3 [2021-06-12 20:12:22,838 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 3 [2021-06-12 20:12:22,847 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,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 5 treesize of output 3 [2021-06-12 20:12:22,856 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,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 5 treesize of output 3 [2021-06-12 20:12:22,864 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 18 treesize of output 1 [2021-06-12 20:12:22,874 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 18 treesize of output 1 [2021-06-12 20:12:22,883 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 7 [2021-06-12 20:12:22,893 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:22,902 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 11 treesize of output 3 [2021-06-12 20:12:22,911 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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 18 treesize of output 1 [2021-06-12 20:12:22,921 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,928 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,929 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:12:22,938 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-12 20:12:22,946 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,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-06-12 20:12:22,955 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,963 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,964 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,970 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,971 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,978 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,979 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:22,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:22,988 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:22,995 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:22,996 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,004 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:23,013 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,020 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,021 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,028 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,029 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:12:23,039 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,046 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,046 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,053 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,054 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,062 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:23,072 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,079 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,080 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:12:23,090 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,099 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,106 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,107 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,114 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,115 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,123 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,129 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,130 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,137 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,138 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,145 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,146 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,153 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,153 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,160 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,161 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,167 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,168 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,174 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,175 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,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 13 treesize of output 9 [2021-06-12 20:12:23,183 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,189 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,190 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,208 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,208 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,214 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,214 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,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 18 treesize of output 1 [2021-06-12 20:12:23,222 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,228 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,229 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,234 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,235 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,241 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,247 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,248 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,253 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,253 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,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 18 treesize of output 1 [2021-06-12 20:12:23,267 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,273 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,274 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,281 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,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 25 treesize of output 9 [2021-06-12 20:12:23,288 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,296 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,297 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,303 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,303 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,309 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,310 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,315 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,316 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-12 20:12:23,323 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,330 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:12:23,338 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,345 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,345 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,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 18 treesize of output 1 [2021-06-12 20:12:23,353 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-12 20:12:23,363 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,369 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,370 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:12:23,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 18 treesize of output 1 [2021-06-12 20:12:23,377 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,382 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,383 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,387 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:12:23,388 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-12 20:12:23,698 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-06-12 20:12:23,698 INFO L628 ElimStorePlain]: treesize reduction 296, result has 58.5 percent of original size [2021-06-12 20:12:23,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 14 xjuncts. [2021-06-12 20:12:23,704 INFO L247 ElimStorePlain]: Needed 82 recursive calls to eliminate 2 variables, input treesize:3961, output treesize:377 [2021-06-12 20:12:23,893 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-06-12 20:12:24,144 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-12 20:12:46,613 WARN L205 SmtUtils]: Spent 21.96 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:12:46,960 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-12 20:12:53,863 WARN L205 SmtUtils]: Spent 6.28 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:12:54,290 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-12 20:12:58,530 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:12:58,643 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-12 20:13:07,712 WARN L205 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:13:08,456 WARN L205 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 122 [2021-06-12 20:13:49,059 WARN L205 SmtUtils]: Spent 40.52 s on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-12 20:13:50,431 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 125 DAG size of output: 131 [2021-06-12 20:13:54,124 WARN L205 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:13:54,526 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-12 20:13:55,005 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 129 [2021-06-12 20:13:55,283 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 124 [2021-06-12 20:13:58,396 WARN L205 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 129 DAG size of output: 129 [2021-06-12 20:13:59,407 WARN L205 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 131 [2021-06-12 20:14:08,576 WARN L205 SmtUtils]: Spent 8.83 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:14:09,032 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 124 [2021-06-12 20:14:14,284 WARN L205 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:14:14,504 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 124 [2021-06-12 20:14:17,196 WARN L205 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2021-06-12 20:14:17,721 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-12 20:14:25,346 WARN L205 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-12 20:14:25,672 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 131 [2021-06-12 20:14:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:26,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682760699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:26,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:26,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-12 20:14:26,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668482536] [2021-06-12 20:14:26,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 20:14:26,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:26,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 20:14:26,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-12 20:14:26,531 INFO L87 Difference]: Start difference. First operand 444 states and 1348 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-06-12 20:14:26,701 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-12 20:14:26,991 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-12 20:14:27,733 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 139 [2021-06-12 20:14:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:27,945 INFO L93 Difference]: Finished difference Result 590 states and 1765 transitions. [2021-06-12 20:14:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 20:14:27,945 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-06-12 20:14:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:27,946 INFO L225 Difference]: With dead ends: 590 [2021-06-12 20:14:27,946 INFO L226 Difference]: Without dead ends: 575 [2021-06-12 20:14:27,946 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1814.9ms TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2021-06-12 20:14:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-06-12 20:14:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 442. [2021-06-12 20:14:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.0408163265306123) internal successors, (1341), 441 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1341 transitions. [2021-06-12 20:14:27,951 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1341 transitions. Word has length 20 [2021-06-12 20:14:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:27,952 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1341 transitions. [2021-06-12 20:14:27,952 INFO L483 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-06-12 20:14:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1341 transitions. [2021-06-12 20:14:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:27,952 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:27,952 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:28,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2784 [2021-06-12 20:14:28,157 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash 30969814, now seen corresponding path program 24 times [2021-06-12 20:14:28,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:28,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880313588] [2021-06-12 20:14:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:28,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:28,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880313588] [2021-06-12 20:14:28,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880313588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:28,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625911068] [2021-06-12 20:14:28,459 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-06-12 20:14:28,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-12 20:14:28,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:14:28,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:28,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:28,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625911068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:28,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:28,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:14:28,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466179152] [2021-06-12 20:14:28,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:14:28,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:14:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:14:28,986 INFO L87 Difference]: Start difference. First operand 442 states and 1341 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:29,337 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-06-12 20:14:29,462 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-12 20:14:29,614 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2021-06-12 20:14:29,899 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-12 20:14:30,041 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-12 20:14:30,204 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-06-12 20:14:30,559 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-12 20:14:30,696 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-12 20:14:31,016 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-12 20:14:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:31,142 INFO L93 Difference]: Finished difference Result 716 states and 2128 transitions. [2021-06-12 20:14:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-12 20:14:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:14:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:31,144 INFO L225 Difference]: With dead ends: 716 [2021-06-12 20:14:31,144 INFO L226 Difference]: Without dead ends: 701 [2021-06-12 20:14:31,144 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2395.1ms TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2021-06-12 20:14:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-06-12 20:14:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 440. [2021-06-12 20:14:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0387243735763096) internal successors, (1334), 439 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1334 transitions. [2021-06-12 20:14:31,149 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1334 transitions. Word has length 20 [2021-06-12 20:14:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:31,149 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1334 transitions. [2021-06-12 20:14:31,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1334 transitions. [2021-06-12 20:14:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:31,150 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:31,151 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:31,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3888,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:14:31,352 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1850936306, now seen corresponding path program 25 times [2021-06-12 20:14:31,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:31,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601681440] [2021-06-12 20:14:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:31,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:31,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601681440] [2021-06-12 20:14:31,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601681440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:31,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559870550] [2021-06-12 20:14:31,593 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-06-12 20:14:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:31,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:31,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:32,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-06-12 20:14:32,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559870550] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:32,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:32,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-12 20:14:32,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838888784] [2021-06-12 20:14:32,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 20:14:32,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 20:14:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-06-12 20:14:32,119 INFO L87 Difference]: Start difference. First operand 440 states and 1334 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-06-12 20:14:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:33,153 INFO L93 Difference]: Finished difference Result 596 states and 1780 transitions. [2021-06-12 20:14:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 20:14:33,154 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-06-12 20:14:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:33,154 INFO L225 Difference]: With dead ends: 596 [2021-06-12 20:14:33,154 INFO L226 Difference]: Without dead ends: 581 [2021-06-12 20:14:33,155 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1257.8ms TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2021-06-12 20:14:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-06-12 20:14:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 438. [2021-06-12 20:14:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.0320366132723113) internal successors, (1325), 437 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1325 transitions. [2021-06-12 20:14:33,159 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1325 transitions. Word has length 20 [2021-06-12 20:14:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:33,160 INFO L482 AbstractCegarLoop]: Abstraction has 438 states and 1325 transitions. [2021-06-12 20:14:33,160 INFO L483 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-06-12 20:14:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1325 transitions. [2021-06-12 20:14:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:33,160 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:33,160 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:33,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3907 [2021-06-12 20:14:33,361 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:33,361 INFO L82 PathProgramCache]: Analyzing trace with hash -756638044, now seen corresponding path program 26 times [2021-06-12 20:14:33,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:33,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794854480] [2021-06-12 20:14:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:33,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:33,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794854480] [2021-06-12 20:14:33,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794854480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:33,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468419035] [2021-06-12 20:14:33,606 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-06-12 20:14:33,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:14:33,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:14:33,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:33,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:34,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468419035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:34,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:34,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:14:34,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824732436] [2021-06-12 20:14:34,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:14:34,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:14:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:14:34,122 INFO L87 Difference]: Start difference. First operand 438 states and 1325 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:34,747 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-06-12 20:14:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:34,776 INFO L93 Difference]: Finished difference Result 707 states and 2097 transitions. [2021-06-12 20:14:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 20:14:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:14:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:34,777 INFO L225 Difference]: With dead ends: 707 [2021-06-12 20:14:34,777 INFO L226 Difference]: Without dead ends: 692 [2021-06-12 20:14:34,777 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 992.2ms TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2021-06-12 20:14:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-06-12 20:14:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 437. [2021-06-12 20:14:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.029816513761468) internal successors, (1321), 436 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1321 transitions. [2021-06-12 20:14:34,785 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1321 transitions. Word has length 20 [2021-06-12 20:14:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:34,785 INFO L482 AbstractCegarLoop]: Abstraction has 437 states and 1321 transitions. [2021-06-12 20:14:34,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1321 transitions. [2021-06-12 20:14:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:34,786 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:34,786 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:35,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3923,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:14:35,009 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash 629398172, now seen corresponding path program 27 times [2021-06-12 20:14:35,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:35,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001642002] [2021-06-12 20:14:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:35,390 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:35,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001642002] [2021-06-12 20:14:35,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001642002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:35,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828599742] [2021-06-12 20:14:35,391 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-06-12 20:14:35,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-12 20:14:35,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:14:35,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:35,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828599742] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:35,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:35,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:14:35,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042856814] [2021-06-12 20:14:35,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:14:35,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:14:35,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:14:35,888 INFO L87 Difference]: Start difference. First operand 437 states and 1321 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:36,227 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2021-06-12 20:14:36,400 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-06-12 20:14:36,825 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2021-06-12 20:14:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:37,078 INFO L93 Difference]: Finished difference Result 540 states and 1606 transitions. [2021-06-12 20:14:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 20:14:37,079 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:14:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:37,079 INFO L225 Difference]: With dead ends: 540 [2021-06-12 20:14:37,079 INFO L226 Difference]: Without dead ends: 525 [2021-06-12 20:14:37,080 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1504.8ms TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2021-06-12 20:14:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-12 20:14:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 443. [2021-06-12 20:14:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0316742081447963) internal successors, (1340), 442 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1340 transitions. [2021-06-12 20:14:37,087 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1340 transitions. Word has length 20 [2021-06-12 20:14:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:37,087 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1340 transitions. [2021-06-12 20:14:37,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1340 transitions. [2021-06-12 20:14:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:37,088 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:37,088 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:37,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3946 [2021-06-12 20:14:37,303 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1252975526, now seen corresponding path program 28 times [2021-06-12 20:14:37,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:37,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249182563] [2021-06-12 20:14:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:37,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:37,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249182563] [2021-06-12 20:14:37,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249182563] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:37,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178832028] [2021-06-12 20:14:37,663 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-06-12 20:14:37,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-12 20:14:37,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:14:37,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:37,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:38,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178832028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:38,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:38,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-12 20:14:38,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157592904] [2021-06-12 20:14:38,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 20:14:38,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:38,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 20:14:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-12 20:14:38,144 INFO L87 Difference]: Start difference. First operand 443 states and 1340 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:38,520 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-06-12 20:14:38,886 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-12 20:14:39,021 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2021-06-12 20:14:39,313 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2021-06-12 20:14:39,429 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-12 20:14:39,973 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-12 20:14:40,096 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2021-06-12 20:14:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:40,126 INFO L93 Difference]: Finished difference Result 654 states and 1937 transitions. [2021-06-12 20:14:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-12 20:14:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 20 [2021-06-12 20:14:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:40,128 INFO L225 Difference]: With dead ends: 654 [2021-06-12 20:14:40,128 INFO L226 Difference]: Without dead ends: 624 [2021-06-12 20:14:40,128 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2287.6ms TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2021-06-12 20:14:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-06-12 20:14:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 441. [2021-06-12 20:14:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 3.0295454545454548) internal successors, (1333), 440 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1333 transitions. [2021-06-12 20:14:40,133 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1333 transitions. Word has length 20 [2021-06-12 20:14:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:40,133 INFO L482 AbstractCegarLoop]: Abstraction has 441 states and 1333 transitions. [2021-06-12 20:14:40,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06-12 20:14:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1333 transitions. [2021-06-12 20:14:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:40,134 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:40,134 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:40,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3963,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-12 20:14:40,335 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1606120410, now seen corresponding path program 29 times [2021-06-12 20:14:40,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:40,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722824363] [2021-06-12 20:14:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:40,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:40,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722824363] [2021-06-12 20:14:40,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722824363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:40,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830712232] [2021-06-12 20:14:40,608 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-06-12 20:14:40,640 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-12 20:14:40,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:14:40,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:40,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:41,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,138 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 23 treesize of output 1 [2021-06-12 20:14:41,147 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,155 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,163 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 7 [2021-06-12 20:14:41,172 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,180 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,189 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 25 treesize of output 9 [2021-06-12 20:14:41,198 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:14:41,207 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,215 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-12 20:14:41,224 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:14:41,232 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 7 [2021-06-12 20:14:41,241 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,261 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,272 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,282 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,291 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 3 [2021-06-12 20:14:41,301 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,308 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,308 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,324 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 7 [2021-06-12 20:14:41,336 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,346 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 7 [2021-06-12 20:14:41,355 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:14:41,365 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 7 [2021-06-12 20:14:41,373 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,381 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 3 [2021-06-12 20:14:41,388 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,395 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,395 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,401 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,408 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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-06-12 20:14:41,417 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,425 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,425 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,431 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,432 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,438 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,438 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,446 INFO L550 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-12 20:14:41,455 INFO L550 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 3 [2021-06-12 20:14:41,463 INFO L550 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,472 INFO L550 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,481 INFO L550 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,490 INFO L550 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,499 INFO L550 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,506 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,507 INFO L550 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 16 treesize of output 7 [2021-06-12 20:14:41,515 INFO L550 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 11 treesize of output 3 [2021-06-12 20:14:41,524 INFO L550 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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-06-12 20:14:41,533 INFO L550 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,539 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,540 INFO L550 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,547 INFO L550 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,569 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,570 INFO L550 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,578 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,579 INFO L550 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,590 INFO L550 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,598 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,599 INFO L550 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,610 INFO L550 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,619 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,620 INFO L550 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,630 INFO L550 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,639 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,639 INFO L550 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,648 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,649 INFO L550 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,658 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,658 INFO L550 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,667 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,668 INFO L550 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,676 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,676 INFO L550 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,682 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,683 INFO L550 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,688 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,689 INFO L550 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,695 INFO L550 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 25 treesize of output 9 [2021-06-12 20:14:41,702 INFO L550 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 1 [2021-06-12 20:14:41,710 INFO L550 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,715 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,716 INFO L550 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,724 INFO L550 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,732 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,733 INFO L550 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,738 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,739 INFO L550 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,744 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,744 INFO L550 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,749 INFO L550 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,754 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,755 INFO L550 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 25 treesize of output 9 [2021-06-12 20:14:41,762 INFO L550 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,768 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,768 INFO L550 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,773 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,774 INFO L550 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 18 treesize of output 1 [2021-06-12 20:14:41,779 INFO L550 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,783 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,784 INFO L550 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,787 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,788 INFO L550 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,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 23 treesize of output 1 [2021-06-12 20:14:41,793 INFO L550 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,798 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,798 INFO L550 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,802 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,803 INFO L550 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,807 INFO L550 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,810 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,811 INFO L550 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,814 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,815 INFO L550 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,819 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,819 INFO L550 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,823 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,823 INFO L550 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,827 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,827 INFO L550 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,830 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-12 20:14:41,831 INFO L550 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:41,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-12 20:14:41,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2021-06-12 20:14:41,836 INFO L550 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2021-06-12 20:14:42,085 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2021-06-12 20:14:42,090 INFO L628 ElimStorePlain]: treesize reduction 79, result has 82.6 percent of original size [2021-06-12 20:14:42,096 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 14 xjuncts. [2021-06-12 20:14:42,096 INFO L247 ElimStorePlain]: Needed 91 recursive calls to eliminate 2 variables, input treesize:3899, output treesize:335 [2021-06-12 20:14:42,283 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-12 20:14:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:14:46,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830712232] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:46,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-12 20:14:46,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-12 20:14:46,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999576597] [2021-06-12 20:14:46,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 20:14:46,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:14:46,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 20:14:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-12 20:14:46,784 INFO L87 Difference]: Start difference. First operand 441 states and 1333 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-06-12 20:14:47,459 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 127 [2021-06-12 20:14:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:14:47,647 INFO L93 Difference]: Finished difference Result 540 states and 1617 transitions. [2021-06-12 20:14:47,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 20:14:47,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-06-12 20:14:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:14:47,648 INFO L225 Difference]: With dead ends: 540 [2021-06-12 20:14:47,648 INFO L226 Difference]: Without dead ends: 525 [2021-06-12 20:14:47,648 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1284.2ms TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-06-12 20:14:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-12 20:14:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 443. [2021-06-12 20:14:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0316742081447963) internal successors, (1340), 442 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 20:14:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1340 transitions. [2021-06-12 20:14:47,655 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1340 transitions. Word has length 20 [2021-06-12 20:14:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:14:47,655 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1340 transitions. [2021-06-12 20:14:47,655 INFO L483 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-06-12 20:14:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1340 transitions. [2021-06-12 20:14:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-12 20:14:47,656 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:14:47,657 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:14:47,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3980 [2021-06-12 20:14:47,877 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:14:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:14:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1090177414, now seen corresponding path program 30 times [2021-06-12 20:14:47,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:14:47,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464972226] [2021-06-12 20:14:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:14:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:14:48,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-06-12 20:14:48,196 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:14:48,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464972226] [2021-06-12 20:14:48,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464972226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-12 20:14:48,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235609870] [2021-06-12 20:14:48,197 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-06-12 20:14:48,230 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-12 20:14:48,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-12 20:14:48,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-12 20:14:48,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-12 20:14:49,333 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-12 20:14:51,251 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 181 DAG size of output: 163 [2021-06-12 20:14:51,482 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 156 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown