java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:24:45,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:24:45,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:24:45,059 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:24:45,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:24:45,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:24:45,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:24:45,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:24:45,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:24:45,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:24:45,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:24:45,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:24:45,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:24:45,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:24:45,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:24:45,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:24:45,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:24:45,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:24:45,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:24:45,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:24:45,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:24:45,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:24:45,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:24:45,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:24:45,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:24:45,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:24:45,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:24:45,083 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:24:45,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:24:45,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:24:45,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:24:45,084 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:24:45,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:24:45,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:24:45,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:24:45,095 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:24:45,095 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:24:45,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:24:45,096 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:24:45,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:24:45,097 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:24:45,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:24:45,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:24:45,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:24:45,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:24:45,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:24:45,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:24:45,098 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:24:45,098 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:24:45,098 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:24:45,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:24:45,141 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:24:45,144 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:24:45,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:24:45,146 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:24:45,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 19:24:45,307 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:24:45,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:24:45,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:24:45,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:24:45,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:24:45,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de1fdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45, skipping insertion in model container [2018-02-04 19:24:45,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,334 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:24:45,373 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:24:45,454 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:24:45,467 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:24:45,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45 WrapperNode [2018-02-04 19:24:45,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:24:45,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:24:45,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:24:45,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:24:45,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... [2018-02-04 19:24:45,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:24:45,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:24:45,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:24:45,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:24:45,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-04 19:24:45,533 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:24:45,533 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:24:45,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:24:45,534 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:24:45,534 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:24:45,534 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:24:45,534 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:24:45,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:24:45,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:24:45,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:24:45,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:24:45,681 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:24:45,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:24:45 BoogieIcfgContainer [2018-02-04 19:24:45,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:24:45,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:24:45,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:24:45,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:24:45,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:24:45" (1/3) ... [2018-02-04 19:24:45,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7625ace2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:24:45, skipping insertion in model container [2018-02-04 19:24:45,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:24:45" (2/3) ... [2018-02-04 19:24:45,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7625ace2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:24:45, skipping insertion in model container [2018-02-04 19:24:45,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:24:45" (3/3) ... [2018-02-04 19:24:45,686 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 19:24:45,691 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:24:45,696 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 19:24:45,729 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:24:45,730 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:24:45,730 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:24:45,730 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:24:45,730 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:24:45,730 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:24:45,730 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:24:45,731 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:24:45,731 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:24:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 19:24:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:24:45,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:45,751 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:45,751 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:45,755 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-04 19:24:45,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:45,758 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:45,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:45,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:45,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:45,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:45,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:45,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:24:45,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:24:45,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:24:45,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:24:45,933 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 19:24:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,068 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 19:24:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:24:46,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:24:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,075 INFO L225 Difference]: With dead ends: 74 [2018-02-04 19:24:46,075 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 19:24:46,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:24:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 19:24:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-04 19:24:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 19:24:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-04 19:24:46,105 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-04 19:24:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,105 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-04 19:24:46,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:24:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-04 19:24:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:24:46,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,107 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,107 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-04 19:24:46,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,107 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:24:46,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:24:46,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:24:46,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:24:46,185 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-04 19:24:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,259 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-04 19:24:46,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:24:46,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:24:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,261 INFO L225 Difference]: With dead ends: 71 [2018-02-04 19:24:46,261 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 19:24:46,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:24:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 19:24:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-04 19:24:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 19:24:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 19:24:46,267 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-04 19:24:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,267 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 19:24:46,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:24:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 19:24:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:24:46,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,268 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,268 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,269 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-04 19:24:46,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,269 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:24:46,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:24:46,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:24:46,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,316 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-04 19:24:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,359 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-04 19:24:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:24:46,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 19:24:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,360 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:24:46,360 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:24:46,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:24:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-04 19:24:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:24:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-04 19:24:46,365 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-04 19:24:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,365 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-04 19:24:46,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:24:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-04 19:24:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:24:46,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,366 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,366 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-04 19:24:46,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,366 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:24:46,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:24:46,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:24:46,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,400 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-04 19:24:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,456 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 19:24:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:24:46,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 19:24:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,457 INFO L225 Difference]: With dead ends: 70 [2018-02-04 19:24:46,457 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 19:24:46,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 19:24:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 19:24:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:24:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-04 19:24:46,465 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-04 19:24:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,465 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-04 19:24:46,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:24:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-04 19:24:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:24:46,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,466 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,466 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-04 19:24:46,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,467 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:24:46,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:24:46,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:24:46,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,516 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-04 19:24:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,532 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 19:24:46,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:24:46,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 19:24:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,533 INFO L225 Difference]: With dead ends: 47 [2018-02-04 19:24:46,533 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 19:24:46,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 19:24:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 19:24:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 19:24:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 19:24:46,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-04 19:24:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,536 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 19:24:46,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:24:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 19:24:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:24:46,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,537 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-04 19:24:46,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:24:46,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:24:46,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:24:46,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:24:46,586 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-04 19:24:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,616 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 19:24:46,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:24:46,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 19:24:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,618 INFO L225 Difference]: With dead ends: 44 [2018-02-04 19:24:46,618 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 19:24:46,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:24:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 19:24:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 19:24:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 19:24:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-04 19:24:46,621 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-04 19:24:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,621 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-04 19:24:46,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:24:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-04 19:24:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:24:46,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,622 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,622 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-04 19:24:46,622 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,622 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:24:46,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:24:46,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:24:46,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:24:46,669 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-04 19:24:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,720 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 19:24:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:24:46,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 19:24:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,721 INFO L225 Difference]: With dead ends: 50 [2018-02-04 19:24:46,721 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:24:46,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:24:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:24:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 19:24:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 19:24:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 19:24:46,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-04 19:24:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,725 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 19:24:46,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:24:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 19:24:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:24:46,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,726 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-04 19:24:46,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,727 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:46,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:24:46,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:24:46,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:24:46,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:24:46,762 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-04 19:24:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,778 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-04 19:24:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:24:46,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 19:24:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,779 INFO L225 Difference]: With dead ends: 73 [2018-02-04 19:24:46,779 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 19:24:46,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:24:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 19:24:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-04 19:24:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 19:24:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 19:24:46,783 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-04 19:24:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,783 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 19:24:46,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:24:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 19:24:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:24:46,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,784 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,784 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-04 19:24:46,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,784 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,785 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:24:46,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:46,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:24:46,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:24:46,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:24:46,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,822 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 19:24:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,831 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 19:24:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:24:46,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 19:24:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,831 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:24:46,832 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 19:24:46,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 19:24:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-04 19:24:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 19:24:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 19:24:46,834 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-04 19:24:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,834 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 19:24:46,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:24:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 19:24:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:24:46,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,835 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,835 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-04 19:24:46,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,835 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,850 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:24:46,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:46,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:46,851 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:46,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:24:46,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:46,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:46,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:24:46,939 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:24:46,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:46,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:46,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:24:46,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:24:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:24:46,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:24:46,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 19:24:46,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:24:46,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:24:46,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-02-04 19:24:46,972 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-02-04 19:24:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:47,088 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-02-04 19:24:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:24:47,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 19:24:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:47,089 INFO L225 Difference]: With dead ends: 57 [2018-02-04 19:24:47,089 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 19:24:47,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2018-02-04 19:24:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 19:24:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-02-04 19:24:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 19:24:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 19:24:47,092 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-02-04 19:24:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:47,093 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 19:24:47,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:24:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 19:24:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:24:47,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:47,094 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:47,094 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-02-04 19:24:47,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:47,094 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:47,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:47,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:47,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:47,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:47,118 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:24:47,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:47,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:47,119 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:47,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:47,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:24:47,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:24:47,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:24:47,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:24:47,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:24:47,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:24:47,328 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse1 (mod v_prenex_2 4294967296))) (and (= (store |c_old(#length)| v_prenex_3 (+ .cse1 (- 4294967296))) |c_#length|) (<= (select |c_old(#valid)| v_prenex_3) 0) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:24:47,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:47,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:47,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:24:47,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:47,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:47,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 19:24:47,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:47,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:47,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:24:47,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 19:24:47,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:24:47,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:24:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:24:47,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:24:47,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 19:24:47,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:24:47,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:24:47,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2018-02-04 19:24:47,516 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 12 states. [2018-02-04 19:24:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:52,354 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2018-02-04 19:24:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:24:52,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 19:24:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:52,356 INFO L225 Difference]: With dead ends: 100 [2018-02-04 19:24:52,356 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 19:24:52,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2018-02-04 19:24:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 19:24:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 55. [2018-02-04 19:24:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 19:24:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-02-04 19:24:52,360 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-02-04 19:24:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:52,360 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-02-04 19:24:52,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:24:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-02-04 19:24:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 19:24:52,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:52,361 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:52,363 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-02-04 19:24:52,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:52,363 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:52,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:24:52,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:52,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:24:52,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:24:52,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:24:52,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:24:52,393 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-02-04 19:24:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:52,417 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-02-04 19:24:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:24:52,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 19:24:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:52,419 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:24:52,419 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 19:24:52,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:24:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 19:24:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 19:24:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:24:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 19:24:52,422 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-02-04 19:24:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:52,423 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 19:24:52,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:24:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 19:24:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:24:52,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:52,424 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:52,424 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-02-04 19:24:52,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:52,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:52,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:52,435 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:24:52,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:52,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:52,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:24:52,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:24:52,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 19:24:52,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:24:52,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:24:52,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=50, Unknown=5, NotChecked=0, Total=72 [2018-02-04 19:24:52,533 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 9 states. [2018-02-04 19:24:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:52,636 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-02-04 19:24:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:24:52,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:24:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:52,637 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:24:52,637 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:24:52,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=64, Unknown=5, NotChecked=0, Total=90 [2018-02-04 19:24:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:24:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 19:24:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 19:24:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 19:24:52,639 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2018-02-04 19:24:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:52,639 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 19:24:52,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:24:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 19:24:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:24:52,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:52,639 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:52,639 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times [2018-02-04 19:24:52,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:52,640 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:52,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:24:52,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:52,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:24:52,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:24:52,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:24:52,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:24:52,667 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-02-04 19:24:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:52,689 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-02-04 19:24:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:24:52,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 19:24:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:52,690 INFO L225 Difference]: With dead ends: 74 [2018-02-04 19:24:52,690 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 19:24:52,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:24:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 19:24:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-02-04 19:24:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 19:24:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 19:24:52,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2018-02-04 19:24:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:52,692 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 19:24:52,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:24:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 19:24:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:24:52,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:52,692 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:52,692 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times [2018-02-04 19:24:52,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:52,692 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:52,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:24:52,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:52,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:52,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:24:52,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:52,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 19:24:52,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:24:52,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:24:52,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:24:52,746 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 7 states. [2018-02-04 19:24:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:52,775 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-04 19:24:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:24:52,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-02-04 19:24:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:52,776 INFO L225 Difference]: With dead ends: 85 [2018-02-04 19:24:52,776 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 19:24:52,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:24:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 19:24:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2018-02-04 19:24:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 19:24:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 19:24:52,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2018-02-04 19:24:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:52,779 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 19:24:52,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:24:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 19:24:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:24:52,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:52,780 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:52,780 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times [2018-02-04 19:24:52,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:52,780 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:52,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:52,799 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:24:52,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:52,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:52,800 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:52,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:52,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:24:52,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:52,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:24:52,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:52,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:24:52,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:52,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:24:52,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:52,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:24:52,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:24:53,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-02-04 19:24:53,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-02-04 19:24:53,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-02-04 19:24:53,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-02-04 19:24:53,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:24:53,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:24:53,285 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_12 Int) (v_prenex_11 Int)) (let ((.cse1 (mod v_prenex_11 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_12) 0) (< 2147483647 .cse1) (= (store |c_old(#length)| v_prenex_12 (+ .cse1 (- 4294967296))) |c_#length|))))) is different from true [2018-02-04 19:24:53,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-02-04 19:24:53,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 92 [2018-02-04 19:24:53,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-02-04 19:24:53,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 88 [2018-02-04 19:24:53,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 19:24:53,607 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-02-04 19:24:53,673 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2018-02-04 19:24:53,742 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:53,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-02-04 19:24:53,801 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:53,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:24:53,859 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:25:26,368 WARN L146 SmtUtils]: Spent 30453ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:25:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2018-02-04 19:25:26,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:26,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 19:25:26,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:25:26,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:25:26,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=4, NotChecked=26, Total=240 [2018-02-04 19:25:26,386 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 16 states. [2018-02-04 19:25:26,684 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-04 19:25:42,022 WARN L146 SmtUtils]: Spent 2308ms on a formula simplification. DAG size of input: 104 DAG size of output 102 [2018-02-04 19:25:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:42,126 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-04 19:25:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:25:42,126 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-04 19:25:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:42,127 INFO L225 Difference]: With dead ends: 78 [2018-02-04 19:25:42,127 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 19:25:42,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=109, Invalid=592, Unknown=5, NotChecked=50, Total=756 [2018-02-04 19:25:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 19:25:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-02-04 19:25:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:25:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-04 19:25:42,130 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-02-04 19:25:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:42,130 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-04 19:25:42,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:25:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-04 19:25:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:25:42,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:42,131 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:42,131 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times [2018-02-04 19:25:42,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:42,132 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:42,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:42,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:42,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:42,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:25:42,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:42,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:42,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:42,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:42,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:42,196 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-02-04 19:25:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:42,287 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 19:25:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:25:42,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 19:25:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:42,288 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:25:42,288 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 19:25:42,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:25:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 19:25:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-04 19:25:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:25:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-04 19:25:42,291 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2018-02-04 19:25:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:42,291 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-04 19:25:42,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-04 19:25:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:25:42,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:42,292 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:42,292 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times [2018-02-04 19:25:42,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:42,292 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:42,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:42,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:42,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:42,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:25:42,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:42,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:42,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:42,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:42,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:25:42,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:42,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:42,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:42,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:25:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:25:42,634 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:25:42,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-02-04 19:25:42,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:42,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:42,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:25:42,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 19:25:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:25:42,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:25:42,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 22 [2018-02-04 19:25:42,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:25:42,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:25:42,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:25:42,671 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 23 states. [2018-02-04 19:25:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:42,908 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-02-04 19:25:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:25:42,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-02-04 19:25:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:42,909 INFO L225 Difference]: With dead ends: 92 [2018-02-04 19:25:42,909 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 19:25:42,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:25:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 19:25:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-02-04 19:25:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 19:25:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-02-04 19:25:42,912 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 43 [2018-02-04 19:25:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:42,913 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-02-04 19:25:42,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:25:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-02-04 19:25:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:25:42,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:42,913 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:42,914 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times [2018-02-04 19:25:42,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:42,914 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:42,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:42,915 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:42,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:42,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:25:43,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:43,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:43,151 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:43,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:43,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:43,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:25:43,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:25:43,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:43,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 19:25:43,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:25:43,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-02-04 19:25:43,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:25:43,320 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:25:43,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:25:43,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-02-04 19:25:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:25:43,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:25:43,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-02-04 19:25:43,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 19:25:43,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 19:25:43,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-02-04 19:25:43,330 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 24 states. [2018-02-04 19:25:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:43,546 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-02-04 19:25:43,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:25:43,547 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-02-04 19:25:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:43,547 INFO L225 Difference]: With dead ends: 84 [2018-02-04 19:25:43,547 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 19:25:43,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2018-02-04 19:25:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 19:25:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 19:25:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 19:25:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-02-04 19:25:43,549 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 43 [2018-02-04 19:25:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:43,550 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-02-04 19:25:43,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 19:25:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-02-04 19:25:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 19:25:43,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:43,550 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:43,550 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times [2018-02-04 19:25:43,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:43,551 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:43,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:43,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:43,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:43,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:25:43,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:43,572 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:43,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:43,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:25:43,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:43,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 19:25:43,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:43,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:43,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:43,589 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 6 states. [2018-02-04 19:25:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:43,613 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 19:25:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:25:43,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 19:25:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:43,613 INFO L225 Difference]: With dead ends: 82 [2018-02-04 19:25:43,613 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 19:25:43,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:25:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 19:25:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 19:25:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 19:25:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 19:25:43,616 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 45 [2018-02-04 19:25:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:43,616 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 19:25:43,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 19:25:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:25:43,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:43,617 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:43,617 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times [2018-02-04 19:25:43,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:43,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:43,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:43,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:43,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:43,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:43,644 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:43,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:43,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:43,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:43,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:43,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:43,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:25:43,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:43,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:43,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:25:43,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 19:25:43,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:25:43,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:43,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:25:43,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:43 [2018-02-04 19:25:43,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:25:43,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:25:43,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:41 [2018-02-04 19:25:43,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 19:25:43,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2018-02-04 19:25:43,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:25:43,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:25:43,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:43,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:58 [2018-02-04 19:25:43,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-02-04 19:25:43,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,926 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:25:43,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:43,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-02-04 19:25:43,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:43,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:43,950 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:98, output treesize:24 [2018-02-04 19:25:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:44,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:44,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:25:44,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:25:44,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:25:44,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:25:44,006 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 19 states. [2018-02-04 19:25:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:44,449 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-04 19:25:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:25:44,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 19:25:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:44,450 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:25:44,450 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 19:25:44,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-02-04 19:25:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 19:25:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 19:25:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 19:25:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-02-04 19:25:44,453 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 48 [2018-02-04 19:25:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:44,453 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-02-04 19:25:44,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:25:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-02-04 19:25:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:25:44,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:44,454 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:44,454 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811557, now seen corresponding path program 1 times [2018-02-04 19:25:44,454 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:44,455 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:44,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:44,455 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:44,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:44,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:25:44,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:44,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:44,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:44,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:25:44,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:25:44,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 19:25:44,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:25:44,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:25:44,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:25:44,515 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 7 states. [2018-02-04 19:25:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:44,556 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-02-04 19:25:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:25:44,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 19:25:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:44,558 INFO L225 Difference]: With dead ends: 84 [2018-02-04 19:25:44,558 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 19:25:44,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 19:25:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 19:25:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:25:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-02-04 19:25:44,561 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 48 [2018-02-04 19:25:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:44,561 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-02-04 19:25:44,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:25:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-02-04 19:25:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 19:25:44,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:44,562 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:44,562 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times [2018-02-04 19:25:44,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:44,563 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:44,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:44,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:44,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:44,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 19:25:44,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:44,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:44,601 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:44,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 19:25:44,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:25:44,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 19:25:44,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:25:44,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:25:44,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:44,638 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 9 states. [2018-02-04 19:25:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:44,670 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-02-04 19:25:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:25:44,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-02-04 19:25:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:44,671 INFO L225 Difference]: With dead ends: 112 [2018-02-04 19:25:44,671 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 19:25:44,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 19:25:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2018-02-04 19:25:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 19:25:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-02-04 19:25:44,674 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 49 [2018-02-04 19:25:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:44,674 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-02-04 19:25:44,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:25:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-02-04 19:25:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:25:44,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:44,675 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:44,675 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:44,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times [2018-02-04 19:25:44,676 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:44,676 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:44,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:44,676 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:44,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:44,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:44,690 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:44,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:44,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:44,691 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:44,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:44,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-02-04 19:25:44,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:44,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:44,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:44,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-02-04 19:25:44,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:44,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:44,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:44,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:44,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:131 [2018-02-04 19:25:45,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-02-04 19:25:45,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:45,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-02-04 19:25:45,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:45,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:45,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:103, output treesize:85 [2018-02-04 19:25:45,453 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 112 DAG size of output 112 [2018-02-04 19:25:45,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 117 [2018-02-04 19:25:45,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2018-02-04 19:25:45,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:45,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 118 [2018-02-04 19:25:45,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 8 xjuncts. [2018-02-04 19:25:46,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 82 [2018-02-04 19:25:46,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:46,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-02-04 19:25:46,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 117 [2018-02-04 19:25:46,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2018-02-04 19:25:46,516 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 82 [2018-02-04 19:25:46,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:46,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 118 [2018-02-04 19:25:46,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 8 xjuncts. [2018-02-04 19:25:46,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-02-04 19:25:47,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-02-04 19:25:47,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 38 [2018-02-04 19:25:47,732 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:47,748 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:48,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 117 [2018-02-04 19:25:48,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 118 [2018-02-04 19:25:48,627 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 8 xjuncts. [2018-02-04 19:25:48,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 102 [2018-02-04 19:25:48,811 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:48,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2018-02-04 19:25:48,975 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:48,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-02-04 19:25:48,977 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:49,125 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-02-04 19:25:50,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 4 dim-2 vars, End of recursive call: 30 dim-0 vars, and 17 xjuncts. [2018-02-04 19:25:50,672 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 17 variables, input treesize:447, output treesize:985 [2018-02-04 19:25:50,999 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 305 DAG size of output 80 [2018-02-04 19:25:51,266 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 129 DAG size of output 87 [2018-02-04 19:25:51,463 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 109 [2018-02-04 19:25:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:25:51,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:51,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:25:51,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:25:51,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:25:51,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:25:51,722 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 21 states. [2018-02-04 19:25:52,670 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 174 DAG size of output 127 [2018-02-04 19:25:53,030 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 120 DAG size of output 92 [2018-02-04 19:25:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:53,164 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 19:25:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:25:53,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-04 19:25:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:53,165 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:25:53,165 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 19:25:53,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-02-04 19:25:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 19:25:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 19:25:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 19:25:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-02-04 19:25:53,166 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 51 [2018-02-04 19:25:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:53,167 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-02-04 19:25:53,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:25:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-02-04 19:25:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 19:25:53,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:53,167 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:53,167 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:25:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 498105172, now seen corresponding path program 2 times [2018-02-04 19:25:53,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:53,167 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:53,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:53,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:53,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:53,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:53,183 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:53,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:53,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:53,184 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:25:53,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:25:53,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:25:53,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:53,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:25:53,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:25:53,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:25:53,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:25:53,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:25:53,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:25:53,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-02-04 19:25:53,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 19:25:53,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-02-04 19:25:53,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-02-04 19:25:53,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:53,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:25:53,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 92 [2018-02-04 19:25:53,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-02-04 19:25:53,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2018-02-04 19:25:53,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:53,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:53,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-02-04 19:25:53,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:54,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-02-04 19:25:54,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:54,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-02-04 19:25:54,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 88 [2018-02-04 19:25:54,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:54,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:54,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 19:25:54,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:54,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:25:54,260 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:25:54,566 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:25:54,794 WARN L143 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 81 [2018-02-04 19:25:54,986 WARN L143 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 83 [2018-02-04 19:25:55,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-02-04 19:25:55,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:55,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 125 [2018-02-04 19:25:55,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:55,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-02-04 19:25:55,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:55,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:25:55,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:55,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:25:55,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:55,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:55,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 121 [2018-02-04 19:25:55,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:56,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 121 [2018-02-04 19:25:56,035 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:56,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:25:56,412 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:56,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:25:56,417 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:56,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-02-04 19:25:56,420 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:56,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:56,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 89 [2018-02-04 19:25:56,743 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:57,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 133 [2018-02-04 19:25:57,171 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 72 [2018-02-04 19:25:57,687 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:57,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-02-04 19:25:57,690 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:57,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:57,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:25:57,693 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 123 [2018-02-04 19:25:58,144 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:58,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-02-04 19:25:58,728 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:25:58,732 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:25:58,735 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:59,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:59,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-02-04 19:25:59,230 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:59,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:59,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:25:59,233 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:59,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:59,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:25:59,236 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 12 dim-1 vars, End of recursive call: 84 dim-0 vars, and 18 xjuncts. [2018-02-04 19:25:59,744 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 48 variables, input treesize:455, output treesize:1013 [2018-02-04 19:26:00,358 WARN L146 SmtUtils]: Spent 469ms on a formula simplification. DAG size of input: 436 DAG size of output 79 [2018-02-04 19:26:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 19:26:00,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:00,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:26:00,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:26:00,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:26:00,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:26:00,378 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 19 states. [2018-02-04 19:26:01,593 WARN L146 SmtUtils]: Spent 491ms on a formula simplification. DAG size of input: 97 DAG size of output 97 [2018-02-04 19:26:01,965 WARN L143 SmtUtils]: Spent 161ms on a formula simplification that was a NOOP. DAG size: 87 [2018-02-04 19:26:02,229 WARN L143 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 83 [2018-02-04 19:26:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:02,548 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-02-04 19:26:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:26:02,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-04 19:26:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:02,549 INFO L225 Difference]: With dead ends: 98 [2018-02-04 19:26:02,549 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 19:26:02,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 19:26:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 19:26:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2018-02-04 19:26:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 19:26:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 19:26:02,551 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 54 [2018-02-04 19:26:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:02,551 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 19:26:02,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:26:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 19:26:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:26:02,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:02,552 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:02,552 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash 486079299, now seen corresponding path program 2 times [2018-02-04 19:26:02,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:02,552 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:02,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:02,553 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:02,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:02,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:26:02,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:02,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:02,771 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:02,783 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:02,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:02,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:02,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:02,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:02,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:02,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:02,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:02,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 19:26:02,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 19:26:02,877 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:02,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:26:02,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:02,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:02,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:02,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-02-04 19:26:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:26:02,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:26:02,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2018-02-04 19:26:02,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:26:02,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:26:02,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:26:02,882 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 15 states. [2018-02-04 19:26:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:03,236 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-04 19:26:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:26:03,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 19:26:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:03,236 INFO L225 Difference]: With dead ends: 86 [2018-02-04 19:26:03,236 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 19:26:03,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:26:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 19:26:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 19:26:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:26:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 19:26:03,238 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 56 [2018-02-04 19:26:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:03,238 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 19:26:03,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:26:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 19:26:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:26:03,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:03,239 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:03,239 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash 486079300, now seen corresponding path program 2 times [2018-02-04 19:26:03,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:03,239 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:03,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:03,239 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:03,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:03,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 19:26:03,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:03,441 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:03,442 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:03,456 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:03,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:03,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:03,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:26:03,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:26:03,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:03,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:03,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-02-04 19:26:03,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-02-04 19:26:03,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-02-04 19:26:03,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-04 19:26:03,539 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:03,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 19:26:03,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:03,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-02-04 19:26:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:26:03,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:26:03,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 16 [2018-02-04 19:26:03,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:26:03,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:26:03,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:26:03,547 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 17 states. [2018-02-04 19:26:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:03,945 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-04 19:26:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:26:03,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 19:26:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:03,946 INFO L225 Difference]: With dead ends: 86 [2018-02-04 19:26:03,946 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 19:26:03,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 19:26:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 19:26:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-02-04 19:26:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:26:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-02-04 19:26:03,948 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 56 [2018-02-04 19:26:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:03,948 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-02-04 19:26:03,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:26:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-02-04 19:26:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:26:03,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:03,949 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:03,949 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 43207007, now seen corresponding path program 2 times [2018-02-04 19:26:03,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:03,949 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:03,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:03,949 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:03,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:03,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 19:26:04,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:04,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:04,005 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:04,015 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:04,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:04,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 19:26:04,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:26:04,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 19:26:04,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:26:04,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:26:04,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:26:04,038 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 8 states. [2018-02-04 19:26:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:04,094 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-02-04 19:26:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:26:04,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-04 19:26:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:04,095 INFO L225 Difference]: With dead ends: 85 [2018-02-04 19:26:04,095 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 19:26:04,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:26:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 19:26:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 19:26:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 19:26:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-04 19:26:04,097 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 61 [2018-02-04 19:26:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:04,097 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-04 19:26:04,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:26:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-04 19:26:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:26:04,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:04,098 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:04,098 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 43207056, now seen corresponding path program 2 times [2018-02-04 19:26:04,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:04,099 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:04,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:04,100 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:04,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:04,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:04,119 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:04,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:04,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:04,120 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:04,144 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:04,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:04,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:04,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:04,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:04,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:26:04,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 19:26:04,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:04,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:04,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-02-04 19:26:04,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-02-04 19:26:04,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:26:04,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:04,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:04,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:04,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:33 [2018-02-04 19:26:04,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-02-04 19:26:04,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:04,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-02-04 19:26:04,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:04,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:04,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:29 [2018-02-04 19:26:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 19:26:04,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:04,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 19:26:04,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 19:26:04,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 19:26:04,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-04 19:26:04,478 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 24 states. [2018-02-04 19:26:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:05,047 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-02-04 19:26:05,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 19:26:05,047 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-04 19:26:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:05,048 INFO L225 Difference]: With dead ends: 119 [2018-02-04 19:26:05,048 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 19:26:05,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 19:26:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 19:26:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-04 19:26:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 19:26:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 19:26:05,050 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 61 [2018-02-04 19:26:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:05,051 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 19:26:05,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 19:26:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 19:26:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:26:05,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:05,051 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:05,051 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash 43207057, now seen corresponding path program 1 times [2018-02-04 19:26:05,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:05,051 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:05,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:05,052 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:05,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:05,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 19:26:05,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:05,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:05,118 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:05,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 19:26:05,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:26:05,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-02-04 19:26:05,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:26:05,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:26:05,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:26:05,272 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 13 states. [2018-02-04 19:26:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:05,457 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-02-04 19:26:05,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:26:05,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 19:26:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:05,458 INFO L225 Difference]: With dead ends: 109 [2018-02-04 19:26:05,458 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 19:26:05,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:26:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 19:26:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 19:26:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:26:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-02-04 19:26:05,460 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 61 [2018-02-04 19:26:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:05,460 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-02-04 19:26:05,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:26:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-02-04 19:26:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 19:26:05,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:05,461 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:05,461 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418765, now seen corresponding path program 1 times [2018-02-04 19:26:05,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:05,461 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:05,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:05,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:05,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:05,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:05,474 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:05,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:05,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:05,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:05,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:05,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:05,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:05,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:05,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:05,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:05,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:26:05,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 19:26:05,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-02-04 19:26:05,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:05,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:05,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:05,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:45 [2018-02-04 19:26:05,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:26:05,979 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:05,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:26:05,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:05,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:05,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:05,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:3 [2018-02-04 19:26:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 19:26:06,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:06,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:26:06,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:26:06,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:26:06,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:26:06,014 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 19 states. [2018-02-04 19:26:07,215 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-02-04 19:26:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:07,315 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-02-04 19:26:07,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 19:26:07,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-02-04 19:26:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:07,316 INFO L225 Difference]: With dead ends: 118 [2018-02-04 19:26:07,316 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 19:26:07,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 19:26:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 19:26:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2018-02-04 19:26:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:26:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 19:26:07,320 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 62 [2018-02-04 19:26:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:07,320 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 19:26:07,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:26:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 19:26:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 19:26:07,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:07,321 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:07,321 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418766, now seen corresponding path program 1 times [2018-02-04 19:26:07,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:07,321 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:07,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:07,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:07,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:07,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:07,336 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:07,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:07,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:07,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:07,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:26:07,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:26:07,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 19:26:07,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:07,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-02-04 19:26:07,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-04 19:26:07,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:07,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-02-04 19:26:07,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:07,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:07,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-02-04 19:26:07,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 19:26:07,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:07,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-02-04 19:26:07,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-02-04 19:26:07,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:07,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:45 [2018-02-04 19:26:07,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-04 19:26:07,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-02-04 19:26:07,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:50 [2018-02-04 19:26:07,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:07,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-02-04 19:26:07,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:07,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:07,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-02-04 19:26:08,045 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:26:08,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:08,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 129 [2018-02-04 19:26:08,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:08,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-02-04 19:26:08,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:08,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:26:08,252 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:272, output treesize:236 [2018-02-04 19:26:08,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-02-04 19:26:08,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,477 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:08,477 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:08,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:08,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-02-04 19:26:08,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:08,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:08,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:08,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:20 [2018-02-04 19:26:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 19:26:08,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:08,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 19:26:08,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 19:26:08,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 19:26:08,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:26:08,522 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 31 states. [2018-02-04 19:26:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:09,322 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 19:26:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 19:26:09,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-02-04 19:26:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:09,323 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:26:09,323 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:26:09,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=233, Invalid=2023, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 19:26:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:26:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 19:26:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 19:26:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-04 19:26:09,325 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 62 [2018-02-04 19:26:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:09,325 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-04 19:26:09,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 19:26:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-04 19:26:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 19:26:09,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:09,325 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:09,325 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1100405249, now seen corresponding path program 3 times [2018-02-04 19:26:09,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:09,325 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:09,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:09,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:09,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:09,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:09,342 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:09,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:09,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:09,342 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:26:09,372 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 19:26:09,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:09,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:09,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:26:09,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:26:09,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:26:09,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:26:09,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:09,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:26:09,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 19:26:09,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 19:26:09,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 19:26:09,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 19:26:09,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:09,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:26:09,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-02-04 19:26:09,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:09,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 72 [2018-02-04 19:26:09,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:09,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:09,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-02-04 19:26:09,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 70 [2018-02-04 19:26:10,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:10,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2018-02-04 19:26:10,102 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:10,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 80 [2018-02-04 19:26:10,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:10,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-02-04 19:26:10,327 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 19:26:10,330 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-02-04 19:26:10,432 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 19:26:10,434 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:26:10,530 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:205, output treesize:277 [2018-02-04 19:26:10,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 88 [2018-02-04 19:26:10,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:10,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-02-04 19:26:10,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 19:26:10,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:10,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:10,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2018-02-04 19:26:10,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:11,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2018-02-04 19:26:11,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:11,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 86 [2018-02-04 19:26:11,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:11,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 86 [2018-02-04 19:26:11,329 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:11,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2018-02-04 19:26:11,483 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:11,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-02-04 19:26:11,485 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:11,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-02-04 19:26:11,624 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:11,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:11,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-02-04 19:26:11,626 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:11,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:26:11,761 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 24 variables, input treesize:229, output treesize:357 [2018-02-04 19:26:12,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 92 [2018-02-04 19:26:12,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 19:26:12,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 88 [2018-02-04 19:26:12,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 65 [2018-02-04 19:26:12,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-02-04 19:26:12,395 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 77 [2018-02-04 19:26:12,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-02-04 19:26:12,523 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:12,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 19:26:12,582 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:12,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:26:12,633 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:26:12,954 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:26:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 19:26:12,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:12,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:26:12,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:26:12,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:26:12,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:26:12,990 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 22 states. [2018-02-04 19:26:14,158 WARN L146 SmtUtils]: Spent 380ms on a formula simplification. DAG size of input: 123 DAG size of output 96 [2018-02-04 19:26:14,578 WARN L146 SmtUtils]: Spent 358ms on a formula simplification. DAG size of input: 104 DAG size of output 98 [2018-02-04 19:26:15,133 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 98 DAG size of output 98 [2018-02-04 19:26:15,344 WARN L143 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 82 [2018-02-04 19:26:15,682 WARN L146 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 86 DAG size of output 86 [2018-02-04 19:26:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:15,899 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-02-04 19:26:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:26:15,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-04 19:26:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:15,899 INFO L225 Difference]: With dead ends: 143 [2018-02-04 19:26:15,900 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 19:26:15,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 19:26:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 19:26:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2018-02-04 19:26:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 19:26:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 19:26:15,903 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 67 [2018-02-04 19:26:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:15,903 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 19:26:15,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:26:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 19:26:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 19:26:15,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:15,904 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:15,904 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 604576341, now seen corresponding path program 3 times [2018-02-04 19:26:15,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:15,904 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:15,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:15,904 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:15,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:15,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:15,919 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:15,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:15,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:15,920 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:26:15,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 19:26:15,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:15,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:15,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 19:26:15,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 19:26:16,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:16,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:30 [2018-02-04 19:26:16,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:16,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:16,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-02-04 19:26:16,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:26:16,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-02-04 19:26:16,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-02-04 19:26:16,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-02-04 19:26:16,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-02-04 19:26:16,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 57 [2018-02-04 19:26:16,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:16,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 67 [2018-02-04 19:26:16,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:16,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-04 19:26:16,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:105, output treesize:189 [2018-02-04 19:26:16,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2018-02-04 19:26:16,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 54 [2018-02-04 19:26:16,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-02-04 19:26:16,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-02-04 19:26:16,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-02-04 19:26:16,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-02-04 19:26:16,529 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-02-04 19:26:16,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:16,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-02-04 19:26:16,599 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,611 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:16,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-04 19:26:16,657 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:309, output treesize:232 [2018-02-04 19:26:16,820 WARN L143 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 19:26:16,984 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 19:26:16,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59 [2018-02-04 19:26:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 87 [2018-02-04 19:26:17,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-02-04 19:26:17,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-02-04 19:26:17,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-02-04 19:26:17,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-02-04 19:26:17,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2018-02-04 19:26:17,294 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 72 [2018-02-04 19:26:17,341 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:17,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 8 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-02-04 19:26:17,393 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 26 variables, input treesize:252, output treesize:133 [2018-02-04 19:26:17,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2018-02-04 19:26:17,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-02-04 19:26:17,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-02-04 19:26:17,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-02-04 19:26:17,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 102 [2018-02-04 19:26:17,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-02-04 19:26:17,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:17,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 92 [2018-02-04 19:26:17,836 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:17,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-02-04 19:26:17,899 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:17,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:17,960 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 17 variables, input treesize:332, output treesize:53 [2018-02-04 19:26:18,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-02-04 19:26:18,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 4 [2018-02-04 19:26:18,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:18,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:18,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:18,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:10 [2018-02-04 19:26:18,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:18,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 19:26:18,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:18,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:18,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 19:26:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 19:26:18,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:18,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 19:26:18,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:26:18,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:26:18,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:26:18,134 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 25 states. [2018-02-04 19:26:18,770 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-02-04 19:26:19,145 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 78 DAG size of output 73 [2018-02-04 19:26:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:19,547 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-02-04 19:26:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 19:26:19,547 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-02-04 19:26:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:19,547 INFO L225 Difference]: With dead ends: 131 [2018-02-04 19:26:19,548 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 19:26:19,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=185, Invalid=1707, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 19:26:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 19:26:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 19:26:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 19:26:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-04 19:26:19,551 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 67 [2018-02-04 19:26:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:19,551 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-04 19:26:19,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:26:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-04 19:26:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 19:26:19,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:19,552 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:19,552 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1561998936, now seen corresponding path program 2 times [2018-02-04 19:26:19,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:19,552 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:19,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:19,553 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:19,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:19,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 19:26:19,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:19,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:19,584 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:19,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:19,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:19,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 19:26:19,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:26:19,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-02-04 19:26:19,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:26:19,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:26:19,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:26:19,601 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 9 states. [2018-02-04 19:26:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:19,697 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-04 19:26:19,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:26:19,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-02-04 19:26:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:19,698 INFO L225 Difference]: With dead ends: 119 [2018-02-04 19:26:19,698 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 19:26:19,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:26:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 19:26:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 19:26:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 19:26:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-04 19:26:19,701 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 68 [2018-02-04 19:26:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:19,701 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-04 19:26:19,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:26:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-04 19:26:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 19:26:19,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:19,702 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:19,702 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2135916493, now seen corresponding path program 2 times [2018-02-04 19:26:19,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:19,702 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:19,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:19,703 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:19,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:19,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:19,724 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:19,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:19,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:19,725 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:19,758 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:19,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:19,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:19,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:26:19,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:19,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:19,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:26:19,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:19,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:19,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:19,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:19,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:19,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:58 [2018-02-04 19:26:19,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 19:26:19,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:19,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:19,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:24 [2018-02-04 19:26:20,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-02-04 19:26:20,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 79 [2018-02-04 19:26:20,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:20,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:20,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:20,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:92 [2018-02-04 19:26:20,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 51 [2018-02-04 19:26:20,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-02-04 19:26:20,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:20,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:20,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:20,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:58 [2018-02-04 19:26:20,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2018-02-04 19:26:20,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,485 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:20,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:20,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-02-04 19:26:20,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:20,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:20,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:20,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:49 [2018-02-04 19:26:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 19:26:20,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:20,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 19:26:20,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 19:26:20,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 19:26:20,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1103, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 19:26:20,766 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 35 states. [2018-02-04 19:26:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:22,240 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-02-04 19:26:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 19:26:22,241 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-02-04 19:26:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:22,241 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:26:22,241 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:26:22,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=3412, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 19:26:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:26:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 19:26:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:26:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-02-04 19:26:22,243 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 70 [2018-02-04 19:26:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:22,243 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-02-04 19:26:22,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 19:26:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-02-04 19:26:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 19:26:22,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:22,244 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:22,244 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1911531387, now seen corresponding path program 3 times [2018-02-04 19:26:22,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:22,244 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:22,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:22,245 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:22,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:22,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:22,257 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:22,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:22,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:22,257 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:26:22,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 19:26:22,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:22,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:22,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:22,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:22,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:22,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:26:22,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 19:26:22,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:22,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:22,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-04 19:26:22,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-02-04 19:26:22,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:22,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:17 [2018-02-04 19:26:22,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-02-04 19:26:22,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 10 [2018-02-04 19:26:22,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:15 [2018-02-04 19:26:22,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:22,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 19:26:22,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:22,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 19:26:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 19:26:22,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:22,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 19:26:22,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:26:22,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:26:22,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:26:22,492 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 14 states. [2018-02-04 19:26:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:22,816 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-02-04 19:26:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:26:22,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-02-04 19:26:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:22,817 INFO L225 Difference]: With dead ends: 106 [2018-02-04 19:26:22,817 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 19:26:22,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:26:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 19:26:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-02-04 19:26:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 19:26:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-02-04 19:26:22,818 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 74 [2018-02-04 19:26:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:22,818 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-02-04 19:26:22,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:26:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-02-04 19:26:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 19:26:22,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:22,819 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:22,819 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 872069176, now seen corresponding path program 2 times [2018-02-04 19:26:22,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:22,820 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:22,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:22,820 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:22,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:22,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:22,832 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:22,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:22,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:22,832 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:26:22,849 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:26:22,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:22,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:22,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:22,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:22,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 19:26:22,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-04 19:26:22,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:22,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-02-04 19:26:22,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:22,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-02-04 19:26:23,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:26:23,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:26:23,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-04 19:26:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:26:23,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:23,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 19:26:23,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:26:23,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:26:23,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:26:23,033 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 18 states. [2018-02-04 19:26:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:23,323 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-02-04 19:26:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 19:26:23,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-02-04 19:26:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:23,324 INFO L225 Difference]: With dead ends: 170 [2018-02-04 19:26:23,324 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 19:26:23,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:26:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 19:26:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 123. [2018-02-04 19:26:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 19:26:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 19:26:23,327 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 75 [2018-02-04 19:26:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:23,327 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 19:26:23,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:26:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 19:26:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 19:26:23,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:23,328 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:23,328 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash 872069177, now seen corresponding path program 3 times [2018-02-04 19:26:23,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:23,328 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:23,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:23,329 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:23,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:23,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:23,343 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:23,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:23,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:23,344 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:26:23,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 19:26:23,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:23,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:23,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:26:23,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:26:23,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:23,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:23,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-02-04 19:26:23,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-02-04 19:26:23,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-02-04 19:26:23,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:23,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:23,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-02-04 19:26:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:36 [2018-02-04 19:26:23,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-02-04 19:26:23,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:23,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:26:23,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:61 [2018-02-04 19:26:23,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-02-04 19:26:23,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:23,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:39 [2018-02-04 19:26:23,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:23,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-02-04 19:26:23,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:23,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:40 [2018-02-04 19:26:23,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-02-04 19:26:23,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:23,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:23,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-02-04 19:26:23,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:23,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:23,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:23,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:15 [2018-02-04 19:26:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:26:23,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:23,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:26:23,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:26:23,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:26:23,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:26:23,762 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 22 states. [2018-02-04 19:26:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:24,250 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-02-04 19:26:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 19:26:24,250 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-02-04 19:26:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:24,251 INFO L225 Difference]: With dead ends: 130 [2018-02-04 19:26:24,251 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 19:26:24,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 19:26:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 19:26:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-02-04 19:26:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 19:26:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 19:26:24,253 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 75 [2018-02-04 19:26:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:24,254 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 19:26:24,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:26:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 19:26:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 19:26:24,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:24,254 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:24,254 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash 800745780, now seen corresponding path program 4 times [2018-02-04 19:26:24,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:24,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:24,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:24,255 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:24,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:24,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:24,268 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:24,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:24,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:24,269 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 19:26:24,286 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 19:26:24,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:24,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:24,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:26:24,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:26:24,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:26:24,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:26:24,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:24,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:26:24,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-02-04 19:26:24,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 19:26:24,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-02-04 19:26:24,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 19:26:24,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:24,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:26:24,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-02-04 19:26:24,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:24,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:24,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 81 [2018-02-04 19:26:24,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2018-02-04 19:26:25,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 19:26:25,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2018-02-04 19:26:25,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-02-04 19:26:25,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 70 [2018-02-04 19:26:25,248 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:25,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-02-04 19:26:25,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:25,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:26:25,362 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:225, output treesize:177 [2018-02-04 19:26:25,650 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 94 DAG size of output 74 [2018-02-04 19:26:25,845 WARN L143 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 77 [2018-02-04 19:26:26,028 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 78 [2018-02-04 19:26:26,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-02-04 19:26:26,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:26,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 114 [2018-02-04 19:26:26,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:26,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 82 [2018-02-04 19:26:26,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:26,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:26,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 126 [2018-02-04 19:26:26,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:27,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:27,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:27,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:27,106 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:27,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-02-04 19:26:27,108 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:27,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 126 [2018-02-04 19:26:27,408 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:27,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-02-04 19:26:27,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:27,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-02-04 19:26:27,807 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:27,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:27,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-02-04 19:26:27,809 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:28,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 104 [2018-02-04 19:26:28,159 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:28,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-02-04 19:26:28,574 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:28,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2018-02-04 19:26:28,576 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:28,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:28,578 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:28,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:28,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:26:28,951 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:29,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-02-04 19:26:29,339 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:29,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-02-04 19:26:29,342 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:29,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:29,344 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:29,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:29,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 108 [2018-02-04 19:26:29,745 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:30,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 12 dim-1 vars, End of recursive call: 84 dim-0 vars, and 18 xjuncts. [2018-02-04 19:26:30,222 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 48 variables, input treesize:413, output treesize:887 [2018-02-04 19:26:30,695 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 431 DAG size of output 74 [2018-02-04 19:26:30,957 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 78 [2018-02-04 19:26:31,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 122 [2018-02-04 19:26:31,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-02-04 19:26:31,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:26:31,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:31,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:31,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:31,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-02-04 19:26:31,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:31,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:31,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:31,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:31,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-02-04 19:26:31,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:32,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 82 [2018-02-04 19:26:32,036 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:32,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 126 [2018-02-04 19:26:32,297 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:32,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:32,632 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:32,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-02-04 19:26:32,637 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:32,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-02-04 19:26:32,639 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:32,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-02-04 19:26:32,919 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:32,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-02-04 19:26:32,922 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:32,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:32,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-02-04 19:26:32,924 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:33,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 116 [2018-02-04 19:26:33,201 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:33,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 104 [2018-02-04 19:26:33,570 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:33,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:33,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 104 [2018-02-04 19:26:33,998 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:34,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 12 dim-1 vars, End of recursive call: 84 dim-0 vars, and 18 xjuncts. [2018-02-04 19:26:34,476 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 48 variables, input treesize:413, output treesize:887 [2018-02-04 19:26:34,969 WARN L146 SmtUtils]: Spent 317ms on a formula simplification. DAG size of input: 431 DAG size of output 74 [2018-02-04 19:26:35,177 WARN L143 SmtUtils]: Spent 158ms on a formula simplification that was a NOOP. DAG size: 82 [2018-02-04 19:26:35,379 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 81 [2018-02-04 19:26:35,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-02-04 19:26:35,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:35,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 125 [2018-02-04 19:26:35,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:35,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:35,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 79 [2018-02-04 19:26:35,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:36,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-02-04 19:26:36,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:36,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 115 [2018-02-04 19:26:36,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:36,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 123 [2018-02-04 19:26:36,628 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:36,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:26:36,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:36,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-02-04 19:26:36,978 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:36,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:36,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:26:36,981 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:37,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:37,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 133 [2018-02-04 19:26:37,274 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:37,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 83 [2018-02-04 19:26:37,680 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:38,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:26:38,094 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:38,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:26:38,097 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:38,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-02-04 19:26:38,099 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:38,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 121 [2018-02-04 19:26:38,497 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:38,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:26:38,993 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:38,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-02-04 19:26:38,996 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:38,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:38,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 72 [2018-02-04 19:26:38,998 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:39,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 12 dim-1 vars, End of recursive call: 84 dim-0 vars, and 18 xjuncts. [2018-02-04 19:26:39,434 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 48 variables, input treesize:455, output treesize:1013 [2018-02-04 19:26:39,941 WARN L146 SmtUtils]: Spent 371ms on a formula simplification. DAG size of input: 434 DAG size of output 77 [2018-02-04 19:26:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 5 proven. 103 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 19:26:39,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:39,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 19:26:39,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:26:39,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:26:39,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:26:39,984 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 23 states. [2018-02-04 19:26:41,051 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 92 DAG size of output 90 [2018-02-04 19:26:41,514 WARN L146 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 144 DAG size of output 94 [2018-02-04 19:26:41,927 WARN L146 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 140 DAG size of output 86 [2018-02-04 19:26:42,573 WARN L146 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 92 DAG size of output 86 [2018-02-04 19:26:43,106 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 85 [2018-02-04 19:26:43,468 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 141 DAG size of output 82 [2018-02-04 19:26:43,767 WARN L143 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 81 [2018-02-04 19:26:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:43,951 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2018-02-04 19:26:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:26:43,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-02-04 19:26:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:43,952 INFO L225 Difference]: With dead ends: 167 [2018-02-04 19:26:43,952 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 19:26:43,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 19:26:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 19:26:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 127. [2018-02-04 19:26:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 19:26:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2018-02-04 19:26:43,955 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 80 [2018-02-04 19:26:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:43,955 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2018-02-04 19:26:43,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:26:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2018-02-04 19:26:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 19:26:43,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:43,955 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:43,956 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239926, now seen corresponding path program 4 times [2018-02-04 19:26:43,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:43,956 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:43,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:43,956 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:43,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:43,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-04 19:26:44,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:44,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:44,022 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 19:26:44,030 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 19:26:44,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:44,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-04 19:26:44,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:26:44,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 19:26:44,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:26:44,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:26:44,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:26:44,045 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand 10 states. [2018-02-04 19:26:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:44,105 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-02-04 19:26:44,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:26:44,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-02-04 19:26:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:44,105 INFO L225 Difference]: With dead ends: 132 [2018-02-04 19:26:44,105 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 19:26:44,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:26:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 19:26:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-02-04 19:26:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 19:26:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-02-04 19:26:44,108 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 80 [2018-02-04 19:26:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:44,109 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-02-04 19:26:44,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:26:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-02-04 19:26:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 19:26:44,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:44,109 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:44,110 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239877, now seen corresponding path program 4 times [2018-02-04 19:26:44,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:44,110 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:44,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:44,111 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:44,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:44,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:44,127 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:44,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:44,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:44,128 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 19:26:44,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 19:26:44,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:44,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:44,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:44,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:44,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 19:26:44,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 19:26:44,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-02-04 19:26:44,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:44,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-02-04 19:26:44,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:44,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-02-04 19:26:44,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:44,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-02-04 19:26:44,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:44,283 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,287 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:44,297 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:85, output treesize:57 [2018-02-04 19:26:44,671 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 72 DAG size of output 71 [2018-02-04 19:26:44,950 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 112 [2018-02-04 19:26:44,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87 [2018-02-04 19:26:44,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:44,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:44,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:45,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-02-04 19:26:45,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 39 [2018-02-04 19:26:45,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:45,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:45,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 98 [2018-02-04 19:26:45,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 97 [2018-02-04 19:26:45,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:45,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 127 [2018-02-04 19:26:45,317 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-02-04 19:26:45,391 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 19:26:45,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-02-04 19:26:45,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 39 [2018-02-04 19:26:45,584 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:45,594 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:45,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-02-04 19:26:45,596 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:45,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 19:26:45,597 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:45,601 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:45,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 98 [2018-02-04 19:26:45,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 105 [2018-02-04 19:26:45,777 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:45,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 127 [2018-02-04 19:26:45,845 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-02-04 19:26:45,930 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 19:26:46,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 80 [2018-02-04 19:26:46,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-02-04 19:26:46,156 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 82 [2018-02-04 19:26:46,199 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,221 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-02-04 19:26:46,225 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:46,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 19:26:46,226 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,232 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 98 [2018-02-04 19:26:46,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-02-04 19:26:46,244 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 100 [2018-02-04 19:26:46,290 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,319 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2018-02-04 19:26:46,324 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:46,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 19:26:46,325 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,333 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-02-04 19:26:46,536 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:46,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 19:26:46,538 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,544 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2018-02-04 19:26:46,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 39 [2018-02-04 19:26:46,554 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,568 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-02-04 19:26:46,572 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:46,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 19:26:46,573 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,579 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:46,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-02-04 19:26:46,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 39 [2018-02-04 19:26:46,588 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,602 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 92 [2018-02-04 19:26:46,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2018-02-04 19:26:46,789 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:46,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 115 [2018-02-04 19:26:46,848 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 8 xjuncts. [2018-02-04 19:26:46,901 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:26:47,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 8 dim-2 vars, End of recursive call: 25 dim-0 vars, and 11 xjuncts. [2018-02-04 19:26:47,079 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 29 variables, input treesize:334, output treesize:409 [2018-02-04 19:26:47,547 WARN L146 SmtUtils]: Spent 425ms on a formula simplification. DAG size of input: 200 DAG size of output 138 [2018-02-04 19:26:47,822 WARN L143 SmtUtils]: Spent 207ms on a formula simplification that was a NOOP. DAG size: 139 [2018-02-04 19:26:48,248 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 138 DAG size of output 109 [2018-02-04 19:26:48,496 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 103 [2018-02-04 19:26:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-02-04 19:26:48,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 19:26:48,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:48,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:48,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 19:26:48,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:26:48,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:48,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:48,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-02-04 19:26:48,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:26:48,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:48,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:48,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-02-04 19:26:48,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 19:26:48,737 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:48,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:48,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2018-02-04 19:26:48,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 75 [2018-02-04 19:26:48,819 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:48,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2018-02-04 19:26:48,850 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:48,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 98 [2018-02-04 19:26:48,893 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-02-04 19:26:48,941 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:26:49,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-04 19:26:49,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 19:26:49,004 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,009 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2018-02-04 19:26:49,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-02-04 19:26:49,070 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-02-04 19:26:49,091 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2018-02-04 19:26:49,111 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,129 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 19:26:49,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-02-04 19:26:49,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2018-02-04 19:26:49,203 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,210 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 19:26:49,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:26:49,280 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,284 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-02-04 19:26:49,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2018-02-04 19:26:49,349 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,356 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 19:26:49,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:26:49,420 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,424 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-02-04 19:26:49,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2018-02-04 19:26:49,484 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,491 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 19:26:49,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:26:49,546 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,550 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-04 19:26:49,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 19:26:49,605 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,611 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:49,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 14 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:26:49,670 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 30 variables, input treesize:407, output treesize:65 [2018-02-04 19:26:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:49,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-02-04 19:26:49,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-02-04 19:26:49,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:49,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:49,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:22 [2018-02-04 19:26:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:26:49,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:49,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 19:26:49,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 19:26:49,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 19:26:49,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-04 19:26:49,973 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 24 states. [2018-02-04 19:26:51,605 WARN L143 SmtUtils]: Spent 426ms on a formula simplification that was a NOOP. DAG size: 168 [2018-02-04 19:26:52,261 WARN L143 SmtUtils]: Spent 467ms on a formula simplification that was a NOOP. DAG size: 162 [2018-02-04 19:26:53,479 WARN L146 SmtUtils]: Spent 1109ms on a formula simplification. DAG size of input: 178 DAG size of output 177 [2018-02-04 19:26:54,598 WARN L146 SmtUtils]: Spent 1041ms on a formula simplification. DAG size of input: 175 DAG size of output 174 [2018-02-04 19:26:54,899 WARN L143 SmtUtils]: Spent 227ms on a formula simplification that was a NOOP. DAG size: 156 [2018-02-04 19:26:55,423 WARN L146 SmtUtils]: Spent 454ms on a formula simplification. DAG size of input: 169 DAG size of output 152 [2018-02-04 19:26:56,228 WARN L146 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 117 DAG size of output 116 [2018-02-04 19:26:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:56,290 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-02-04 19:26:56,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 19:26:56,290 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-02-04 19:26:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:56,291 INFO L225 Difference]: With dead ends: 147 [2018-02-04 19:26:56,291 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 19:26:56,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 19:26:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 19:26:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2018-02-04 19:26:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 19:26:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-02-04 19:26:56,293 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 80 [2018-02-04 19:26:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:56,293 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-02-04 19:26:56,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 19:26:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-02-04 19:26:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 19:26:56,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:56,293 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:56,294 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash 368138690, now seen corresponding path program 3 times [2018-02-04 19:26:56,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:56,294 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:56,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:56,294 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:56,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:56,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:56,316 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:56,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:56,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:56,317 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:26:56,344 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 19:26:56,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:56,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:56,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:56,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:56,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:26:56,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-02-04 19:26:56,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:56,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-02-04 19:26:56,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-02-04 19:26:56,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-02-04 19:26:56,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:56,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-02-04 19:26:56,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-02-04 19:26:56,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-02-04 19:26:56,746 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:56,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 19:26:56,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:56,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:3 [2018-02-04 19:26:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 35 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:26:56,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:56,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:26:56,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:26:56,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:26:56,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:26:56,788 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 22 states. [2018-02-04 19:26:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:57,308 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-02-04 19:26:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 19:26:57,308 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2018-02-04 19:26:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:57,309 INFO L225 Difference]: With dead ends: 156 [2018-02-04 19:26:57,309 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 19:26:57,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 19:26:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 19:26:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2018-02-04 19:26:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 19:26:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-02-04 19:26:57,311 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 81 [2018-02-04 19:26:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:57,311 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-02-04 19:26:57,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:26:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-02-04 19:26:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 19:26:57,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:57,312 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:57,312 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:26:57,312 INFO L82 PathProgramCache]: Analyzing trace with hash 368138691, now seen corresponding path program 4 times [2018-02-04 19:26:57,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:57,312 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:57,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:57,312 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:26:57,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:57,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:57,323 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:57,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:57,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:57,324 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 19:26:57,339 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 19:26:57,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:26:57,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:57,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:26:57,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:26:57,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:26:57,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:57,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 19:26:57,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-02-04 19:26:57,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-02-04 19:26:57,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-02-04 19:26:57,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:36 [2018-02-04 19:26:57,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-02-04 19:26:57,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:57,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-02-04 19:26:57,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:26:57,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-02-04 19:26:57,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:26:57,595 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,612 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-02-04 19:26:57,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:26:57,644 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,657 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:57,682 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:141, output treesize:129 [2018-02-04 19:26:57,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-02-04 19:26:57,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2018-02-04 19:26:57,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:57,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:57,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:141, output treesize:85 [2018-02-04 19:26:57,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:57,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 151 [2018-02-04 19:26:57,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:58,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 151 [2018-02-04 19:26:58,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:58,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 151 [2018-02-04 19:26:58,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:58,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 151 [2018-02-04 19:26:58,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:58,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-02-04 19:26:58,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:465, output treesize:545 [2018-02-04 19:26:58,480 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 111 DAG size of output 76 [2018-02-04 19:26:58,888 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 84 DAG size of output 82 [2018-02-04 19:26:58,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 168 [2018-02-04 19:26:58,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 210 [2018-02-04 19:26:58,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:58,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:58,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 154 treesize of output 255 [2018-02-04 19:26:58,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 19:26:59,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:59,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 165 [2018-02-04 19:26:59,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-02-04 19:26:59,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:59,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:59,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 115 [2018-02-04 19:26:59,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 141 [2018-02-04 19:26:59,493 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:59,508 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:59,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 176 [2018-02-04 19:26:59,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 179 [2018-02-04 19:26:59,682 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:59,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 194 [2018-02-04 19:26:59,748 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 19:26:59,798 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:26:59,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 152 [2018-02-04 19:26:59,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:59,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-04 19:26:59,808 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:59,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 115 [2018-02-04 19:27:00,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:00,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:00,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 141 [2018-02-04 19:27:00,024 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,038 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2018-02-04 19:27:00,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:27:00,211 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,222 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 162 [2018-02-04 19:27:00,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:00,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:00,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 206 [2018-02-04 19:27:00,391 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:00,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:00,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 148 treesize of output 242 [2018-02-04 19:27:00,467 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-02-04 19:27:00,526 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:27:00,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2018-02-04 19:27:00,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:27:00,687 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,698 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:00,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 8 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-02-04 19:27:00,847 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 22 variables, input treesize:605, output treesize:1041 [2018-02-04 19:27:01,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 121 [2018-02-04 19:27:01,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:01,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 99 [2018-02-04 19:27:01,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:01,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 121 [2018-02-04 19:27:01,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:01,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-02-04 19:27:01,133 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:424, output treesize:298 [2018-02-04 19:27:02,367 WARN L146 SmtUtils]: Spent 1052ms on a formula simplification. DAG size of input: 283 DAG size of output 205 [2018-02-04 19:27:02,980 WARN L143 SmtUtils]: Spent 533ms on a formula simplification that was a NOOP. DAG size: 206 [2018-02-04 19:27:03,767 WARN L143 SmtUtils]: Spent 625ms on a formula simplification that was a NOOP. DAG size: 212 [2018-02-04 19:27:03,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:03,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 257 [2018-02-04 19:27:03,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:03,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:03,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 162 [2018-02-04 19:27:03,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:04,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:04,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 257 [2018-02-04 19:27:04,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:04,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:04,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 257 [2018-02-04 19:27:04,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:04,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-1 vars, End of recursive call: 18 dim-0 vars, and 8 xjuncts. [2018-02-04 19:27:04,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:942, output treesize:1459 [2018-02-04 19:27:05,009 WARN L143 SmtUtils]: Spent 475ms on a formula simplification that was a NOOP. DAG size: 205 [2018-02-04 19:27:05,536 WARN L143 SmtUtils]: Spent 323ms on a formula simplification that was a NOOP. DAG size: 397 [2018-02-04 19:27:05,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 230 [2018-02-04 19:27:05,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:05,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 280 [2018-02-04 19:27:05,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:05,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:05,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 243 [2018-02-04 19:27:05,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:05,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 203 [2018-02-04 19:27:05,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:05,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 194 [2018-02-04 19:27:05,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:05,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:27:06,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 230 [2018-02-04 19:27:06,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:06,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 47 [2018-02-04 19:27:06,304 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:06,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:27:06,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 131 [2018-02-04 19:27:06,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:06,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-02-04 19:27:06,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:06,772 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:07,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 230 [2018-02-04 19:27:07,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 219 [2018-02-04 19:27:07,175 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:07,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:07,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 232 [2018-02-04 19:27:07,249 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:07,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:07,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 280 [2018-02-04 19:27:07,354 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:07,490 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:27:08,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 236 [2018-02-04 19:27:08,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:08,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 249 [2018-02-04 19:27:08,057 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:08,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 200 [2018-02-04 19:27:08,165 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:08,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 209 [2018-02-04 19:27:08,167 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:08,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:08,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 286 [2018-02-04 19:27:08,266 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:08,400 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:27:09,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2018-02-04 19:27:09,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:09,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-02-04 19:27:09,072 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:09,084 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:09,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 224 [2018-02-04 19:27:09,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:09,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 47 [2018-02-04 19:27:09,784 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:09,814 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:27:10,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 236 [2018-02-04 19:27:10,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 225 [2018-02-04 19:27:10,618 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:10,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:10,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 286 [2018-02-04 19:27:10,701 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:10,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:10,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 238 [2018-02-04 19:27:10,833 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-02-04 19:27:10,952 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 19:27:11,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 26 dim-0 vars, 8 dim-2 vars, End of recursive call: 82 dim-0 vars, and 22 xjuncts. [2018-02-04 19:27:11,904 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 34 variables, input treesize:1675, output treesize:4343 [2018-02-04 19:27:14,997 WARN L143 SmtUtils]: Spent 2679ms on a formula simplification that was a NOOP. DAG size: 1059 [2018-02-04 19:27:15,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:15,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:15,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:15,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 227 [2018-02-04 19:27:15,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 19:27:16,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:16,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:16,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:16,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 234 [2018-02-04 19:27:16,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:17,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:17,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:17,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:17,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 225 [2018-02-04 19:27:17,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:19,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:19,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:19,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:19,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 214 treesize of output 319 [2018-02-04 19:27:19,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 19:27:20,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:20,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:20,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:20,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 142 [2018-02-04 19:27:20,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:22,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:22,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:22,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:22,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 310 [2018-02-04 19:27:22,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 19:27:24,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:24,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:24,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:24,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:24,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 226 [2018-02-04 19:27:24,023 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:25,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:25,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:25,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:25,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:25,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 121 [2018-02-04 19:27:25,641 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:27,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:27,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:27,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:27,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 225 [2018-02-04 19:27:27,281 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:28,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:28,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:28,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:28,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 350 [2018-02-04 19:27:28,829 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:30,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:30,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:30,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:30,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 328 [2018-02-04 19:27:30,913 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:33,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:33,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:33,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:33,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:33,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 245 [2018-02-04 19:27:33,413 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:36,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:36,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:36,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:36,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:36,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 204 [2018-02-04 19:27:36,170 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:39,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:39,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:39,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:39,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:39,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 315 [2018-02-04 19:27:39,254 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-02-04 19:27:42,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:42,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:42,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:42,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:42,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 226 [2018-02-04 19:27:42,730 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:45,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:45,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:45,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:45,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 225 [2018-02-04 19:27:45,852 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:48,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:48,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:48,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:48,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:48,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 226 [2018-02-04 19:27:48,977 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:52,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:52,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:52,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:52,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 288 [2018-02-04 19:27:52,139 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-02-04 19:27:55,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:55,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:55,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:55,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:55,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 213 [2018-02-04 19:27:55,621 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:58,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:58,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:58,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:58,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 203 [2018-02-04 19:27:58,986 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-02-04 19:28:01,727 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 19:28:01,727 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:28:01,730 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:28:01,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:28:01 BoogieIcfgContainer [2018-02-04 19:28:01,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:28:01,731 INFO L168 Benchmark]: Toolchain (without parser) took 196423.83 ms. Allocated memory was 405.3 MB in the beginning and 518.0 MB in the end (delta: 112.7 MB). Free memory was 362.0 MB in the beginning and 449.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:01,732 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:28:01,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.46 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:01,733 INFO L168 Benchmark]: Boogie Preprocessor took 26.11 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:01,733 INFO L168 Benchmark]: RCFGBuilder took 181.77 ms. Allocated memory is still 405.3 MB. Free memory was 347.4 MB in the beginning and 328.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:01,733 INFO L168 Benchmark]: TraceAbstraction took 196048.70 ms. Allocated memory was 405.3 MB in the beginning and 518.0 MB in the end (delta: 112.7 MB). Free memory was 327.6 MB in the beginning and 449.1 MB in the end (delta: -121.5 MB). Peak memory consumption was 116.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:01,734 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.46 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.11 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 181.77 ms. Allocated memory is still 405.3 MB. Free memory was 347.4 MB in the beginning and 328.9 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 196048.70 ms. Allocated memory was 405.3 MB in the beginning and 518.0 MB in the end (delta: 112.7 MB). Free memory was 327.6 MB in the beginning and 449.1 MB in the end (delta: -121.5 MB). Peak memory consumption was 116.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1153. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 196.0s OverallTime, 44 OverallIterations, 6 TraceHistogramMax, 47.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1734 SDtfs, 3029 SDslu, 10474 SDs, 0 SdLazy, 12256 SolverSat, 757 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2279 GetRequests, 1399 SyntacticMatches, 54 SemanticMatches, 826 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5475 ImplicationChecksByTransitivity, 68.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 462 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 82.6s InterpolantComputationTime, 3855 NumberOfCodeBlocks, 3798 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 2664 ConstructedInterpolants, 402 QuantifiedInterpolants, 2862041 SizeOfPredicates, 246 NumberOfNonLiveVariables, 6075 ConjunctsInSsa, 959 ConjunctsInUnsatCore, 55 InterpolantComputations, 13 PerfectInterpolantSequences, 1221/2104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-28-01-739.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-28-01-739.csv Completed graceful shutdown