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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:09:25,734 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:09:25,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:09:25,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:09:25,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:09:25,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:09:25,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:09:25,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:09:25,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:09:25,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:09:25,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:09:25,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:09:25,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:09:25,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:09:25,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:09:25,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:09:25,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:09:25,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:09:25,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:09:25,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:09:25,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:09:25,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:09:25,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:09:25,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:09:25,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:09:25,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:09:25,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:09:25,767 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:09:25,767 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:09:25,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:09:25,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:09:25,768 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 18:09:25,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:09:25,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:09:25,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:09:25,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:09:25,779 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:09:25,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:09:25,779 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:09:25,779 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:09:25,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:09:25,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:09:25,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:09:25,780 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:09:25,780 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:09:25,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:09:25,780 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:09:25,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:09:25,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:09:25,781 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:09:25,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:09:25,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:09:25,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:09:25,781 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:09:25,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:09:25,782 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:09:25,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:09:25,818 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:09:25,821 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:09:25,823 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:09:25,823 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:09:25,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-02-04 18:09:25,957 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:09:25,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:09:25,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:09:25,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:09:25,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:09:25,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:09:25" (1/1) ... [2018-02-04 18:09:25,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7495b65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:25, skipping insertion in model container [2018-02-04 18:09:25,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:09:25" (1/1) ... [2018-02-04 18:09:25,975 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:09:26,001 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:09:26,091 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:09:26,103 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:09:26,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26 WrapperNode [2018-02-04 18:09:26,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:09:26,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:09:26,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:09:26,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:09:26,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (1/1) ... [2018-02-04 18:09:26,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:09:26,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:09:26,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:09:26,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:09:26,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (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 18:09:26,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:09:26,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:09:26,176 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:09:26,176 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:09:26,176 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:09:26,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:09:26,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:09:26,343 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:09:26,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:09:26 BoogieIcfgContainer [2018-02-04 18:09:26,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:09:26,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:09:26,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:09:26,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:09:26,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:09:25" (1/3) ... [2018-02-04 18:09:26,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15422ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:09:26, skipping insertion in model container [2018-02-04 18:09:26,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:09:26" (2/3) ... [2018-02-04 18:09:26,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15422ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:09:26, skipping insertion in model container [2018-02-04 18:09:26,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:09:26" (3/3) ... [2018-02-04 18:09:26,348 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-02-04 18:09:26,353 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:09:26,357 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-04 18:09:26,378 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:09:26,379 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:09:26,379 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:09:26,379 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:09:26,379 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:09:26,379 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:09:26,379 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:09:26,379 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:09:26,380 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:09:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-04 18:09:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 18:09:26,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:26,402 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:09:26,402 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487999, now seen corresponding path program 1 times [2018-02-04 18:09:26,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:26,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:26,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:26,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:26,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:26,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:26,535 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 18:09:26,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:26,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:09:26,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:09:26,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:09:26,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:09:26,551 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-02-04 18:09:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:26,717 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-04 18:09:26,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:09:26,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-04 18:09:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:26,795 INFO L225 Difference]: With dead ends: 82 [2018-02-04 18:09:26,796 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 18:09:26,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:09:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 18:09:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-04 18:09:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 18:09:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-04 18:09:26,821 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2018-02-04 18:09:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:26,821 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-04 18:09:26,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:09:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-04 18:09:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 18:09:26,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:26,822 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:09:26,822 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487998, now seen corresponding path program 1 times [2018-02-04 18:09:26,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:26,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:26,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:26,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:26,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:26,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:26,887 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 18:09:26,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:26,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:09:26,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:09:26,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:09:26,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:09:26,889 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-02-04 18:09:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:26,961 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 18:09:26,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:09:26,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-04 18:09:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:26,962 INFO L225 Difference]: With dead ends: 104 [2018-02-04 18:09:26,963 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 18:09:26,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:09:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 18:09:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 54. [2018-02-04 18:09:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 18:09:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 18:09:26,969 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2018-02-04 18:09:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:26,969 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 18:09:26,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:09:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 18:09:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:09:26,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:26,970 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:09:26,970 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 689004913, now seen corresponding path program 1 times [2018-02-04 18:09:26,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:26,971 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:26,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:26,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:26,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:26,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,020 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 18:09:27,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:27,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:09:27,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:09:27,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:09:27,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:09:27,021 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-04 18:09:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:27,095 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-04 18:09:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:09:27,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:09:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:27,096 INFO L225 Difference]: With dead ends: 64 [2018-02-04 18:09:27,096 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 18:09:27,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:09:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 18:09:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-04 18:09:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 18:09:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-02-04 18:09:27,099 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2018-02-04 18:09:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:27,099 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-02-04 18:09:27,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:09:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-02-04 18:09:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:09:27,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:27,100 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:09:27,100 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash 689004914, now seen corresponding path program 1 times [2018-02-04 18:09:27,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:27,100 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:27,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,101 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,176 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 18:09:27,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:27,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:09:27,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:09:27,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:09:27,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:09:27,177 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 5 states. [2018-02-04 18:09:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:27,290 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-02-04 18:09:27,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:09:27,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 18:09:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:27,292 INFO L225 Difference]: With dead ends: 139 [2018-02-04 18:09:27,292 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 18:09:27,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:09:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 18:09:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-02-04 18:09:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 18:09:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-02-04 18:09:27,298 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 18 [2018-02-04 18:09:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:27,298 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-02-04 18:09:27,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:09:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-02-04 18:09:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:09:27,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:27,299 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:09:27,299 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:27,299 INFO L82 PathProgramCache]: Analyzing trace with hash 689036531, now seen corresponding path program 1 times [2018-02-04 18:09:27,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:27,300 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:27,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,329 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 18:09:27,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:27,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:09:27,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:09:27,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:09:27,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:09:27,330 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 4 states. [2018-02-04 18:09:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:27,396 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-04 18:09:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:09:27,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:09:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:27,398 INFO L225 Difference]: With dead ends: 92 [2018-02-04 18:09:27,398 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 18:09:27,399 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 18:09:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 18:09:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2018-02-04 18:09:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 18:09:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-02-04 18:09:27,405 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 18 [2018-02-04 18:09:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:27,405 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-02-04 18:09:27,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:09:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-02-04 18:09:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:09:27,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:27,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:09:27,406 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 689036532, now seen corresponding path program 1 times [2018-02-04 18:09:27,406 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:27,406 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:27,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,454 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 18:09:27,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:27,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:09:27,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:09:27,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:09:27,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:09:27,455 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 4 states. [2018-02-04 18:09:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:27,525 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2018-02-04 18:09:27,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:09:27,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:09:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:27,526 INFO L225 Difference]: With dead ends: 110 [2018-02-04 18:09:27,526 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 18:09:27,526 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 18:09:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 18:09:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-02-04 18:09:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 18:09:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-02-04 18:09:27,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 18 [2018-02-04 18:09:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:27,531 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-02-04 18:09:27,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:09:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-02-04 18:09:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:09:27,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:27,532 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 18:09:27,532 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -115685232, now seen corresponding path program 1 times [2018-02-04 18:09:27,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:27,533 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:27,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,562 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 18:09:27,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:27,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:09:27,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:09:27,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:09:27,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:09:27,564 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2018-02-04 18:09:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:27,625 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-02-04 18:09:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:09:27,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 18:09:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:27,626 INFO L225 Difference]: With dead ends: 87 [2018-02-04 18:09:27,626 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 18:09:27,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:09:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 18:09:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-02-04 18:09:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 18:09:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-02-04 18:09:27,630 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 19 [2018-02-04 18:09:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:27,630 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-02-04 18:09:27,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:09:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-02-04 18:09:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 18:09:27,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:27,631 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, 1] [2018-02-04 18:09:27,631 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash 580005852, now seen corresponding path program 1 times [2018-02-04 18:09:27,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:27,632 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:27,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,765 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 18:09:27,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:27,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:09:27,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:09:27,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:09:27,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:09:27,767 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 7 states. [2018-02-04 18:09:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:27,895 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 18:09:27,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:09:27,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 18:09:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:27,896 INFO L225 Difference]: With dead ends: 77 [2018-02-04 18:09:27,896 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 18:09:27,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:09:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 18:09:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-04 18:09:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 18:09:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-02-04 18:09:27,900 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 23 [2018-02-04 18:09:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:27,900 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-02-04 18:09:27,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:09:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-02-04 18:09:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 18:09:27,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:27,901 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, 1] [2018-02-04 18:09:27,901 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -493029770, now seen corresponding path program 1 times [2018-02-04 18:09:27,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:27,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:27,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:27,922 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:27,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:27,922 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:27,923 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:27,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:27,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 6 treesize of output 5 [2018-02-04 18:09:27,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:27,999 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 18:09:28,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:09:28,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,038 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 18:09:28,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,050 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 18:09:28,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:09:28,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-02-04 18:09:28,072 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 18:09:28,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:28,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:09:28,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:09:28,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:09:28,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:09:28,074 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 6 states. [2018-02-04 18:09:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:28,211 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-02-04 18:09:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:09:28,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 18:09:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:28,212 INFO L225 Difference]: With dead ends: 91 [2018-02-04 18:09:28,212 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 18:09:28,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:09:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 18:09:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2018-02-04 18:09:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 18:09:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-04 18:09:28,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 23 [2018-02-04 18:09:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:28,216 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-04 18:09:28,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:09:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-04 18:09:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 18:09:28,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:28,217 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] [2018-02-04 18:09:28,217 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -951533272, now seen corresponding path program 1 times [2018-02-04 18:09:28,217 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:28,217 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:28,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:28,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:28,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:28,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:28,229 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:28,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:28,229 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:28,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:28,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:28,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 11 treesize of output 8 [2018-02-04 18:09:28,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 8 treesize of output 7 [2018-02-04 18:09:28,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,268 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 11 treesize of output 8 [2018-02-04 18:09:28,269 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 8 treesize of output 7 [2018-02-04 18:09:28,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 18:09:28,284 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 21 treesize of output 16 [2018-02-04 18:09:28,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,288 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 16 treesize of output 23 [2018-02-04 18:09:28,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,305 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 21 treesize of output 16 [2018-02-04 18:09:28,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,307 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 16 treesize of output 23 [2018-02-04 18:09:28,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-02-04 18:09:28,327 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 32 treesize of output 25 [2018-02-04 18:09:28,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,331 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 0 case distinctions, treesize of input 25 treesize of output 60 [2018-02-04 18:09:28,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,348 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 30 treesize of output 23 [2018-02-04 18:09:28,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,353 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 23 treesize of output 46 [2018-02-04 18:09:28,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-02-04 18:09:28,405 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 35 treesize of output 27 [2018-02-04 18:09:28,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,425 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 57 [2018-02-04 18:09:28,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:09:28,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:09:28,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-04 18:09:28,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:168 [2018-02-04 18:09:28,667 WARN L143 SmtUtils]: Spent 177ms on a formula simplification that was a NOOP. DAG size: 82 [2018-02-04 18:09:28,758 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 60 treesize of output 50 [2018-02-04 18:09:28,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 77 [2018-02-04 18:09:28,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:09:28,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:09:28,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 67 treesize of output 57 [2018-02-04 18:09:28,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 65 [2018-02-04 18:09:28,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:28,941 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 67 treesize of output 57 [2018-02-04 18:09:28,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:28,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 77 [2018-02-04 18:09:28,957 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:09:28,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:09:29,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-02-04 18:09:29,046 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:195, output treesize:197 [2018-02-04 18:09:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:29,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:09:29,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 18:09:29,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:09:29,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:09:29,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:09:29,141 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 12 states. [2018-02-04 18:09:31,583 WARN L143 SmtUtils]: Spent 1216ms on a formula simplification that was a NOOP. DAG size: 103 [2018-02-04 18:09:32,994 WARN L146 SmtUtils]: Spent 914ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-02-04 18:09:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:34,048 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-02-04 18:09:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:09:34,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-04 18:09:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:34,048 INFO L225 Difference]: With dead ends: 73 [2018-02-04 18:09:34,048 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 18:09:34,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:09:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 18:09:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-02-04 18:09:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 18:09:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-04 18:09:34,054 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 25 [2018-02-04 18:09:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:34,055 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-04 18:09:34,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:09:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-04 18:09:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 18:09:34,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:34,056 INFO L351 BasicCegarLoop]: trace histogram [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 18:09:34,056 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 567238585, now seen corresponding path program 1 times [2018-02-04 18:09:34,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:34,056 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:34,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:34,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:34,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:34,066 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:34,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:34,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:34,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:34,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:34,156 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (not (= main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-02-04 18:09:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 18:09:34,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:09:34,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 18:09:34,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:09:34,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:09:34,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-02-04 18:09:34,162 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 9 states. [2018-02-04 18:09:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:34,351 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-02-04 18:09:34,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:09:34,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 18:09:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:34,351 INFO L225 Difference]: With dead ends: 72 [2018-02-04 18:09:34,351 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 18:09:34,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=129, Unknown=2, NotChecked=24, Total=210 [2018-02-04 18:09:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 18:09:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 18:09:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 18:09:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-02-04 18:09:34,354 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 26 [2018-02-04 18:09:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:34,354 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-02-04 18:09:34,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:09:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-02-04 18:09:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:09:34,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:34,355 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 18:09:34,355 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1660969695, now seen corresponding path program 1 times [2018-02-04 18:09:34,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:34,355 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:34,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,356 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:34,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:34,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:34,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:34,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:09:34,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:09:34,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:09:34,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:09:34,421 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2018-02-04 18:09:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:34,502 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-04 18:09:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:09:34,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 18:09:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:34,503 INFO L225 Difference]: With dead ends: 119 [2018-02-04 18:09:34,503 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 18:09:34,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:09:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 18:09:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2018-02-04 18:09:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 18:09:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-02-04 18:09:34,506 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 29 [2018-02-04 18:09:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:34,506 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-02-04 18:09:34,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:09:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-02-04 18:09:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:09:34,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:34,507 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] [2018-02-04 18:09:34,507 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1477377571, now seen corresponding path program 1 times [2018-02-04 18:09:34,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:34,508 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:34,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:34,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:34,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:34,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:34,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:09:34,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:09:34,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:09:34,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:09:34,566 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 6 states. [2018-02-04 18:09:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:34,634 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-02-04 18:09:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:09:34,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 18:09:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:34,635 INFO L225 Difference]: With dead ends: 101 [2018-02-04 18:09:34,635 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 18:09:34,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:09:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 18:09:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2018-02-04 18:09:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 18:09:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-02-04 18:09:34,637 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 30 [2018-02-04 18:09:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:34,637 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-02-04 18:09:34,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:09:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-02-04 18:09:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:09:34,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:34,638 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] [2018-02-04 18:09:34,638 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash 49545921, now seen corresponding path program 1 times [2018-02-04 18:09:34,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:34,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:34,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:34,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:34,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:34,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:34,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:09:34,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:09:34,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:09:34,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:09:34,700 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2018-02-04 18:09:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:34,749 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-04 18:09:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:09:34,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 18:09:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:34,750 INFO L225 Difference]: With dead ends: 79 [2018-02-04 18:09:34,750 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 18:09:34,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:09:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 18:09:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2018-02-04 18:09:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 18:09:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-04 18:09:34,752 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 30 [2018-02-04 18:09:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:34,752 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-04 18:09:34,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:09:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-04 18:09:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 18:09:34,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:34,752 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, 1, 1] [2018-02-04 18:09:34,752 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -873404019, now seen corresponding path program 1 times [2018-02-04 18:09:34,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:34,753 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:34,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:34,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:34,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:34,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:34,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:09:34,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:09:34,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:09:34,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:09:34,853 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2018-02-04 18:09:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:34,999 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-04 18:09:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:09:34,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-04 18:09:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:35,000 INFO L225 Difference]: With dead ends: 89 [2018-02-04 18:09:35,000 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 18:09:35,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:09:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 18:09:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2018-02-04 18:09:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 18:09:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 18:09:35,002 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 34 [2018-02-04 18:09:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:35,002 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 18:09:35,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:09:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 18:09:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 18:09:35,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:35,003 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, 1, 1, 1] [2018-02-04 18:09:35,003 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 733993419, now seen corresponding path program 1 times [2018-02-04 18:09:35,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:35,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:35,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:35,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:35,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:35,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:35,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:35,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:09:35,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:09:35,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:09:35,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:09:35,100 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2018-02-04 18:09:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:35,318 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-04 18:09:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:09:35,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 18:09:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:35,319 INFO L225 Difference]: With dead ends: 105 [2018-02-04 18:09:35,320 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:09:35,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:09:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:09:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2018-02-04 18:09:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 18:09:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-04 18:09:35,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 35 [2018-02-04 18:09:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:35,322 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-04 18:09:35,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:09:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-04 18:09:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 18:09:35,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:35,326 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, 1, 1, 1] [2018-02-04 18:09:35,327 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 733993420, now seen corresponding path program 1 times [2018-02-04 18:09:35,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:35,327 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:35,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:35,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:35,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:35,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:35,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:35,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:09:35,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:09:35,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:09:35,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:09:35,432 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2018-02-04 18:09:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:35,630 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 18:09:35,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:09:35,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 18:09:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:35,630 INFO L225 Difference]: With dead ends: 93 [2018-02-04 18:09:35,630 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 18:09:35,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:09:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 18:09:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2018-02-04 18:09:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 18:09:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 18:09:35,632 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 35 [2018-02-04 18:09:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:35,633 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 18:09:35,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:09:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 18:09:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 18:09:35,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:35,633 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-04 18:09:35,634 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1814048103, now seen corresponding path program 1 times [2018-02-04 18:09:35,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:35,634 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:35,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:35,635 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:35,635 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:35,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:35,645 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:35,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:35,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:35,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:35,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:35,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:35,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:35,688 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 18:09:35,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 18:09:35,701 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 11 treesize of output 8 [2018-02-04 18:09:35,704 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 8 treesize of output 7 [2018-02-04 18:09:35,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 18:09:35,717 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-04 18:09:35,718 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 18:09:35,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,724 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 18:09:35,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-02-04 18:09:35,738 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 18:09:35,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:35,741 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 35 treesize of output 46 [2018-02-04 18:09:35,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,752 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 18:09:35,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-02-04 18:09:35,821 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-02-04 18:09:35,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:35,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:35,841 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 3 case distinctions, treesize of input 33 treesize of output 58 [2018-02-04 18:09:35,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:09:35,904 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 7 treesize of output 1 [2018-02-04 18:09:35,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:35,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:09:35,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:09:35,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:133 [2018-02-04 18:09:36,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:36,068 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 18:09:36,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,077 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 18:09:36,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 18:09:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:36,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:09:36,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 18:09:36,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:09:36,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:09:36,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:09:36,111 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 16 states. [2018-02-04 18:09:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:36,772 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 18:09:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:09:36,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-02-04 18:09:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:36,773 INFO L225 Difference]: With dead ends: 90 [2018-02-04 18:09:36,773 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 18:09:36,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:09:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 18:09:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-02-04 18:09:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 18:09:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-04 18:09:36,776 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 36 [2018-02-04 18:09:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:36,776 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-04 18:09:36,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:09:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-04 18:09:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 18:09:36,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:36,777 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-04 18:09:36,777 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1814048102, now seen corresponding path program 1 times [2018-02-04 18:09:36,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:36,777 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:36,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:36,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:36,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:36,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:36,789 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:36,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:36,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:36,790 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:36,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:36,828 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 18:09:36,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,834 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 18:09:36,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:09:36,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:36,863 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 12 treesize of output 15 [2018-02-04 18:09:36,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:36,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:36,874 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 18:09:36,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 18:09:36,904 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 11 treesize of output 8 [2018-02-04 18:09:36,907 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 8 treesize of output 7 [2018-02-04 18:09:36,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,922 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 11 treesize of output 8 [2018-02-04 18:09:36,925 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 8 treesize of output 7 [2018-02-04 18:09:36,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-02-04 18:09:36,967 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-02-04 18:09:36,969 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 18:09:36,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:36,993 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 27 treesize of output 28 [2018-02-04 18:09:36,995 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 18:09:36,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-02-04 18:09:37,036 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 18:09:37,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,050 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 42 treesize of output 55 [2018-02-04 18:09:37,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,073 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 34 treesize of output 37 [2018-02-04 18:09:37,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,077 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 18 treesize of output 35 [2018-02-04 18:09:37,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-02-04 18:09:37,176 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 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 18:09:37,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 33 [2018-02-04 18:09:37,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:09:37,212 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 18:09:37,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:09:37,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-04 18:09:37,244 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:211 [2018-02-04 18:09:37,416 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2018-02-04 18:09:37,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,432 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 54 [2018-02-04 18:09:37,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 18:09:37,479 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 18:09:37,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 18:09:37,614 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2018-02-04 18:09:37,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-02-04 18:09:37,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:09:37,641 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 18:09:37,641 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:09:37,749 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-02-04 18:09:37,771 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 18:09:37,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:37,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:37,793 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 [2018-02-04 18:09:37,794 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:09:37,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:09:37,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-02-04 18:09:37,894 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:238, output treesize:251 [2018-02-04 18:09:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:38,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:09:38,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 18:09:38,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:09:38,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:09:38,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:09:38,012 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 17 states. [2018-02-04 18:09:39,590 WARN L146 SmtUtils]: Spent 411ms on a formula simplification. DAG size of input: 127 DAG size of output 125 [2018-02-04 18:09:39,866 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 118 DAG size of output 105 [2018-02-04 18:09:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:40,153 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-02-04 18:09:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:09:40,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-02-04 18:09:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:40,154 INFO L225 Difference]: With dead ends: 109 [2018-02-04 18:09:40,154 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 18:09:40,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:09:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 18:09:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-02-04 18:09:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 18:09:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-02-04 18:09:40,156 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 36 [2018-02-04 18:09:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:40,156 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-02-04 18:09:40,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:09:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-02-04 18:09:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:09:40,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:40,156 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 18:09:40,157 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1001630551, now seen corresponding path program 1 times [2018-02-04 18:09:40,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:40,157 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:40,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:40,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:40,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:40,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:40,166 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:40,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:40,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:40,167 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:40,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:40,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,190 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 18:09:40,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 18:09:40,196 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 5 treesize of output 1 [2018-02-04 18:09:40,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,200 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 13 treesize of output 10 [2018-02-04 18:09:40,201 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 10 treesize of output 9 [2018-02-04 18:09:40,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,205 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:10 [2018-02-04 18:09:40,239 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 16 [2018-02-04 18:09:40,241 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 16 treesize of output 4 [2018-02-04 18:09:40,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-02-04 18:09:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:40,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:40,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 18:09:40,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:09:40,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:09:40,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:09:40,249 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 9 states. [2018-02-04 18:09:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:40,400 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-02-04 18:09:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:09:40,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-04 18:09:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:40,401 INFO L225 Difference]: With dead ends: 108 [2018-02-04 18:09:40,401 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 18:09:40,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:09:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 18:09:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2018-02-04 18:09:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:09:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-02-04 18:09:40,404 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 37 [2018-02-04 18:09:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:40,404 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-02-04 18:09:40,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:09:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-02-04 18:09:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:09:40,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:40,405 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, 1, 1, 1, 1, 1] [2018-02-04 18:09:40,405 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:40,405 INFO L82 PathProgramCache]: Analyzing trace with hash 993040720, now seen corresponding path program 1 times [2018-02-04 18:09:40,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:40,405 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:40,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:40,406 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:40,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:40,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:40,430 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:40,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:40,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:40,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:40,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:40,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,502 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 17 treesize of output 24 [2018-02-04 18:09:40,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 18:09:40,521 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 13 treesize of output 10 [2018-02-04 18:09:40,523 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 10 treesize of output 9 [2018-02-04 18:09:40,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,530 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 18:09:40,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-02-04 18:09:40,572 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 19 [2018-02-04 18:09:40,575 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 19 treesize of output 10 [2018-02-04 18:09:40,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-02-04 18:09:40,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,591 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 25 [2018-02-04 18:09:40,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,601 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 18:09:40,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 18:09:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:40,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:09:40,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 18:09:40,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:09:40,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:09:40,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:09:40,623 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 13 states. [2018-02-04 18:09:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:40,922 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-04 18:09:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:09:40,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 18:09:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:40,923 INFO L225 Difference]: With dead ends: 108 [2018-02-04 18:09:40,923 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 18:09:40,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:09:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 18:09:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2018-02-04 18:09:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:09:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-02-04 18:09:40,925 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 37 [2018-02-04 18:09:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:40,925 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-02-04 18:09:40,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:09:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-02-04 18:09:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:09:40,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:40,926 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-04 18:09:40,926 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -400917400, now seen corresponding path program 1 times [2018-02-04 18:09:40,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:40,927 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:40,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:40,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:40,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:40,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:40,935 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:40,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:40,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:40,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:40,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:40,961 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 6 treesize of output 5 [2018-02-04 18:09:40,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-04 18:09:40,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:40,981 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 11 treesize of output 12 [2018-02-04 18:09:40,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:40,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-02-04 18:09:41,001 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 11 treesize of output 8 [2018-02-04 18:09:41,003 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 8 treesize of output 7 [2018-02-04 18:09:41,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 18:09:41,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-04 18:09:41,028 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 18:09:41,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,037 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 18:09:41,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-04 18:09:41,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 18:09:41,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:41,054 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 34 treesize of output 45 [2018-02-04 18:09:41,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,065 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 18:09:41,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-02-04 18:09:41,176 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-02-04 18:09:41,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:41,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:41,191 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 57 [2018-02-04 18:09:41,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2018-02-04 18:09:41,226 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 7 treesize of output 1 [2018-02-04 18:09:41,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:09:41,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:09:41,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:58 [2018-02-04 18:09:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:41,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:09:41,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 18:09:41,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:09:41,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:09:41,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:09:41,329 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 17 states. [2018-02-04 18:09:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:41,911 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-04 18:09:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:09:41,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-02-04 18:09:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:41,912 INFO L225 Difference]: With dead ends: 112 [2018-02-04 18:09:41,912 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 18:09:41,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2018-02-04 18:09:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 18:09:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-02-04 18:09:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:09:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-04 18:09:41,913 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 37 [2018-02-04 18:09:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:41,913 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-04 18:09:41,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:09:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-04 18:09:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 18:09:41,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:41,914 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, 1, 1, 1] [2018-02-04 18:09:41,914 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash 456496379, now seen corresponding path program 1 times [2018-02-04 18:09:41,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:41,914 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:41,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:41,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:41,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:41,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:41,924 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:41,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:41,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:41,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:41,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:41,946 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 18:09:41,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,951 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 18:09:41,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:09:41,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:41,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:41,973 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 17 treesize of output 21 [2018-02-04 18:09:41,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,981 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 12 treesize of output 15 [2018-02-04 18:09:41,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:41,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-02-04 18:09:42,009 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 11 treesize of output 8 [2018-02-04 18:09:42,010 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 8 treesize of output 7 [2018-02-04 18:09:42,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,047 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 11 treesize of output 8 [2018-02-04 18:09:42,049 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 8 treesize of output 7 [2018-02-04 18:09:42,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-02-04 18:09:42,081 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-02-04 18:09:42,083 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 18 treesize of output 17 [2018-02-04 18:09:42,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,112 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 50 treesize of output 51 [2018-02-04 18:09:42,115 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 18 treesize of output 17 [2018-02-04 18:09:42,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:81 [2018-02-04 18:09:42,150 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-02-04 18:09:42,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,152 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 61 treesize of output 76 [2018-02-04 18:09:42,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,178 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 57 treesize of output 56 [2018-02-04 18:09:42,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,181 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 48 treesize of output 69 [2018-02-04 18:09:42,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:101 [2018-02-04 18:09:42,289 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 0 case distinctions, treesize of input 60 treesize of output 52 [2018-02-04 18:09:42,291 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 18:09:42,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 52 [2018-02-04 18:09:42,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:09:42,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:09:42,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-02-04 18:09:42,368 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:124, output treesize:263 [2018-02-04 18:09:42,593 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 102 treesize of output 83 [2018-02-04 18:09:42,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,682 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 96 treesize of output 82 [2018-02-04 18:09:42,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 82 [2018-02-04 18:09:42,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,800 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 72 [2018-02-04 18:09:42,807 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 7 treesize of output 1 [2018-02-04 18:09:42,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-02-04 18:09:42,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:09:42,873 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:09:42,920 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-02-04 18:09:42,923 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 7 treesize of output 1 [2018-02-04 18:09:42,923 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:42,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:42,949 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 54 [2018-02-04 18:09:42,950 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 18:09:42,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 18:09:43,089 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-02-04 18:09:43,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:43,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:43,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:43,100 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-02-04 18:09:43,101 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:09:43,125 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 7 treesize of output 1 [2018-02-04 18:09:43,125 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:43,140 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:09:43,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-02-04 18:09:43,229 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:305, output treesize:249 [2018-02-04 18:09:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:09:43,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:09:43,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:09:43,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:09:43,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:09:43,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:09:43,399 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 19 states. [2018-02-04 18:09:58,395 WARN L146 SmtUtils]: Spent 14143ms on a formula simplification. DAG size of input: 148 DAG size of output 144 [2018-02-04 18:09:59,164 WARN L146 SmtUtils]: Spent 601ms on a formula simplification. DAG size of input: 135 DAG size of output 122 [2018-02-04 18:09:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:09:59,537 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-02-04 18:09:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:09:59,537 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-02-04 18:09:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:09:59,538 INFO L225 Difference]: With dead ends: 127 [2018-02-04 18:09:59,538 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 18:09:59,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 18:09:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 18:09:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2018-02-04 18:09:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 18:09:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-02-04 18:09:59,540 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 38 [2018-02-04 18:09:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:09:59,540 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-02-04 18:09:59,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:09:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-02-04 18:09:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 18:09:59,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:09:59,541 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-04 18:09:59,541 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:09:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -58648115, now seen corresponding path program 1 times [2018-02-04 18:09:59,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:09:59,541 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:09:59,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:59,542 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:59,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:09:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:59,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:09:59,560 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:09:59,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:09:59,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:09:59,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:09:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:09:59,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:09:59,596 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 18:09:59,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:09:59,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:59,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:59,619 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 17 treesize of output 21 [2018-02-04 18:09:59,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 18:09:59,638 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 11 treesize of output 8 [2018-02-04 18:09:59,639 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 8 treesize of output 7 [2018-02-04 18:09:59,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 18:09:59,661 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-04 18:09:59,663 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 18:09:59,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,675 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 18:09:59,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-04 18:09:59,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:59,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:59,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:59,696 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 26 treesize of output 46 [2018-02-04 18:09:59,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,711 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 18:09:59,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:60 [2018-02-04 18:09:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-02-04 18:09:59,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:09:59,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-02-04 18:09:59,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,769 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 18:09:59,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:84 [2018-02-04 18:09:59,966 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 0 case distinctions, treesize of input 104 treesize of output 80 [2018-02-04 18:09:59,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 33 [2018-02-04 18:09:59,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,982 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 7 treesize of output 1 [2018-02-04 18:09:59,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:09:59,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 80 [2018-02-04 18:10:00,014 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 7 treesize of output 1 [2018-02-04 18:10:00,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 [2018-02-04 18:10:00,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:00,050 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:209, output treesize:79 [2018-02-04 18:10:00,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:00,084 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 45 treesize of output 45 [2018-02-04 18:10:00,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:00,109 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 0 case distinctions, treesize of input 45 treesize of output 45 [2018-02-04 18:10:00,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:10:00,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:63 [2018-02-04 18:10:00,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:00,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:00,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:00,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-04 18:10:00,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:00,165 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 18:10:00,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-04 18:10:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:10:00,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:10:00,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:10:00,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:10:00,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:10:00,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:10:00,189 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 19 states. [2018-02-04 18:10:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:10:07,327 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-04 18:10:07,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 18:10:07,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-02-04 18:10:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:10:07,328 INFO L225 Difference]: With dead ends: 126 [2018-02-04 18:10:07,328 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 18:10:07,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 18:10:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 18:10:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2018-02-04 18:10:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 18:10:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-02-04 18:10:07,331 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 40 [2018-02-04 18:10:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:10:07,331 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-02-04 18:10:07,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:10:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-02-04 18:10:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 18:10:07,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:10:07,332 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-04 18:10:07,332 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:10:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash -58648114, now seen corresponding path program 1 times [2018-02-04 18:10:07,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:10:07,332 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:10:07,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:07,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:07,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:07,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:10:07,345 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:10:07,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:10:07,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:10:07,346 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:07,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:10:07,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,400 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 18:10:07,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 18:10:07,419 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 11 treesize of output 8 [2018-02-04 18:10:07,420 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 8 treesize of output 7 [2018-02-04 18:10:07,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,430 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 11 treesize of output 8 [2018-02-04 18:10:07,432 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 8 treesize of output 7 [2018-02-04 18:10:07,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-02-04 18:10:07,458 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-02-04 18:10:07,461 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 18:10:07,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,484 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 27 treesize of output 28 [2018-02-04 18:10:07,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 18:10:07,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2018-02-04 18:10:07,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,526 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 16 treesize of output 33 [2018-02-04 18:10:07,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,545 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 18:10:07,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:55 [2018-02-04 18:10:07,584 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 18:10:07,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,589 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 42 treesize of output 63 [2018-02-04 18:10:07,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,617 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 32 treesize of output 35 [2018-02-04 18:10:07,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,620 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 16 treesize of output 23 [2018-02-04 18:10:07,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:61 [2018-02-04 18:10:07,692 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-02-04 18:10:07,703 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 18:10:07,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:07,720 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 2 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 18:10:07,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:07,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:07,777 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 0 case distinctions, treesize of input 46 treesize of output 44 [2018-02-04 18:10:07,779 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 11 treesize of output 4 [2018-02-04 18:10:07,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,787 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 18:10:07,787 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,808 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 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 18:10:07,809 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 18:10:07,809 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,820 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 1 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:10:07,820 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 18:10:07,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:07,828 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 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:10:07,830 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 18:10:07,830 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,853 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 11 treesize of output 4 [2018-02-04 18:10:07,853 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,858 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:07,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 18:10:07,888 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:84, output treesize:93 [2018-02-04 18:10:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:10:07,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:10:07,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 18:10:07,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:10:07,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:10:07,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:10:07,977 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 17 states. [2018-02-04 18:10:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:10:08,613 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2018-02-04 18:10:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:10:08,614 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-04 18:10:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:10:08,614 INFO L225 Difference]: With dead ends: 143 [2018-02-04 18:10:08,614 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 18:10:08,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 18:10:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 18:10:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2018-02-04 18:10:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 18:10:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2018-02-04 18:10:08,616 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 40 [2018-02-04 18:10:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:10:08,616 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2018-02-04 18:10:08,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:10:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2018-02-04 18:10:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 18:10:08,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:10:08,617 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:10:08,617 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:10:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1818092620, now seen corresponding path program 1 times [2018-02-04 18:10:08,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:10:08,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:10:08,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:08,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:08,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:08,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:10:08,623 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:10:08,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:10:08,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:10:08,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:08,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:10:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:08,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:08,655 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-02-04 18:10:08,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-02-04 18:10:08,669 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 11 treesize of output 8 [2018-02-04 18:10:08,671 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 8 treesize of output 7 [2018-02-04 18:10:08,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 18:10:08,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-04 18:10:08,710 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 18:10:08,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,722 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 18:10:08,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-04 18:10:08,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 18:10:08,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:08,748 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 34 treesize of output 45 [2018-02-04 18:10:08,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,763 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 18:10:08,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-02-04 18:10:08,803 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-02-04 18:10:08,805 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 7 treesize of output 1 [2018-02-04 18:10:08,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:08,813 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 18 treesize of output 17 [2018-02-04 18:10:08,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:10:08,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:08,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:08,825 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:16 [2018-02-04 18:10:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:10:08,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:10:08,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 18:10:08,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:10:08,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:10:08,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:10:08,862 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand 15 states. [2018-02-04 18:10:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:10:09,271 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-02-04 18:10:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:10:09,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-04 18:10:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:10:09,272 INFO L225 Difference]: With dead ends: 140 [2018-02-04 18:10:09,272 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 18:10:09,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-02-04 18:10:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 18:10:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2018-02-04 18:10:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 18:10:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2018-02-04 18:10:09,274 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 41 [2018-02-04 18:10:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:10:09,274 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2018-02-04 18:10:09,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:10:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2018-02-04 18:10:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 18:10:09,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:10:09,274 INFO L351 BasicCegarLoop]: trace histogram [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 18:10:09,274 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:10:09,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1617180596, now seen corresponding path program 1 times [2018-02-04 18:10:09,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:10:09,274 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:10:09,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:09,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:09,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:09,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:10:09,288 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:10:09,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:10:09,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:10:09,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:09,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:10:09,318 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 18:10:09,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:10:09,326 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 13 treesize of output 10 [2018-02-04 18:10:09,328 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 10 treesize of output 9 [2018-02-04 18:10:09,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 18:10:09,342 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 13 treesize of output 10 [2018-02-04 18:10:09,344 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 10 treesize of output 9 [2018-02-04 18:10:09,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,355 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 18:10:09,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,359 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 29 [2018-02-04 18:10:09,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-02-04 18:10:09,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,394 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 18:10:09,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-02-04 18:10:09,450 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 21 treesize of output 22 [2018-02-04 18:10:09,452 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 8 treesize of output 7 [2018-02-04 18:10:09,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,472 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 32 treesize of output 41 [2018-02-04 18:10:09,474 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 8 treesize of output 7 [2018-02-04 18:10:09,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:59 [2018-02-04 18:10:09,513 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 110 [2018-02-04 18:10:09,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,516 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 34 treesize of output 73 [2018-02-04 18:10:09,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,540 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 104 treesize of output 93 [2018-02-04 18:10:09,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 47 treesize of output 57 [2018-02-04 18:10:09,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:90 [2018-02-04 18:10:09,579 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-02-04 18:10:09,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,588 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 85 treesize of output 102 [2018-02-04 18:10:09,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,612 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 94 treesize of output 89 [2018-02-04 18:10:09,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,615 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 81 treesize of output 96 [2018-02-04 18:10:09,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:110 [2018-02-04 18:10:09,912 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:10:09,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 102 [2018-02-04 18:10:09,916 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:10:09,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-02-04 18:10:09,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,929 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:10:09,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-02-04 18:10:09,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,961 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 0 case distinctions, treesize of input 60 treesize of output 48 [2018-02-04 18:10:09,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,964 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:10:09,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-02-04 18:10:09,966 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:09,973 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 24 treesize of output 14 [2018-02-04 18:10:09,974 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:09,981 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:163, output treesize:9 [2018-02-04 18:10:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:10:10,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:10:10,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 18:10:10,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:10:10,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:10:10,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=371, Unknown=3, NotChecked=0, Total=420 [2018-02-04 18:10:10,011 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand 21 states. [2018-02-04 18:10:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:10:50,750 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-02-04 18:10:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:10:50,751 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-02-04 18:10:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:10:50,751 INFO L225 Difference]: With dead ends: 140 [2018-02-04 18:10:50,751 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 18:10:50,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=1511, Unknown=5, NotChecked=0, Total=1722 [2018-02-04 18:10:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 18:10:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2018-02-04 18:10:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 18:10:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-02-04 18:10:50,754 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 41 [2018-02-04 18:10:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:10:50,754 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-02-04 18:10:50,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:10:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-02-04 18:10:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 18:10:50,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:10:50,755 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:10:50,755 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:10:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash -526262481, now seen corresponding path program 1 times [2018-02-04 18:10:50,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:10:50,756 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:10:50,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:50,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:50,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:50,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:10:50,768 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:10:50,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:10:50,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:10:50,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:50,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:10:50,800 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 18:10:50,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:10:50,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:50,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:50,834 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 17 treesize of output 21 [2018-02-04 18:10:50,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,846 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 12 treesize of output 15 [2018-02-04 18:10:50,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-02-04 18:10:50,887 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 11 treesize of output 8 [2018-02-04 18:10:50,890 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 8 treesize of output 7 [2018-02-04 18:10:50,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,904 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 11 treesize of output 8 [2018-02-04 18:10:50,906 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 8 treesize of output 7 [2018-02-04 18:10:50,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-02-04 18:10:50,965 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 58 treesize of output 59 [2018-02-04 18:10:50,968 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 18 treesize of output 17 [2018-02-04 18:10:50,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:50,996 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-02-04 18:10:51,003 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 18 treesize of output 17 [2018-02-04 18:10:51,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:81 [2018-02-04 18:10:51,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,054 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 20 treesize of output 21 [2018-02-04 18:10:51,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,070 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 0 case distinctions, treesize of input 21 treesize of output 46 [2018-02-04 18:10:51,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:72 [2018-02-04 18:10:51,111 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 55 treesize of output 54 [2018-02-04 18:10:51,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,115 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 46 treesize of output 57 [2018-02-04 18:10:51,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,146 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-02-04 18:10:51,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,150 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 54 treesize of output 75 [2018-02-04 18:10:51,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:83 [2018-02-04 18:10:51,259 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2018-02-04 18:10:51,261 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 1 [2018-02-04 18:10:51,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:51,290 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 2 case distinctions, treesize of input 43 treesize of output 56 [2018-02-04 18:10:51,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:51,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:51,346 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 0 case distinctions, treesize of input 52 treesize of output 44 [2018-02-04 18:10:51,348 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-02-04 18:10:51,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:10:51,356 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 7 treesize of output 1 [2018-02-04 18:10:51,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,363 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 0 case distinctions, treesize of input 48 treesize of output 40 [2018-02-04 18:10:51,365 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 18:10:51,365 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2018-02-04 18:10:51,376 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 18:10:51,381 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:51,383 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 0 case distinctions, treesize of input 46 treesize of output 38 [2018-02-04 18:10:51,385 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 18:10:51,385 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,397 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2018-02-04 18:10:51,397 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,401 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 18:10:51,430 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:106, output treesize:149 [2018-02-04 18:10:51,515 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 36 treesize of output 26 [2018-02-04 18:10:51,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,526 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 28 treesize of output 23 [2018-02-04 18:10:51,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:51,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 18:10:51,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:70, output treesize:50 [2018-02-04 18:10:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:10:51,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:10:51,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:10:51,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:10:51,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:10:51,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:10:51,648 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 20 states. [2018-02-04 18:10:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:10:54,836 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-02-04 18:10:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:10:54,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-02-04 18:10:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:10:54,837 INFO L225 Difference]: With dead ends: 187 [2018-02-04 18:10:54,837 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 18:10:54,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=1157, Unknown=1, NotChecked=0, Total=1332 [2018-02-04 18:10:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 18:10:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 127. [2018-02-04 18:10:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 18:10:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2018-02-04 18:10:54,839 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 42 [2018-02-04 18:10:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:10:54,839 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2018-02-04 18:10:54,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:10:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2018-02-04 18:10:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 18:10:54,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:10:54,840 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-04 18:10:54,840 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:10:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash -659016960, now seen corresponding path program 2 times [2018-02-04 18:10:54,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:10:54,840 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:10:54,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:54,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:10:54,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:10:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:10:54,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:10:54,848 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:10:54,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:10:54,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:10:54,848 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:10:54,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:10:54,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:10:54,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:10:54,869 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 18:10:54,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:10:54,881 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 11 treesize of output 8 [2018-02-04 18:10:54,882 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 8 treesize of output 7 [2018-02-04 18:10:54,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,892 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 11 treesize of output 8 [2018-02-04 18:10:54,893 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 8 treesize of output 7 [2018-02-04 18:10:54,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 18:10:54,911 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 21 treesize of output 16 [2018-02-04 18:10:54,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,913 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 16 treesize of output 23 [2018-02-04 18:10:54,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,929 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 21 treesize of output 16 [2018-02-04 18:10:54,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,931 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 16 treesize of output 23 [2018-02-04 18:10:54,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-02-04 18:10:54,964 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 30 treesize of output 23 [2018-02-04 18:10:54,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,971 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 23 treesize of output 46 [2018-02-04 18:10:54,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:54,994 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 32 treesize of output 25 [2018-02-04 18:10:54,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:54,998 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 0 case distinctions, treesize of input 25 treesize of output 60 [2018-02-04 18:10:54,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2018-02-04 18:10:55,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,045 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 18:10:55,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,058 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 18:10:55,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:66 [2018-02-04 18:10:55,094 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 37 treesize of output 38 [2018-02-04 18:10:55,096 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 8 treesize of output 7 [2018-02-04 18:10:55,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,118 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 39 treesize of output 52 [2018-02-04 18:10:55,120 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 8 treesize of output 7 [2018-02-04 18:10:55,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:10:55,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:92 [2018-02-04 18:10:55,164 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 117 [2018-02-04 18:10:55,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,188 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 42 treesize of output 121 [2018-02-04 18:10:55,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:55,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:10:55,315 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 132 treesize of output 107 [2018-02-04 18:10:55,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,320 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:10:55,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,322 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 40 treesize of output 117 [2018-02-04 18:10:55,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,343 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 136 treesize of output 111 [2018-02-04 18:10:55,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,347 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:10:55,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,352 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 40 treesize of output 115 [2018-02-04 18:10:55,352 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,376 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 138 treesize of output 113 [2018-02-04 18:10:55,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,395 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 2 case distinctions, treesize of input 40 treesize of output 125 [2018-02-04 18:10:55,395 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 18:10:55,437 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:55,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:55,494 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:152, output treesize:389 [2018-02-04 18:10:55,591 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 139 [2018-02-04 18:10:55,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,609 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 111 treesize of output 132 [2018-02-04 18:10:55,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,739 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 149 treesize of output 130 [2018-02-04 18:10:55,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,743 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 109 treesize of output 130 [2018-02-04 18:10:55,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,853 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 127 [2018-02-04 18:10:55,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:55,880 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 103 treesize of output 122 [2018-02-04 18:10:55,881 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:55,903 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,037 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 164 treesize of output 155 [2018-02-04 18:10:56,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:56,043 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 48 treesize of output 59 [2018-02-04 18:10:56,043 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,075 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,194 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 134 [2018-02-04 18:10:56,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:56,199 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 113 treesize of output 138 [2018-02-04 18:10:56,199 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,227 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,329 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 155 treesize of output 134 [2018-02-04 18:10:56,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:56,334 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 117 treesize of output 140 [2018-02-04 18:10:56,334 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,351 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:56,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:56,416 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:473, output treesize:449 [2018-02-04 18:10:57,119 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 0 case distinctions, treesize of input 173 treesize of output 137 [2018-02-04 18:10:57,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,135 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 79 [2018-02-04 18:10:57,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:57,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,192 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 74 treesize of output 61 [2018-02-04 18:10:57,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:10:57,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 68 [2018-02-04 18:10:57,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:10:57,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,196 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-02-04 18:10:57,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:57,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:57,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,346 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 132 [2018-02-04 18:10:57,348 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 64 treesize of output 49 [2018-02-04 18:10:57,349 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:10:57,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 85 [2018-02-04 18:10:57,382 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:57,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:57,595 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 0 case distinctions, treesize of input 178 treesize of output 140 [2018-02-04 18:10:57,600 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 35 treesize of output 24 [2018-02-04 18:10:57,601 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:10:57,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 81 [2018-02-04 18:10:57,649 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:57,706 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:57,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,935 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2018-02-04 18:10:57,956 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 18:10:57,957 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:57,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:57,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 85 [2018-02-04 18:10:57,995 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-02-04 18:10:58,071 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:10:58,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,073 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 90 [2018-02-04 18:10:58,082 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 18:10:58,082 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:58,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 77 [2018-02-04 18:10:58,122 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:58,181 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:10:58,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,183 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2018-02-04 18:10:58,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,224 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 129 [2018-02-04 18:10:58,224 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:10:58,231 INFO L267 ElimStorePlain]: Start of recursive call 20: 26 dim-0 vars, End of recursive call: 26 dim-0 vars, and 28 xjuncts. [2018-02-04 18:10:58,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 0 case distinctions, treesize of input 23 treesize of output 16 [2018-02-04 18:10:58,349 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:58,350 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 28 treesize of output 21 [2018-02-04 18:10:58,351 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:58,366 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:10:58,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,741 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 0 case distinctions, treesize of input 93 treesize of output 77 [2018-02-04 18:10:58,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,766 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 107 [2018-02-04 18:10:58,768 INFO L267 ElimStorePlain]: Start of recursive call 24: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-04 18:10:58,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-04 18:10:58,810 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:58,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,816 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 33 treesize of output 24 [2018-02-04 18:10:58,817 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 3 xjuncts. [2018-02-04 18:10:58,837 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:10:58,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,839 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 0 case distinctions, treesize of input 100 treesize of output 82 [2018-02-04 18:10:58,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,860 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 103 [2018-02-04 18:10:58,861 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-04 18:10:58,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-04 18:10:58,888 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-02-04 18:10:58,904 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:10:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,907 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 0 case distinctions, treesize of input 85 treesize of output 71 [2018-02-04 18:10:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,915 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 58 [2018-02-04 18:10:58,917 INFO L267 ElimStorePlain]: Start of recursive call 31: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:58,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 91 [2018-02-04 18:10:58,979 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-02-04 18:10:58,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:58,994 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2018-02-04 18:10:58,994 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-02-04 18:10:59,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 91 [2018-02-04 18:10:59,023 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 8 xjuncts. [2018-02-04 18:10:59,189 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:10:59,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,606 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 68 [2018-02-04 18:10:59,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,634 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 95 [2018-02-04 18:10:59,634 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:10:59,644 INFO L267 ElimStorePlain]: Start of recursive call 36: 52 dim-0 vars, End of recursive call: 52 dim-0 vars, and 56 xjuncts. [2018-02-04 18:10:59,840 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 27 treesize of output 20 [2018-02-04 18:10:59,841 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:59,842 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 25 treesize of output 18 [2018-02-04 18:10:59,842 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:59,843 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 28 treesize of output 21 [2018-02-04 18:10:59,844 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:59,861 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:10:59,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,863 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 75 [2018-02-04 18:10:59,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,893 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 87 [2018-02-04 18:10:59,897 INFO L267 ElimStorePlain]: Start of recursive call 41: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 14 xjuncts. [2018-02-04 18:10:59,947 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 12 treesize of output 4 [2018-02-04 18:10:59,948 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 18:10:59,953 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:10:59,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,955 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 73 [2018-02-04 18:10:59,962 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 18:10:59,963 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:10:59,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:10:59,988 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 51 [2018-02-04 18:10:59,989 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:00,007 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:00,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 20 xjuncts. [2018-02-04 18:11:00,374 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 13 variables, input treesize:515, output treesize:382 [2018-02-04 18:11:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:00,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:00,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 18:11:00,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:11:00,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:11:00,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=409, Unknown=2, NotChecked=0, Total=462 [2018-02-04 18:11:00,540 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand 22 states. [2018-02-04 18:11:01,738 WARN L143 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 140 [2018-02-04 18:11:02,557 WARN L143 SmtUtils]: Spent 371ms on a formula simplification that was a NOOP. DAG size: 242 [2018-02-04 18:11:03,100 WARN L143 SmtUtils]: Spent 255ms on a formula simplification that was a NOOP. DAG size: 185 [2018-02-04 18:11:03,911 WARN L146 SmtUtils]: Spent 564ms on a formula simplification. DAG size of input: 269 DAG size of output 267 [2018-02-04 18:11:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:04,213 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2018-02-04 18:11:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:11:04,214 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 18:11:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:04,214 INFO L225 Difference]: With dead ends: 139 [2018-02-04 18:11:04,214 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 18:11:04,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=189, Invalid=1369, Unknown=2, NotChecked=0, Total=1560 [2018-02-04 18:11:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 18:11:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-02-04 18:11:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 18:11:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2018-02-04 18:11:04,217 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 43 [2018-02-04 18:11:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:04,217 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2018-02-04 18:11:04,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:11:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-02-04 18:11:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 18:11:04,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:04,218 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 18:11:04,218 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:04,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1045309665, now seen corresponding path program 2 times [2018-02-04 18:11:04,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:04,218 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:04,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:04,219 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:11:04,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:04,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:04,230 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:04,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:04,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:04,231 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:11:04,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:11:04,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:11:04,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:04,306 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 11 treesize of output 8 [2018-02-04 18:11:04,307 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 8 treesize of output 7 [2018-02-04 18:11:04,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-04 18:11:04,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:04,340 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 18:11:04,342 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 18:11:04,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,358 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 18:11:04,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-02-04 18:11:04,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:04,383 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-02-04 18:11:04,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:04,385 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 56 treesize of output 71 [2018-02-04 18:11:04,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,403 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 18:11:04,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:57 [2018-02-04 18:11:04,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:04,528 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 0 case distinctions, treesize of input 71 treesize of output 61 [2018-02-04 18:11:04,530 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 47 treesize of output 33 [2018-02-04 18:11:04,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,540 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 7 treesize of output 1 [2018-02-04 18:11:04,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:04,564 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 0 case distinctions, treesize of input 71 treesize of output 61 [2018-02-04 18:11:04,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-02-04 18:11:04,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,574 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 7 treesize of output 1 [2018-02-04 18:11:04,574 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:04,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:04,593 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:143, output treesize:61 [2018-02-04 18:11:04,819 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_prenex_183 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (= 0 (select .cse0 v_prenex_183)) (= |c_#valid| (store (store .cse0 v_prenex_183 0) main_~y~0.base 0)) (not (= main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0) (not (= v_prenex_183 0))))) is different from true [2018-02-04 18:11:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-02-04 18:11:04,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:04,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:11:04,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:11:04,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:11:04,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=256, Unknown=10, NotChecked=32, Total=342 [2018-02-04 18:11:04,836 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 19 states. [2018-02-04 18:11:13,126 WARN L146 SmtUtils]: Spent 8028ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-02-04 18:11:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:13,633 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-02-04 18:11:13,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:11:13,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-02-04 18:11:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:13,634 INFO L225 Difference]: With dead ends: 133 [2018-02-04 18:11:13,634 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 18:11:13,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=120, Invalid=743, Unknown=11, NotChecked=56, Total=930 [2018-02-04 18:11:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 18:11:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-02-04 18:11:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 18:11:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-04 18:11:13,637 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 44 [2018-02-04 18:11:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:13,637 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-04 18:11:13,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:11:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-04 18:11:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 18:11:13,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:13,637 INFO L351 BasicCegarLoop]: trace histogram [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 18:11:13,637 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1254928128, now seen corresponding path program 1 times [2018-02-04 18:11:13,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:13,638 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:13,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:13,638 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:11:13,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:13,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:13,650 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:13,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:13,650 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:13,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:13,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:13,674 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 18:11:13,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:11:13,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 13 treesize of output 10 [2018-02-04 18:11:13,686 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 10 treesize of output 9 [2018-02-04 18:11:13,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 18:11:13,700 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 18:11:13,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,703 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 20 treesize of output 41 [2018-02-04 18:11:13,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,735 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 13 treesize of output 10 [2018-02-04 18:11:13,736 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 10 treesize of output 9 [2018-02-04 18:11:13,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-02-04 18:11:13,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,764 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 18:11:13,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-02-04 18:11:13,815 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 26 treesize of output 27 [2018-02-04 18:11:13,817 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 8 treesize of output 7 [2018-02-04 18:11:13,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,847 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 19 treesize of output 20 [2018-02-04 18:11:13,849 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 8 treesize of output 7 [2018-02-04 18:11:13,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 18:11:13,884 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 49 treesize of output 38 [2018-02-04 18:11:13,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,887 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 23 treesize of output 35 [2018-02-04 18:11:13,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,906 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-02-04 18:11:13,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,908 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 22 treesize of output 39 [2018-02-04 18:11:13,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:67 [2018-02-04 18:11:13,939 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 18:11:13,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:67 [2018-02-04 18:11:13,952 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 43 treesize of output 46 [2018-02-04 18:11:13,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,955 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 16 treesize of output 23 [2018-02-04 18:11:13,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,974 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-02-04 18:11:13,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:13,977 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 55 treesize of output 72 [2018-02-04 18:11:13,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:13,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:67 [2018-02-04 18:11:14,161 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:14,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2018-02-04 18:11:14,164 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:14,164 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 42 treesize of output 27 [2018-02-04 18:11:14,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,171 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:14,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:14,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 18:11:14,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,188 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 0 case distinctions, treesize of input 38 treesize of output 32 [2018-02-04 18:11:14,189 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:14,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:14,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 18:11:14,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,195 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 18:11:14,195 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:14,208 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:108, output treesize:12 [2018-02-04 18:11:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:14,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:14,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:11:14,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:11:14,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:11:14,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=296, Unknown=5, NotChecked=0, Total=342 [2018-02-04 18:11:14,238 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 19 states. [2018-02-04 18:11:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:15,310 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-02-04 18:11:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:11:15,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-02-04 18:11:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:15,310 INFO L225 Difference]: With dead ends: 119 [2018-02-04 18:11:15,310 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 18:11:15,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1226, Unknown=9, NotChecked=0, Total=1406 [2018-02-04 18:11:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 18:11:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-04 18:11:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 18:11:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-02-04 18:11:15,312 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 45 [2018-02-04 18:11:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:15,312 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-02-04 18:11:15,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:11:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-02-04 18:11:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 18:11:15,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:15,313 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:11:15,313 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash 908470604, now seen corresponding path program 1 times [2018-02-04 18:11:15,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:15,313 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:15,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:15,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:15,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:15,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:15,320 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:15,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:15,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:15,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:15,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:15,369 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 18:11:15,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:11:15,384 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 11 treesize of output 8 [2018-02-04 18:11:15,386 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 8 treesize of output 7 [2018-02-04 18:11:15,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,396 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 11 treesize of output 8 [2018-02-04 18:11:15,398 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 8 treesize of output 7 [2018-02-04 18:11:15,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-02-04 18:11:15,418 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 21 treesize of output 16 [2018-02-04 18:11:15,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,422 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 16 treesize of output 23 [2018-02-04 18:11:15,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,440 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 21 treesize of output 16 [2018-02-04 18:11:15,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,443 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 16 treesize of output 23 [2018-02-04 18:11:15,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-04 18:11:15,476 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 30 treesize of output 23 [2018-02-04 18:11:15,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,484 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 23 treesize of output 46 [2018-02-04 18:11:15,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,505 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 32 treesize of output 25 [2018-02-04 18:11:15,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,509 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 0 case distinctions, treesize of input 25 treesize of output 58 [2018-02-04 18:11:15,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-04 18:11:15,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,553 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 18:11:15,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:50 [2018-02-04 18:11:15,590 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 33 treesize of output 34 [2018-02-04 18:11:15,591 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 8 treesize of output 7 [2018-02-04 18:11:15,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,611 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 33 treesize of output 46 [2018-02-04 18:11:15,612 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 8 treesize of output 7 [2018-02-04 18:11:15,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:79 [2018-02-04 18:11:15,652 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 91 treesize of output 74 [2018-02-04 18:11:15,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,666 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 34 treesize of output 81 [2018-02-04 18:11:15,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:11:15,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:11:15,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2018-02-04 18:11:15,738 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:15,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 77 [2018-02-04 18:11:15,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,755 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2018-02-04 18:11:15,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,757 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:15,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,760 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 38 treesize of output 85 [2018-02-04 18:11:15,760 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,770 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,774 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 106 [2018-02-04 18:11:15,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,788 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 38 treesize of output 93 [2018-02-04 18:11:15,788 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 18:11:15,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:11:15,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:11:15,863 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:139, output treesize:326 [2018-02-04 18:11:15,919 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 107 [2018-02-04 18:11:15,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:15,923 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 85 treesize of output 106 [2018-02-04 18:11:15,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:15,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,019 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 123 treesize of output 114 [2018-02-04 18:11:16,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:16,022 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 46 treesize of output 57 [2018-02-04 18:11:16,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,117 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 123 [2018-02-04 18:11:16,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:16,120 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 103 treesize of output 128 [2018-02-04 18:11:16,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,228 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 105 [2018-02-04 18:11:16,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:16,231 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 83 treesize of output 102 [2018-02-04 18:11:16,231 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,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 119 treesize of output 110 [2018-02-04 18:11:16,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:16,326 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 46 treesize of output 57 [2018-02-04 18:11:16,326 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,341 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,408 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 145 treesize of output 136 [2018-02-04 18:11:16,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:16,411 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 46 treesize of output 57 [2018-02-04 18:11:16,411 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,429 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:16,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:11:16,485 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:400, output treesize:322 [2018-02-04 18:11:16,896 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:11:16,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,035 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 112 treesize of output 111 [2018-02-04 18:11:17,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,152 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 138 treesize of output 137 [2018-02-04 18:11:17,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-02-04 18:11:17,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 6 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:17,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 30 variables, input treesize:1180, output treesize:364 [2018-02-04 18:11:17,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,435 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 145 treesize of output 146 [2018-02-04 18:11:17,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,522 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 167 treesize of output 168 [2018-02-04 18:11:17,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,599 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 141 treesize of output 142 [2018-02-04 18:11:17,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,671 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 127 treesize of output 128 [2018-02-04 18:11:17,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,686 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,705 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 90 [2018-02-04 18:11:17,706 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-04 18:11:17,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-04 18:11:17,748 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 24 treesize of output 15 [2018-02-04 18:11:17,748 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,749 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-02-04 18:11:17,749 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:17,862 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 129 [2018-02-04 18:11:17,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:17,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 81 [2018-02-04 18:11:17,886 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-02-04 18:11:17,966 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2018-02-04 18:11:17,967 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:11:17,968 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,969 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 85 treesize of output 73 [2018-02-04 18:11:17,969 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:17,970 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2018-02-04 18:11:17,971 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:11:17,972 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:17,973 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-02-04 18:11:17,973 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:11:18,038 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-04 18:11:18,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2018-02-04 18:11:18,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,226 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,240 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 102 [2018-02-04 18:11:18,242 INFO L267 ElimStorePlain]: Start of recursive call 16: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-02-04 18:11:18,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-04 18:11:18,283 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,291 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2018-02-04 18:11:18,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,307 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,326 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 110 [2018-02-04 18:11:18,327 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-04 18:11:18,330 INFO L267 ElimStorePlain]: Start of recursive call 19: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 13 xjuncts. [2018-02-04 18:11:18,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-04 18:11:18,387 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-02-04 18:11:18,389 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,402 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:18,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2018-02-04 18:11:18,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,417 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,433 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 106 [2018-02-04 18:11:18,433 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:11:18,436 INFO L267 ElimStorePlain]: Start of recursive call 23: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 14 xjuncts. [2018-02-04 18:11:18,494 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 40 treesize of output 34 [2018-02-04 18:11:18,494 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-04 18:11:18,496 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,509 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2018-02-04 18:11:18,516 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2018-02-04 18:11:18,517 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 18:11:18,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,548 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 51 [2018-02-04 18:11:18,550 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:18,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,563 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 101 [2018-02-04 18:11:18,578 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:11:18,580 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 14 xjuncts. [2018-02-04 18:11:18,717 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:18,846 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 115 [2018-02-04 18:11:18,851 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:18,851 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 63 treesize of output 52 [2018-02-04 18:11:18,852 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:18,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:18,881 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 93 [2018-02-04 18:11:18,882 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:11:18,959 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-02-04 18:11:19,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2018-02-04 18:11:19,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,176 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,180 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 1 case distinctions, treesize of input 25 treesize of output 44 [2018-02-04 18:11:19,181 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:19,206 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 14 treesize of output 4 [2018-02-04 18:11:19,206 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,218 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:19,220 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 0 case distinctions, treesize of input 82 treesize of output 68 [2018-02-04 18:11:19,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,226 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,228 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 1 case distinctions, treesize of input 25 treesize of output 44 [2018-02-04 18:11:19,228 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:19,255 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 14 treesize of output 4 [2018-02-04 18:11:19,256 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,268 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:19,270 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 0 case distinctions, treesize of input 83 treesize of output 69 [2018-02-04 18:11:19,272 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 23 treesize of output 10 [2018-02-04 18:11:19,272 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,291 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,291 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 21 treesize of output 20 [2018-02-04 18:11:19,292 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,301 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,303 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 0 case distinctions, treesize of input 74 treesize of output 60 [2018-02-04 18:11:19,304 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 23 treesize of output 10 [2018-02-04 18:11:19,304 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,324 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,328 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2018-02-04 18:11:19,328 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-02-04 18:11:19,349 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:11:19,351 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 0 case distinctions, treesize of input 76 treesize of output 64 [2018-02-04 18:11:19,352 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 5 [2018-02-04 18:11:19,352 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,369 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,371 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 1 case distinctions, treesize of input 21 treesize of output 24 [2018-02-04 18:11:19,371 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:19,390 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:19,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,561 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-02-04 18:11:19,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 18:11:19,568 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,580 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 6 treesize of output 4 [2018-02-04 18:11:19,580 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,587 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,590 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-02-04 18:11:19,593 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:19,593 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 20 treesize of output 8 [2018-02-04 18:11:19,594 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:19,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:19,615 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2018-02-04 18:11:19,615 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 4 xjuncts. [2018-02-04 18:11:19,643 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:11:19,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-02-04 18:11:19,798 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 21 variables, input treesize:454, output treesize:141 [2018-02-04 18:11:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:19,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:19,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 18:11:19,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:11:19,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:11:19,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:11:19,938 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 21 states. [2018-02-04 18:11:21,379 WARN L143 SmtUtils]: Spent 209ms on a formula simplification that was a NOOP. DAG size: 306 [2018-02-04 18:11:22,145 WARN L146 SmtUtils]: Spent 469ms on a formula simplification. DAG size of input: 314 DAG size of output 280 [2018-02-04 18:11:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:22,405 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-02-04 18:11:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:11:22,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-02-04 18:11:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:22,405 INFO L225 Difference]: With dead ends: 119 [2018-02-04 18:11:22,405 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 18:11:22,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=177, Invalid=1302, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 18:11:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 18:11:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-02-04 18:11:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 18:11:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-02-04 18:11:22,408 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 47 [2018-02-04 18:11:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:22,408 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-02-04 18:11:22,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:11:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-02-04 18:11:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 18:11:22,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:22,409 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-02-04 18:11:22,409 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash 72229001, now seen corresponding path program 2 times [2018-02-04 18:11:22,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:22,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:22,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:22,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:22,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:22,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:22,419 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:22,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:22,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:22,420 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:11:22,440 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:11:22,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:11:22,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:22,460 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 18:11:22,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,465 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 18:11:22,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:11:22,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,492 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 18:11:22,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,497 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 12 treesize of output 15 [2018-02-04 18:11:22,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 18:11:22,518 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 11 treesize of output 8 [2018-02-04 18:11:22,520 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 8 treesize of output 7 [2018-02-04 18:11:22,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,530 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 11 treesize of output 8 [2018-02-04 18:11:22,531 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 8 treesize of output 7 [2018-02-04 18:11:22,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-02-04 18:11:22,561 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 27 treesize of output 28 [2018-02-04 18:11:22,563 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 18:11:22,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,583 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-02-04 18:11:22,585 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 18:11:22,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-02-04 18:11:22,627 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 34 treesize of output 37 [2018-02-04 18:11:22,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,630 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 18 treesize of output 35 [2018-02-04 18:11:22,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,660 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 18:11:22,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,663 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 42 treesize of output 55 [2018-02-04 18:11:22,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-02-04 18:11:22,762 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-02-04 18:11:22,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2018-02-04 18:11:22,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:22,799 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 18:11:22,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:22,852 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 0 case distinctions, treesize of input 48 treesize of output 40 [2018-02-04 18:11:22,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,867 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 1 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 18:11:22,868 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:22,883 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 18:11:22,883 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:22,891 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 0 case distinctions, treesize of input 49 treesize of output 41 [2018-02-04 18:11:22,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,899 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 29 [2018-02-04 18:11:22,899 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:22,916 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 18:11:22,917 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:22,926 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 0 case distinctions, treesize of input 52 treesize of output 44 [2018-02-04 18:11:22,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:22,937 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 20 treesize of output 23 [2018-02-04 18:11:22,937 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,946 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 18:11:22,946 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,950 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:22,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-02-04 18:11:22,993 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:98, output treesize:149 [2018-02-04 18:11:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:23,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:23,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 18:11:23,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:11:23,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:11:23,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:11:23,122 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 15 states. [2018-02-04 18:11:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:24,415 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-02-04 18:11:24,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:11:24,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-04 18:11:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:24,416 INFO L225 Difference]: With dead ends: 131 [2018-02-04 18:11:24,416 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 18:11:24,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 18:11:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 18:11:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2018-02-04 18:11:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 18:11:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-04 18:11:24,419 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 47 [2018-02-04 18:11:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:24,419 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-04 18:11:24,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:11:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-04 18:11:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 18:11:24,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:24,419 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:11:24,419 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1902183403, now seen corresponding path program 1 times [2018-02-04 18:11:24,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:24,420 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:24,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:24,420 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:11:24,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:24,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:24,432 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:24,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:24,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:24,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:24,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:24,501 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 11 treesize of output 8 [2018-02-04 18:11:24,502 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 8 treesize of output 7 [2018-02-04 18:11:24,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:33 [2018-02-04 18:11:24,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,546 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 18:11:24,548 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 18:11:24,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,559 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 18:11:24,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-02-04 18:11:24,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,609 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2018-02-04 18:11:24,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,613 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 72 treesize of output 97 [2018-02-04 18:11:24,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,634 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 18:11:24,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:91 [2018-02-04 18:11:24,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,881 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 0 case distinctions, treesize of input 111 treesize of output 93 [2018-02-04 18:11:24,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 79 treesize of output 55 [2018-02-04 18:11:24,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,898 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 7 treesize of output 1 [2018-02-04 18:11:24,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,931 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 0 case distinctions, treesize of input 111 treesize of output 93 [2018-02-04 18:11:24,933 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 7 treesize of output 1 [2018-02-04 18:11:24,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:24,945 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 73 treesize of output 51 [2018-02-04 18:11:24,945 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:24,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:24,973 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:223, output treesize:97 [2018-02-04 18:11:25,269 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_prenex_288 Int) (v_prenex_287 Int)) (let ((.cse1 (store |c_old(#valid)| main_~y~0.base 1))) (let ((.cse0 (store .cse1 v_prenex_288 1))) (and (= 0 (select .cse0 v_prenex_287)) (= 0 (select .cse1 v_prenex_288)) (= (store (store (store .cse0 v_prenex_287 0) v_prenex_288 0) main_~y~0.base 0) |c_#valid|) (not (= main_~y~0.base 0)) (not (= v_prenex_288 0)) (not (= v_prenex_287 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))))) is different from true [2018-02-04 18:11:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-02-04 18:11:25,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:25,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 18:11:25,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 18:11:25,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 18:11:25,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=399, Unknown=14, NotChecked=40, Total=506 [2018-02-04 18:11:25,292 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 23 states. [2018-02-04 18:11:33,791 WARN L146 SmtUtils]: Spent 8054ms on a formula simplification. DAG size of input: 64 DAG size of output 54 [2018-02-04 18:11:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:34,706 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-02-04 18:11:34,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:11:34,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-02-04 18:11:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:34,706 INFO L225 Difference]: With dead ends: 120 [2018-02-04 18:11:34,706 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 18:11:34,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=127, Invalid=1052, Unknown=15, NotChecked=66, Total=1260 [2018-02-04 18:11:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 18:11:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2018-02-04 18:11:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 18:11:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-02-04 18:11:34,708 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 48 [2018-02-04 18:11:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:34,708 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-02-04 18:11:34,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 18:11:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-02-04 18:11:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 18:11:34,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:34,709 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 18:11:34,709 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2055869351, now seen corresponding path program 3 times [2018-02-04 18:11:34,709 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:34,709 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:34,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:34,710 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:34,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:34,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:34,720 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:34,720 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:34,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:34,721 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:11:34,737 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 18:11:34,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:11:34,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:34,741 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 18:11:34,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:11:34,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,748 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 18:11:34,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,753 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 18:11:34,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-02-04 18:11:34,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,764 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 18:11:34,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,772 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 18:11:34,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-04 18:11:34,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,799 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 18:11:34,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,806 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 18:11:34,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 18:11:34,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 11 treesize of output 8 [2018-02-04 18:11:34,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 8 treesize of output 7 [2018-02-04 18:11:34,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,817 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 18:11:34,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-04 18:11:34,834 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2018-02-04 18:11:34,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 32 treesize of output 31 [2018-02-04 18:11:34,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,853 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 1 xjuncts. [2018-02-04 18:11:34,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-02-04 18:11:34,877 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 47 [2018-02-04 18:11:34,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,879 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 35 treesize of output 46 [2018-02-04 18:11:34,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:34,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-02-04 18:11:34,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:34,916 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 18:11:34,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 18:11:35,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,059 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-02-04 18:11:35,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:35,077 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2018-02-04 18:11:35,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,127 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 64 [2018-02-04 18:11:35,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 6 xjuncts. [2018-02-04 18:11:35,207 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 25 treesize of output 18 [2018-02-04 18:11:35,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:35,209 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 8 [2018-02-04 18:11:35,209 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:35,211 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 30 treesize of output 23 [2018-02-04 18:11:35,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:35,212 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 18 treesize of output 11 [2018-02-04 18:11:35,212 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:35,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:35,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 85 [2018-02-04 18:11:35,287 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:11:35,289 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 16 xjuncts. [2018-02-04 18:11:35,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:11:35,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:11:35,377 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:78, output treesize:72 [2018-02-04 18:11:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:35,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:35,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 18:11:35,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:11:35,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:11:35,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:11:35,437 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 16 states. [2018-02-04 18:11:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:41,928 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-02-04 18:11:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:11:41,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-02-04 18:11:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:41,929 INFO L225 Difference]: With dead ends: 102 [2018-02-04 18:11:41,929 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 18:11:41,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:11:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 18:11:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-02-04 18:11:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 18:11:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 18:11:41,930 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 48 [2018-02-04 18:11:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:41,930 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 18:11:41,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:11:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 18:11:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 18:11:41,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:41,931 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-04 18:11:41,931 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash 692593450, now seen corresponding path program 2 times [2018-02-04 18:11:41,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:41,931 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:41,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:41,931 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:11:41,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:41,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:41,941 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:41,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:41,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:41,941 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:11:41,959 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:11:41,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:11:41,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:41,968 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 18:11:41,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:41,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:41,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:11:42,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,003 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 12 treesize of output 15 [2018-02-04 18:11:42,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,011 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-02-04 18:11:42,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 18:11:42,035 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 11 treesize of output 8 [2018-02-04 18:11:42,037 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 8 treesize of output 7 [2018-02-04 18:11:42,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,046 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 11 treesize of output 8 [2018-02-04 18:11:42,048 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 8 treesize of output 7 [2018-02-04 18:11:42,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-02-04 18:11:42,074 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-02-04 18:11:42,079 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 18:11:42,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,096 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 27 treesize of output 28 [2018-02-04 18:11:42,098 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 18:11:42,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:52 [2018-02-04 18:11:42,132 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 18:11:42,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,134 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 42 treesize of output 55 [2018-02-04 18:11:42,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,161 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 34 treesize of output 37 [2018-02-04 18:11:42,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,164 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 18 treesize of output 25 [2018-02-04 18:11:42,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-02-04 18:11:42,240 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 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 18:11:42,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:42,242 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 20 treesize of output 16 [2018-02-04 18:11:42,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,247 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 18:11:42,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,255 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:89, output treesize:56 [2018-02-04 18:11:42,295 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 0 case distinctions, treesize of input 54 treesize of output 38 [2018-02-04 18:11:42,297 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 33 treesize of output 19 [2018-02-04 18:11:42,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,302 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 18:11:42,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:42,309 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:65, output treesize:24 [2018-02-04 18:11:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:42,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:42,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 18:11:42,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:11:42,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:11:42,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:11:42,464 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 22 states. [2018-02-04 18:11:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:44,174 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2018-02-04 18:11:44,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 18:11:44,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-02-04 18:11:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:44,175 INFO L225 Difference]: With dead ends: 151 [2018-02-04 18:11:44,175 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 18:11:44,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=814, Invalid=2378, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 18:11:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 18:11:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 101. [2018-02-04 18:11:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 18:11:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-02-04 18:11:44,177 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 49 [2018-02-04 18:11:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:44,177 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-02-04 18:11:44,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:11:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-02-04 18:11:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 18:11:44,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:44,177 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 18:11:44,177 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -802629571, now seen corresponding path program 1 times [2018-02-04 18:11:44,177 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:44,177 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:44,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:44,178 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:11:44,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:44,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:44,186 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:44,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:44,186 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:44,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:44,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:44,208 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 18:11:44,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,213 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 18:11:44,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:11:44,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,242 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 12 treesize of output 15 [2018-02-04 18:11:44,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,251 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 17 treesize of output 24 [2018-02-04 18:11:44,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-02-04 18:11:44,310 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 11 treesize of output 8 [2018-02-04 18:11:44,319 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 8 treesize of output 7 [2018-02-04 18:11:44,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,340 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 11 treesize of output 8 [2018-02-04 18:11:44,342 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 8 treesize of output 7 [2018-02-04 18:11:44,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-02-04 18:11:44,376 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-02-04 18:11:44,378 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 18:11:44,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,400 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 27 treesize of output 28 [2018-02-04 18:11:44,401 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 18:11:44,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:69 [2018-02-04 18:11:44,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,434 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 0 case distinctions, treesize of input 21 treesize of output 46 [2018-02-04 18:11:44,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,450 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 20 treesize of output 28 [2018-02-04 18:11:44,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:60 [2018-02-04 18:11:44,476 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 32 treesize of output 35 [2018-02-04 18:11:44,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,478 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 16 treesize of output 23 [2018-02-04 18:11:44,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,497 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 18:11:44,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,500 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 42 treesize of output 63 [2018-02-04 18:11:44,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:66 [2018-02-04 18:11:44,574 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-02-04 18:11:44,575 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 18:11:44,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:44,597 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 2 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 18:11:44,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:44,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:44,648 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 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 18:11:44,652 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 1 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 18:11:44,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:44,660 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 18:11:44,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,661 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 12 treesize of output 4 [2018-02-04 18:11:44,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:44,669 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 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:11:44,670 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 11 treesize of output 4 [2018-02-04 18:11:44,671 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,676 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 18:11:44,676 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,679 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,681 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 0 case distinctions, treesize of input 46 treesize of output 40 [2018-02-04 18:11:44,682 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 18:11:44,682 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,691 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 11 treesize of output 4 [2018-02-04 18:11:44,691 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,695 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:44,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-02-04 18:11:44,722 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:89, output treesize:129 [2018-02-04 18:11:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:44,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:44,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 18:11:44,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:11:44,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:11:44,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:11:44,818 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 16 states. [2018-02-04 18:11:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:45,957 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-02-04 18:11:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:11:45,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-02-04 18:11:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:45,957 INFO L225 Difference]: With dead ends: 107 [2018-02-04 18:11:45,957 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 18:11:45,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 18:11:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 18:11:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2018-02-04 18:11:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 18:11:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-02-04 18:11:45,959 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 51 [2018-02-04 18:11:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:45,959 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-02-04 18:11:45,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:11:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-02-04 18:11:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:11:45,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:45,960 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:11:45,960 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 888285989, now seen corresponding path program 1 times [2018-02-04 18:11:45,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:45,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:45,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:45,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:45,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:45,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:45,967 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:45,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:45,967 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:45,967 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:46,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:46,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:46,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:46,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, 3 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 18:11:46,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-02-04 18:11:46,031 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 11 treesize of output 8 [2018-02-04 18:11:46,032 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 8 treesize of output 7 [2018-02-04 18:11:46,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 18:11:46,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-04 18:11:46,046 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 18:11:46,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,052 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 18:11:46,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-04 18:11:46,064 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 18:11:46,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,068 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 18:11:46,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:33 [2018-02-04 18:11:46,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 18:11:46,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:46,075 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 34 treesize of output 45 [2018-02-04 18:11:46,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,084 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 18:11:46,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-02-04 18:11:46,109 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-02-04 18:11:46,113 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 18 treesize of output 17 [2018-02-04 18:11:46,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:46,119 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 7 treesize of output 1 [2018-02-04 18:11:46,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:46,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:46,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:11:46,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:16 [2018-02-04 18:11:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:46,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:46,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 18:11:46,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:11:46,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:11:46,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:11:46,164 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 15 states. [2018-02-04 18:11:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:52,689 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-02-04 18:11:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:11:52,689 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 18:11:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:52,690 INFO L225 Difference]: With dead ends: 127 [2018-02-04 18:11:52,690 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 18:11:52,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:11:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 18:11:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2018-02-04 18:11:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 18:11:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-02-04 18:11:52,691 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 52 [2018-02-04 18:11:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:52,692 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-02-04 18:11:52,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:11:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-02-04 18:11:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:11:52,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:52,692 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2018-02-04 18:11:52,692 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash 28591909, now seen corresponding path program 2 times [2018-02-04 18:11:52,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:52,692 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:52,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:52,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:52,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:52,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:52,702 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:52,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:52,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:52,703 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:11:52,742 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:11:52,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:11:52,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:52,780 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 13 treesize of output 10 [2018-02-04 18:11:52,781 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 10 treesize of output 9 [2018-02-04 18:11:52,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,787 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 18:11:52,788 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 18:11:52,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-02-04 18:11:52,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:52,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:52,808 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 18:11:52,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-02-04 18:11:52,829 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 19 treesize of output 20 [2018-02-04 18:11:52,830 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 8 treesize of output 7 [2018-02-04 18:11:52,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,844 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 19 treesize of output 24 [2018-02-04 18:11:52,846 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 8 treesize of output 7 [2018-02-04 18:11:52,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-02-04 18:11:52,868 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-02-04 18:11:52,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:52,870 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 22 treesize of output 39 [2018-02-04 18:11:52,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,885 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 38 treesize of output 33 [2018-02-04 18:11:52,887 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 18 treesize of output 23 [2018-02-04 18:11:52,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-02-04 18:11:52,913 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 45 treesize of output 48 [2018-02-04 18:11:52,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:52,916 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 18 treesize of output 25 [2018-02-04 18:11:52,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,934 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-02-04 18:11:52,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:52,936 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 55 treesize of output 72 [2018-02-04 18:11:52,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:52,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:84 [2018-02-04 18:11:53,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:53,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-02-04 18:11:53,099 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 46 treesize of output 46 [2018-02-04 18:11:53,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:53,120 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:53,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:53,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-02-04 18:11:53,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:53,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:53,132 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 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-04 18:11:53,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:53,133 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 16 treesize of output 8 [2018-02-04 18:11:53,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:53,138 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:53,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:53,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 18:11:53,139 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:53,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:53,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:53,144 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:110, output treesize:12 [2018-02-04 18:11:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:53,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:53,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:11:53,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:11:53,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:11:53,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:11:53,168 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 20 states. [2018-02-04 18:11:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:11:54,784 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2018-02-04 18:11:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 18:11:54,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-04 18:11:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:11:54,785 INFO L225 Difference]: With dead ends: 155 [2018-02-04 18:11:54,785 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 18:11:54,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=538, Invalid=2012, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 18:11:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 18:11:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 129. [2018-02-04 18:11:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 18:11:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-02-04 18:11:54,787 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 52 [2018-02-04 18:11:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:11:54,787 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-02-04 18:11:54,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:11:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-02-04 18:11:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 18:11:54,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:11:54,788 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1] [2018-02-04 18:11:54,788 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:11:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash -722803741, now seen corresponding path program 1 times [2018-02-04 18:11:54,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:11:54,788 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:11:54,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:54,788 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:11:54,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:11:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:54,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:11:54,798 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:11:54,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:11:54,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:11:54,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:11:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:11:54,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:11:54,824 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 18:11:54,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:11:54,835 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 18:11:54,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 18:11:54,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 13 treesize of output 10 [2018-02-04 18:11:54,872 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 10 treesize of output 9 [2018-02-04 18:11:54,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 18:11:54,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:54,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:54,905 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 18:11:54,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-02-04 18:11:54,932 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 21 treesize of output 22 [2018-02-04 18:11:54,934 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 8 treesize of output 7 [2018-02-04 18:11:54,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,947 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 11 treesize of output 8 [2018-02-04 18:11:54,948 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 8 treesize of output 7 [2018-02-04 18:11:54,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-02-04 18:11:54,985 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-02-04 18:11:54,987 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 18 treesize of output 17 [2018-02-04 18:11:54,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:54,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,003 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 74 treesize of output 69 [2018-02-04 18:11:55,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:55,028 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 30 treesize of output 51 [2018-02-04 18:11:55,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:77 [2018-02-04 18:11:55,063 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 81 treesize of output 76 [2018-02-04 18:11:55,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:55,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:55,066 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 68 treesize of output 93 [2018-02-04 18:11:55,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,092 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-02-04 18:11:55,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:55,094 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 62 treesize of output 75 [2018-02-04 18:11:55,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:97 [2018-02-04 18:11:55,232 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2018-02-04 18:11:55,234 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 1 [2018-02-04 18:11:55,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:55,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:55,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:55,260 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 3 case distinctions, treesize of input 56 treesize of output 79 [2018-02-04 18:11:55,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:11:55,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:11:55,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-02-04 18:11:55,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:129, output treesize:496 [2018-02-04 18:11:56,568 WARN L146 SmtUtils]: Spent 1113ms on a formula simplification. DAG size of input: 187 DAG size of output 127 [2018-02-04 18:11:56,997 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 128 DAG size of output 98 [2018-02-04 18:11:57,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,178 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 0 case distinctions, treesize of input 65 treesize of output 55 [2018-02-04 18:11:57,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,180 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:57,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,190 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-02-04 18:11:57,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-04 18:11:57,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,225 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:57,225 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 28 treesize of output 21 [2018-02-04 18:11:57,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:57,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,228 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:57,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-02-04 18:11:57,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:11:57,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:11:57,233 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:11:57,238 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 2 case distinctions, treesize of input 40 treesize of output 51 [2018-02-04 18:11:57,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:11:57,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:11:57,260 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 18:11:57,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-02-04 18:11:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:11:57,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:11:57,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 18:11:57,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 18:11:57,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 18:11:57,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=493, Unknown=3, NotChecked=0, Total=552 [2018-02-04 18:11:57,292 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 24 states. [2018-02-04 18:12:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:12:42,968 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-02-04 18:12:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 18:12:42,968 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-02-04 18:12:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:12:42,969 INFO L225 Difference]: With dead ends: 150 [2018-02-04 18:12:42,969 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 18:12:42,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=514, Invalid=2786, Unknown=6, NotChecked=0, Total=3306 [2018-02-04 18:12:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 18:12:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 129. [2018-02-04 18:12:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 18:12:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2018-02-04 18:12:42,971 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 53 [2018-02-04 18:12:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:12:42,971 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2018-02-04 18:12:42,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 18:12:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2018-02-04 18:12:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 18:12:42,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:12:42,972 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1] [2018-02-04 18:12:42,972 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:12:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -722803740, now seen corresponding path program 1 times [2018-02-04 18:12:42,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:12:42,972 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:12:42,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:12:42,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:12:42,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:12:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:12:42,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:12:42,983 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:12:42,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:12:42,983 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:12:42,984 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:12:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:12:43,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:12:43,027 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 18:12:43,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 18:12:43,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 13 treesize of output 10 [2018-02-04 18:12:43,062 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 10 treesize of output 9 [2018-02-04 18:12:43,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,070 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 18:12:43,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-02-04 18:12:43,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-02-04 18:12:43,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-04 18:12:43,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 30 [2018-02-04 18:12:43,162 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 8 treesize of output 7 [2018-02-04 18:12:43,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:12:43,199 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 8 treesize of output 7 [2018-02-04 18:12:43,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2018-02-04 18:12:43,245 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2018-02-04 18:12:43,246 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 18:12:43,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,268 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 27 treesize of output 28 [2018-02-04 18:12:43,270 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 18:12:43,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:80 [2018-02-04 18:12:43,308 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-02-04 18:12:43,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,311 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 63 treesize of output 80 [2018-02-04 18:12:43,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,340 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 34 treesize of output 37 [2018-02-04 18:12:43,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,343 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 18 treesize of output 35 [2018-02-04 18:12:43,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:100 [2018-02-04 18:12:43,459 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 0 case distinctions, treesize of input 127 treesize of output 115 [2018-02-04 18:12:43,461 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 18:12:43,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,491 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 33 [2018-02-04 18:12:43,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 18:12:43,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:12:43,613 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 0 case distinctions, treesize of input 124 treesize of output 112 [2018-02-04 18:12:43,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:12:43,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 33 [2018-02-04 18:12:43,622 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 18:12:43,651 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 18:12:43,651 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:12:43,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:12:43,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-02-04 18:12:43,795 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:255, output treesize:595 [2018-02-04 18:12:46,665 WARN L146 SmtUtils]: Spent 2821ms on a formula simplification. DAG size of input: 178 DAG size of output 137 [2018-02-04 18:12:47,303 WARN L143 SmtUtils]: Spent 574ms on a formula simplification that was a NOOP. DAG size: 137 [2018-02-04 18:12:48,524 WARN L143 SmtUtils]: Spent 1162ms on a formula simplification that was a NOOP. DAG size: 141 Received shutdown request... [2018-02-04 18:12:48,963 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 18:12:48,963 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:12:48,967 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:12:48,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:12:48 BoogieIcfgContainer [2018-02-04 18:12:48,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:12:48,968 INFO L168 Benchmark]: Toolchain (without parser) took 203010.94 ms. Allocated memory was 400.0 MB in the beginning and 664.3 MB in the end (delta: 264.2 MB). Free memory was 356.9 MB in the beginning and 564.4 MB in the end (delta: -207.5 MB). Peak memory consumption was 56.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:12:48,969 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:12:48,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.51 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 346.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:12:48,969 INFO L168 Benchmark]: Boogie Preprocessor took 27.48 ms. Allocated memory is still 400.0 MB. Free memory was 346.3 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:12:48,969 INFO L168 Benchmark]: RCFGBuilder took 208.73 ms. Allocated memory is still 400.0 MB. Free memory was 344.9 MB in the beginning and 323.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 18:12:48,969 INFO L168 Benchmark]: TraceAbstraction took 202623.62 ms. Allocated memory was 400.0 MB in the beginning and 664.3 MB in the end (delta: 264.2 MB). Free memory was 321.7 MB in the beginning and 564.4 MB in the end (delta: -242.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:12:48,970 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.16 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.51 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 346.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.48 ms. Allocated memory is still 400.0 MB. Free memory was 346.3 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 208.73 ms. Allocated memory is still 400.0 MB. Free memory was 344.9 MB in the beginning and 323.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 202623.62 ms. Allocated memory was 400.0 MB in the beginning and 664.3 MB in the end (delta: 264.2 MB). Free memory was 321.7 MB in the beginning and 564.4 MB in the end (delta: -242.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 25 error locations. TIMEOUT Result, 202.5s OverallTime, 41 OverallIterations, 3 TraceHistogramMax, 168.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1637 SDtfs, 4705 SDslu, 8361 SDs, 0 SdLazy, 12548 SolverSat, 1651 SolverUnsat, 100 SolverUnknown, 0 SolverNotchecked, 115.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1689 GetRequests, 721 SyntacticMatches, 18 SemanticMatches, 950 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6228 ImplicationChecksByTransitivity, 61.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=29, 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, 40 MinimizatonAttempts, 796 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 2481 NumberOfCodeBlocks, 2481 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1363 ConstructedInterpolants, 366 QuantifiedInterpolants, 2279142 SizeOfPredicates, 403 NumberOfNonLiveVariables, 4734 ConjunctsInSsa, 1075 ConjunctsInUnsatCore, 40 InterpolantComputations, 17 PerfectInterpolantSequences, 96/305 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/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-12-48-977.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-12-48-977.csv Completed graceful shutdown