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/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:02:49,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:02:49,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:02:49,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:02:49,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:02:49,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:02:49,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:02:49,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:02:49,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:02:49,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:02:49,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:02:49,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:02:49,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:02:49,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:02:49,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:02:49,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:02:49,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:02:49,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:02:49,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:02:49,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:02:49,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:02:49,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:02:49,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:02:49,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:02:49,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:02:49,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:02:49,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:02:49,098 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:02:49,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:02:49,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:02:49,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:02:49,099 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:02:49,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:02:49,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:02:49,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:02:49,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:02:49,109 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:02:49,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:02:49,109 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:02:49,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:02:49,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:02:49,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:02:49,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:02:49,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:02:49,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:02:49,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:02:49,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:02:49,111 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:02:49,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:02:49,146 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:02:49,148 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:02:49,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:02:49,150 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:02:49,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-02-04 18:02:49,287 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:02:49,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:02:49,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:02:49,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:02:49,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:02:49,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c221d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49, skipping insertion in model container [2018-02-04 18:02:49,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:02:49,335 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:02:49,425 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:02:49,438 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:02:49,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49 WrapperNode [2018-02-04 18:02:49,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:02:49,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:02:49,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:02:49,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:02:49,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (1/1) ... [2018-02-04 18:02:49,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:02:49,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:02:49,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:02:49,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:02:49,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (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:02:49,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:02:49,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:02:49,504 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:02:49,504 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:02:49,504 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:02:49,504 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:02:49,504 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:02:49,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:02:49,736 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:02:49,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:02:49 BoogieIcfgContainer [2018-02-04 18:02:49,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:02:49,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:02:49,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:02:49,740 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:02:49,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:02:49" (1/3) ... [2018-02-04 18:02:49,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c8450c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:02:49, skipping insertion in model container [2018-02-04 18:02:49,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:02:49" (2/3) ... [2018-02-04 18:02:49,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c8450c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:02:49, skipping insertion in model container [2018-02-04 18:02:49,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:02:49" (3/3) ... [2018-02-04 18:02:49,742 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-02-04 18:02:49,747 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:02:49,752 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-02-04 18:02:49,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:02:49,775 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:02:49,775 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:02:49,775 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:02:49,775 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:02:49,776 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:02:49,776 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:02:49,776 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:02:49,776 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:02:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-02-04 18:02:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 18:02:49,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:49,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:49,794 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-02-04 18:02:49,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:49,799 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:49,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:49,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:49,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:49,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:49,878 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:02:49,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:49,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:02:49,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 18:02:49,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 18:02:49,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:02:49,891 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-02-04 18:02:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:49,906 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-04 18:02:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 18:02:49,907 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-04 18:02:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:49,967 INFO L225 Difference]: With dead ends: 94 [2018-02-04 18:02:49,967 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 18:02:49,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:02:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 18:02:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 18:02:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 18:02:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-04 18:02:49,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-02-04 18:02:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:49,995 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-04 18:02:49,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 18:02:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-04 18:02:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 18:02:49,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:49,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:49,996 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-02-04 18:02:49,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:49,997 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:49,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:49,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:49,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:50,042 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:02:50,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:50,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:50,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:02:50,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:02:50,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:02:50,044 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-02-04 18:02:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:50,086 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-04 18:02:50,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:02:50,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 18:02:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:50,088 INFO L225 Difference]: With dead ends: 146 [2018-02-04 18:02:50,088 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 18:02:50,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:02:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 18:02:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-02-04 18:02:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 18:02:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-02-04 18:02:50,098 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-02-04 18:02:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:50,098 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-02-04 18:02:50,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:02:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-02-04 18:02:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 18:02:50,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:50,099 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:50,099 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-02-04 18:02:50,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:50,099 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:50,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:50,125 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:02:50,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:50,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:02:50,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:02:50,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:02:50,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:02:50,126 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-02-04 18:02:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:50,198 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2018-02-04 18:02:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:02:50,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 18:02:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:50,200 INFO L225 Difference]: With dead ends: 124 [2018-02-04 18:02:50,200 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 18:02:50,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:02:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 18:02:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-04 18:02:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 18:02:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-02-04 18:02:50,206 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-02-04 18:02:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:50,206 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-02-04 18:02:50,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:02:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-02-04 18:02:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 18:02:50,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:50,206 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:50,206 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-02-04 18:02:50,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:50,207 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:50,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:50,235 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:02:50,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:50,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:50,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:50,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:50,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:50,236 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-02-04 18:02:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:50,345 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2018-02-04 18:02:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:02:50,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 18:02:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:50,346 INFO L225 Difference]: With dead ends: 137 [2018-02-04 18:02:50,347 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 18:02:50,347 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:02:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 18:02:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-02-04 18:02:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 18:02:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-04 18:02:50,352 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-02-04 18:02:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:50,353 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-04 18:02:50,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-04 18:02:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 18:02:50,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:50,353 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:50,353 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-02-04 18:02:50,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:50,354 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:50,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,355 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,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:02:50,414 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:02:50,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:50,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:50,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:50,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:50,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:50,415 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-02-04 18:02:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:50,487 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2018-02-04 18:02:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:02:50,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 18:02:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:50,488 INFO L225 Difference]: With dead ends: 152 [2018-02-04 18:02:50,488 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 18:02:50,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:02:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 18:02:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-02-04 18:02:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 18:02:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-02-04 18:02:50,494 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-02-04 18:02:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:50,494 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-02-04 18:02:50,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-02-04 18:02:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 18:02:50,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:50,495 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, 1, 1] [2018-02-04 18:02:50,495 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-02-04 18:02:50,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:50,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:50,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:50,525 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:50,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:50,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:50,526 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:50,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:50,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:50,610 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 14 treesize of output 23 [2018-02-04 18:02:50,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:50,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:50,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:50,621 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:02:50,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:50,628 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:02:50,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 18:02:50,656 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:02:50,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:50,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:02:50,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:02:50,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:02:50,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:02:50,657 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 6 states. [2018-02-04 18:02:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:50,818 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2018-02-04 18:02:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:02:50,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 18:02:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:50,819 INFO L225 Difference]: With dead ends: 198 [2018-02-04 18:02:50,819 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 18:02:50,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:02:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 18:02:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-02-04 18:02:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 18:02:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-02-04 18:02:50,823 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-02-04 18:02:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:50,823 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-02-04 18:02:50,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:02:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-02-04 18:02:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 18:02:50,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:50,824 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, 1, 1, 1] [2018-02-04 18:02:50,824 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-02-04 18:02:50,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:50,824 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:50,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:50,866 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:02:50,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:50,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:50,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:50,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:50,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:50,867 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-02-04 18:02:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:50,966 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-02-04 18:02:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:02:50,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-04 18:02:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:50,968 INFO L225 Difference]: With dead ends: 152 [2018-02-04 18:02:50,968 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 18:02:50,968 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:02:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 18:02:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-02-04 18:02:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 18:02:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-04 18:02:50,973 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-02-04 18:02:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:50,973 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-04 18:02:50,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-04 18:02:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 18:02:50,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:50,974 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, 1, 1, 1] [2018-02-04 18:02:50,974 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-02-04 18:02:50,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:50,975 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:50,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:50,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:50,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:51,036 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:02:51,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:51,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:51,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:51,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:51,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:51,037 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-02-04 18:02:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:51,095 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-02-04 18:02:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:02:51,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-04 18:02:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:51,096 INFO L225 Difference]: With dead ends: 140 [2018-02-04 18:02:51,096 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 18:02:51,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:02:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 18:02:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-02-04 18:02:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 18:02:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-04 18:02:51,098 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-02-04 18:02:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:51,098 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-04 18:02:51,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-04 18:02:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:02:51,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:51,099 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] [2018-02-04 18:02:51,099 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-02-04 18:02:51,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:51,099 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:51,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:51,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:51,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:51,127 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:02:51,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:51,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:51,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:51,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:51,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:51,129 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-02-04 18:02:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:51,199 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-02-04 18:02:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:51,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 18:02:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:51,200 INFO L225 Difference]: With dead ends: 122 [2018-02-04 18:02:51,200 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 18:02:51,200 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:02:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 18:02:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-02-04 18:02:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 18:02:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-04 18:02:51,203 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-02-04 18:02:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:51,203 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-04 18:02:51,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-04 18:02:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:02:51,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:51,204 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] [2018-02-04 18:02:51,204 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-02-04 18:02:51,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:51,204 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:51,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:51,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:51,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:51,271 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:02:51,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:51,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:02:51,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:02:51,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:02:51,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:02:51,271 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-02-04 18:02:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:51,391 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-02-04 18:02:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:51,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 18:02:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:51,393 INFO L225 Difference]: With dead ends: 176 [2018-02-04 18:02:51,394 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 18:02:51,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:02:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 18:02:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-02-04 18:02:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 18:02:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-02-04 18:02:51,398 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-02-04 18:02:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:51,398 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-02-04 18:02:51,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:02:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-02-04 18:02:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:02:51,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:51,399 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:02:51,399 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-02-04 18:02:51,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:51,400 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:51,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:51,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:51,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:51,436 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:02:51,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:51,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:02:51,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:02:51,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:02:51,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:02:51,437 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-02-04 18:02:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:51,483 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-02-04 18:02:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:51,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 18:02:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:51,488 INFO L225 Difference]: With dead ends: 133 [2018-02-04 18:02:51,488 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 18:02:51,488 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:02:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 18:02:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-02-04 18:02:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 18:02:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-04 18:02:51,491 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-02-04 18:02:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:51,492 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-04 18:02:51,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:02:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-04 18:02:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:02:51,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:51,493 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, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:51,493 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-02-04 18:02:51,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:51,493 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:51,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:51,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:51,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:51,511 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:51,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:51,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:51,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:51,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:51,543 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:02:51,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:02:51,555 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:02:51,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-02-04 18:02:51,560 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:02:51,562 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:02:51,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 18:02:51,576 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:02:51,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:51,579 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:02:51,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-02-04 18:02:51,601 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 36 treesize of output 29 [2018-02-04 18:02:51,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:51,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:51,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:51,610 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 29 treesize of output 37 [2018-02-04 18:02:51,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-02-04 18:02:51,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-04 18:02:51,654 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 33 treesize of output 32 [2018-02-04 18:02:51,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,695 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:02:51,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-02-04 18:02:51,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-02-04 18:02:51,720 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 29 treesize of output 22 [2018-02-04 18:02:51,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:51,731 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 22 treesize of output 14 [2018-02-04 18:02:51,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:51,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 18:02:51,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:51,749 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:02:51,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-02-04 18:02:51,756 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:02:51,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:51,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:02:51,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:02:51,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:02:51,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:02:51,756 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 9 states. [2018-02-04 18:02:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:52,059 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-02-04 18:02:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:02:52,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 18:02:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:52,060 INFO L225 Difference]: With dead ends: 220 [2018-02-04 18:02:52,060 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 18:02:52,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:02:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 18:02:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 144. [2018-02-04 18:02:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 18:02:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-02-04 18:02:52,064 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-02-04 18:02:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:52,064 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-02-04 18:02:52,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:02:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-02-04 18:02:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:02:52,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:52,065 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, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:52,065 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-02-04 18:02:52,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:52,066 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:52,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:52,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:52,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:52,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:52,081 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:52,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:52,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:52,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:52,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:52,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 6 treesize of output 5 [2018-02-04 18:02:52,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,126 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:02:52,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:02:52,141 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:02:52,143 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:02:52,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,155 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:02:52,157 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:02:52,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 18:02:52,176 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:02:52,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,179 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:02:52,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,192 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:02:52,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,194 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:02:52,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,203 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 18:02:52,217 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 36 treesize of output 29 [2018-02-04 18:02:52,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,226 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 29 treesize of output 37 [2018-02-04 18:02:52,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,245 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 36 treesize of output 29 [2018-02-04 18:02:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,249 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 29 treesize of output 37 [2018-02-04 18:02:52,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2018-02-04 18:02:52,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,266 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:02:52,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:52,278 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:02:52,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,286 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:02:52,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-02-04 18:02:52,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2018-02-04 18:02:52,329 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 31 treesize of output 30 [2018-02-04 18:02:52,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2018-02-04 18:02:52,365 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 31 treesize of output 30 [2018-02-04 18:02:52,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:02:52,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:61 [2018-02-04 18:02:52,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 18:02:52,412 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 23 treesize of output 3 [2018-02-04 18:02:52,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 18:02:52,432 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 23 treesize of output 3 [2018-02-04 18:02:52,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:52,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:02:52,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:14 [2018-02-04 18:02:52,456 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:02:52,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:52,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 18:02:52,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:02:52,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:02:52,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=68, Unknown=2, NotChecked=0, Total=90 [2018-02-04 18:02:52,457 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-02-04 18:02:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:52,868 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-02-04 18:02:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:02:52,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-04 18:02:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:52,870 INFO L225 Difference]: With dead ends: 196 [2018-02-04 18:02:52,870 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 18:02:52,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=251, Unknown=2, NotChecked=0, Total=342 [2018-02-04 18:02:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 18:02:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 144. [2018-02-04 18:02:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 18:02:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-02-04 18:02:52,873 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-02-04 18:02:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:52,873 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-02-04 18:02:52,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:02:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-02-04 18:02:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:02:52,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:52,874 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:02:52,874 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-02-04 18:02:52,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:52,875 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:52,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:52,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:52,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:52,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:02:52,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:52,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:52,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:52,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:52,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:52,900 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-02-04 18:02:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:52,949 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-02-04 18:02:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:52,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-04 18:02:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:52,949 INFO L225 Difference]: With dead ends: 154 [2018-02-04 18:02:52,950 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 18:02:52,950 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:02:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 18:02:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-02-04 18:02:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 18:02:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-02-04 18:02:52,953 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-02-04 18:02:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:52,953 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-02-04 18:02:52,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-02-04 18:02:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:02:52,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:52,954 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:02:52,954 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-02-04 18:02:52,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:52,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:52,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:52,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:52,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:52,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:53,011 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:02:53,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:53,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:02:53,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:02:53,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:02:53,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:02:53,012 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-02-04 18:02:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:53,167 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2018-02-04 18:02:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:02:53,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 18:02:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:53,168 INFO L225 Difference]: With dead ends: 212 [2018-02-04 18:02:53,168 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 18:02:53,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:02:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 18:02:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-02-04 18:02:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 18:02:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-04 18:02:53,172 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-02-04 18:02:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:53,172 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-04 18:02:53,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:02:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-04 18:02:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 18:02:53,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:53,173 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:02:53,173 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-02-04 18:02:53,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:53,173 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:53,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:53,174 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:53,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:53,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:53,190 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:53,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:53,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:53,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:53,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:53,231 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:02:53,233 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:02:53,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,242 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:02:53,245 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:02:53,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-02-04 18:02:53,263 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:02:53,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,277 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:02:53,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,292 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:02:53,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,295 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:02:53,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-02-04 18:02:53,320 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 36 treesize of output 29 [2018-02-04 18:02:53,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 18:02:53,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,346 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 36 treesize of output 29 [2018-02-04 18:02:53,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,352 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 29 treesize of output 37 [2018-02-04 18:02:53,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-02-04 18:02:53,392 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 22 treesize of output 16 [2018-02-04 18:02:53,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-02-04 18:02:53,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,408 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 22 treesize of output 16 [2018-02-04 18:02:53,410 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 16 treesize of output 11 [2018-02-04 18:02:53,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-02-04 18:02:53,437 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:02:53,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:53,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 18:02:53,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:02:53,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:02:53,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:02:53,439 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 10 states. [2018-02-04 18:02:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:53,723 INFO L93 Difference]: Finished difference Result 237 states and 266 transitions. [2018-02-04 18:02:53,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:02:53,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 18:02:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:53,748 INFO L225 Difference]: With dead ends: 237 [2018-02-04 18:02:53,748 INFO L226 Difference]: Without dead ends: 237 [2018-02-04 18:02:53,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:02:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-04 18:02:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 169. [2018-02-04 18:02:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 18:02:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-02-04 18:02:53,752 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-02-04 18:02:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:53,752 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-02-04 18:02:53,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:02:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-02-04 18:02:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:02:53,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:53,753 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:02:53,753 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-02-04 18:02:53,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:53,754 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:53,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:53,754 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:53,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:53,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:53,770 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:53,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:53,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:53,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:53,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:53,794 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:02:53,797 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:02:53,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,805 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:02:53,807 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:02:53,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-02-04 18:02:53,820 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 23 treesize of output 18 [2018-02-04 18:02:53,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,822 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 27 [2018-02-04 18:02:53,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,837 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 23 treesize of output 18 [2018-02-04 18:02:53,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,840 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 27 [2018-02-04 18:02:53,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-02-04 18:02:53,859 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:02:53,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,865 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:02:53,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,879 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:02:53,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,883 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:02:53,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-02-04 18:02:53,902 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 39 treesize of output 30 [2018-02-04 18:02:53,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,910 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 30 treesize of output 77 [2018-02-04 18:02:53,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,930 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 39 treesize of output 30 [2018-02-04 18:02:53,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,938 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 30 treesize of output 77 [2018-02-04 18:02:53,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:53,952 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-02-04 18:02:53,970 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 54 treesize of output 43 [2018-02-04 18:02:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:53,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:02:53,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,016 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 54 treesize of output 43 [2018-02-04 18:02:54,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:02:54,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:69 [2018-02-04 18:02:54,071 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 44 treesize of output 34 [2018-02-04 18:02:54,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-02-04 18:02:54,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:54,088 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:02:54,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:47 [2018-02-04 18:02:54,117 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 51 treesize of output 39 [2018-02-04 18:02:54,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:54,134 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 39 treesize of output 84 [2018-02-04 18:02:54,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:02:54,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:02:54,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:02:54,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:28 [2018-02-04 18:02:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:02:54,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:54,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 18:02:54,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:02:54,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:02:54,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:02:54,195 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 11 states. [2018-02-04 18:02:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:54,735 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2018-02-04 18:02:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:02:54,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-04 18:02:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:54,736 INFO L225 Difference]: With dead ends: 185 [2018-02-04 18:02:54,736 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 18:02:54,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:02:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 18:02:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-02-04 18:02:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 18:02:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2018-02-04 18:02:54,740 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 37 [2018-02-04 18:02:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:54,740 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2018-02-04 18:02:54,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:02:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-02-04 18:02:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 18:02:54,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:54,741 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] [2018-02-04 18:02:54,741 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:54,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1814827739, now seen corresponding path program 1 times [2018-02-04 18:02:54,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:54,742 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:54,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:54,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:54,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:54,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:54,753 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:54,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:54,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:54,754 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:54,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:54,860 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)) (not (= 0 main_~x~1.base)))) is different from true [2018-02-04 18:02:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 18:02:54,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:54,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 18:02:54,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:02:54,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:02:54,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2018-02-04 18:02:54,869 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand 10 states. [2018-02-04 18:02:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:55,220 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-04 18:02:55,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:02:55,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 18:02:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:55,221 INFO L225 Difference]: With dead ends: 175 [2018-02-04 18:02:55,221 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 18:02:55,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=170, Unknown=2, NotChecked=28, Total=272 [2018-02-04 18:02:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 18:02:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-02-04 18:02:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 18:02:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2018-02-04 18:02:55,225 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 38 [2018-02-04 18:02:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:55,226 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2018-02-04 18:02:55,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:02:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-02-04 18:02:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 18:02:55,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:55,226 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:55,226 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 686838870, now seen corresponding path program 1 times [2018-02-04 18:02:55,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:55,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:55,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:55,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:55,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:55,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:55,240 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:55,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:55,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:55,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:55,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:55,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:02:55,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:02:55,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:02:55,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,286 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:02:55,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:02:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:02:55,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:55,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 18:02:55,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:02:55,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:02:55,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:02:55,294 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 5 states. [2018-02-04 18:02:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:55,372 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2018-02-04 18:02:55,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:55,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 18:02:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:55,373 INFO L225 Difference]: With dead ends: 181 [2018-02-04 18:02:55,373 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 18:02:55,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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:02:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 18:02:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2018-02-04 18:02:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 18:02:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-02-04 18:02:55,377 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 39 [2018-02-04 18:02:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:55,377 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-02-04 18:02:55,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:02:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-02-04 18:02:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 18:02:55,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:55,378 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:55,378 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash 686838871, now seen corresponding path program 1 times [2018-02-04 18:02:55,378 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:55,378 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:55,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:55,379 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:55,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:55,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:55,392 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:55,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:55,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:55,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:55,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:55,424 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:02:55,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:02:55,449 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:02:55,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,452 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:02:55,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 18:02:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:02:55,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:55,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 18:02:55,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:02:55,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:02:55,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:02:55,457 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 5 states. [2018-02-04 18:02:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:55,536 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2018-02-04 18:02:55,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:55,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 18:02:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:55,537 INFO L225 Difference]: With dead ends: 215 [2018-02-04 18:02:55,537 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 18:02:55,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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:02:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 18:02:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 181. [2018-02-04 18:02:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 18:02:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2018-02-04 18:02:55,541 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 39 [2018-02-04 18:02:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:55,542 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2018-02-04 18:02:55,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:02:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2018-02-04 18:02:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 18:02:55,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:55,542 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, 1, 1, 1, 1] [2018-02-04 18:02:55,542 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash -927394694, now seen corresponding path program 1 times [2018-02-04 18:02:55,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:55,543 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:55,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:55,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:55,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:55,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:55,562 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:55,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:55,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:55,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:55,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:55,620 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:02:55,624 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:02:55,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2018-02-04 18:02:55,650 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:02:55,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,656 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:02:55,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 18:02:55,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 18:02:55,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:02:55,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:16 [2018-02-04 18:02:55,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,701 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 14 treesize of output 23 [2018-02-04 18:02:55,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,712 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:02:55,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,718 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:02:55,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 18:02:55,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:55,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:02:55,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:55,745 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:02:55,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-02-04 18:02:55,772 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:02:55,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:55,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 18:02:55,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:02:55,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:02:55,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:02:55,773 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand 11 states. [2018-02-04 18:02:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:56,162 INFO L93 Difference]: Finished difference Result 294 states and 328 transitions. [2018-02-04 18:02:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:02:56,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-02-04 18:02:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:56,163 INFO L225 Difference]: With dead ends: 294 [2018-02-04 18:02:56,163 INFO L226 Difference]: Without dead ends: 294 [2018-02-04 18:02:56,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:02:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-04 18:02:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 206. [2018-02-04 18:02:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 18:02:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2018-02-04 18:02:56,168 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 44 [2018-02-04 18:02:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:56,168 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2018-02-04 18:02:56,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:02:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2018-02-04 18:02:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 18:02:56,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:56,169 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 18:02:56,169 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash -576633818, now seen corresponding path program 1 times [2018-02-04 18:02:56,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:56,170 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:56,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:56,170 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:56,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:56,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:56,183 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:56,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:56,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:56,184 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:56,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:56,238 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:02:56,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:02:56,247 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:02:56,249 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:02:56,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,253 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:02:56,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 18:02:56,260 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 16 treesize of output 15 [2018-02-04 18:02:56,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,264 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:02:56,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:15 [2018-02-04 18:02:56,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 18:02:56,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 18:02:56,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,312 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:02:56,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2018-02-04 18:02:56,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 18:02:56,331 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 17 [2018-02-04 18:02:56,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 18:02:56,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,347 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:02:56,347 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:5 [2018-02-04 18:02:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:02:56,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:56,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 18:02:56,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:02:56,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:02:56,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:02:56,357 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand 8 states. [2018-02-04 18:02:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:56,637 INFO L93 Difference]: Finished difference Result 229 states and 255 transitions. [2018-02-04 18:02:56,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:02:56,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-02-04 18:02:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:56,640 INFO L225 Difference]: With dead ends: 229 [2018-02-04 18:02:56,640 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 18:02:56,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:02:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 18:02:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2018-02-04 18:02:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 18:02:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 231 transitions. [2018-02-04 18:02:56,644 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 231 transitions. Word has length 45 [2018-02-04 18:02:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:56,644 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 231 transitions. [2018-02-04 18:02:56,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:02:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 231 transitions. [2018-02-04 18:02:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 18:02:56,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:56,645 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 18:02:56,645 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash -576633817, now seen corresponding path program 1 times [2018-02-04 18:02:56,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:56,645 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:56,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:56,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:56,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:56,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:56,662 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:56,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:56,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:56,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:56,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:56,706 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:02:56,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,711 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:02:56,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:02:56,731 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:02:56,734 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:02:56,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,744 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:02:56,746 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:02:56,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,754 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:02:56,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 18:02:56,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:56,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:56,771 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 15 treesize of output 16 [2018-02-04 18:02:56,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,780 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:02:56,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,786 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:02:56,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-02-04 18:02:56,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-04 18:02:56,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 24 treesize of output 23 [2018-02-04 18:02:56,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-04 18:02:56,867 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 34 treesize of output 33 [2018-02-04 18:02:56,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:02:56,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2018-02-04 18:02:56,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-04 18:02:56,906 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:02:56,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,917 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 14 [2018-02-04 18:02:56,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,927 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 26 treesize of output 10 [2018-02-04 18:02:56,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-04 18:02:56,944 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 22 treesize of output 15 [2018-02-04 18:02:56,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-02-04 18:02:56,973 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,977 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:56,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:02:56,981 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:66, output treesize:18 [2018-02-04 18:02:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:02:56,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:02:56,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 18:02:56,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:02:56,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:02:56,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:02:56,995 INFO L87 Difference]: Start difference. First operand 205 states and 231 transitions. Second operand 9 states. [2018-02-04 18:02:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:57,609 INFO L93 Difference]: Finished difference Result 311 states and 343 transitions. [2018-02-04 18:02:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:02:57,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 18:02:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:57,610 INFO L225 Difference]: With dead ends: 311 [2018-02-04 18:02:57,610 INFO L226 Difference]: Without dead ends: 311 [2018-02-04 18:02:57,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:02:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-04 18:02:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 188. [2018-02-04 18:02:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 18:02:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2018-02-04 18:02:57,612 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 45 [2018-02-04 18:02:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:57,613 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2018-02-04 18:02:57,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:02:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2018-02-04 18:02:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 18:02:57,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:57,613 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, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:57,613 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2126898235, now seen corresponding path program 1 times [2018-02-04 18:02:57,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:57,613 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:57,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:57,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:57,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:57,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:02:57,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:57,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:02:57,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:02:57,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:02:57,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:02:57,669 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand 7 states. [2018-02-04 18:02:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:57,806 INFO L93 Difference]: Finished difference Result 211 states and 237 transitions. [2018-02-04 18:02:57,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:02:57,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-02-04 18:02:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:57,807 INFO L225 Difference]: With dead ends: 211 [2018-02-04 18:02:57,807 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 18:02:57,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:02:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 18:02:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2018-02-04 18:02:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 18:02:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-02-04 18:02:57,810 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 46 [2018-02-04 18:02:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:57,811 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-02-04 18:02:57,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:02:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-02-04 18:02:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 18:02:57,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:57,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:57,811 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 613203071, now seen corresponding path program 1 times [2018-02-04 18:02:57,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:57,812 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:57,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:57,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:57,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:57,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:57,873 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:02:57,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:57,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:02:57,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:02:57,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:02:57,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:02:57,874 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 8 states. [2018-02-04 18:02:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:58,065 INFO L93 Difference]: Finished difference Result 212 states and 237 transitions. [2018-02-04 18:02:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:02:58,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-04 18:02:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:58,066 INFO L225 Difference]: With dead ends: 212 [2018-02-04 18:02:58,066 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 18:02:58,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:02:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 18:02:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-02-04 18:02:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 18:02:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2018-02-04 18:02:58,070 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 50 [2018-02-04 18:02:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:58,070 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2018-02-04 18:02:58,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:02:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2018-02-04 18:02:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 18:02:58,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:58,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:58,071 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash 613203072, now seen corresponding path program 1 times [2018-02-04 18:02:58,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:58,072 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:58,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:58,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:58,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:58,188 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:02:58,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:58,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:02:58,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:02:58,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:02:58,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:02:58,189 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand 9 states. [2018-02-04 18:02:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:58,467 INFO L93 Difference]: Finished difference Result 304 states and 344 transitions. [2018-02-04 18:02:58,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:02:58,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-02-04 18:02:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:58,468 INFO L225 Difference]: With dead ends: 304 [2018-02-04 18:02:58,469 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 18:02:58,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:02:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 18:02:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 194. [2018-02-04 18:02:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 18:02:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-04 18:02:58,471 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 50 [2018-02-04 18:02:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:58,471 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-04 18:02:58,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:02:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-04 18:02:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:02:58,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:58,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:58,472 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash 877634816, now seen corresponding path program 1 times [2018-02-04 18:02:58,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:58,472 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:58,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,473 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:58,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:58,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:58,530 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:02:58,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:58,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 18:02:58,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:02:58,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:02:58,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:02:58,531 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 10 states. [2018-02-04 18:02:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:58,816 INFO L93 Difference]: Finished difference Result 355 states and 397 transitions. [2018-02-04 18:02:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 18:02:58,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-04 18:02:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:58,818 INFO L225 Difference]: With dead ends: 355 [2018-02-04 18:02:58,818 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 18:02:58,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-02-04 18:02:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 18:02:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 196. [2018-02-04 18:02:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 18:02:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2018-02-04 18:02:58,822 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 52 [2018-02-04 18:02:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:58,822 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2018-02-04 18:02:58,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:02:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2018-02-04 18:02:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:02:58,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:58,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:02:58,823 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 877634817, now seen corresponding path program 1 times [2018-02-04 18:02:58,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:58,823 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:58,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:58,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:58,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:02:58,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:02:58,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:02:58,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:02:58,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:02:58,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:02:58,852 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand 4 states. [2018-02-04 18:02:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:02:58,890 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2018-02-04 18:02:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:02:58,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-04 18:02:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:02:58,891 INFO L225 Difference]: With dead ends: 195 [2018-02-04 18:02:58,891 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 18:02:58,892 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:02:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 18:02:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-02-04 18:02:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 18:02:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 220 transitions. [2018-02-04 18:02:58,895 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 220 transitions. Word has length 52 [2018-02-04 18:02:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:02:58,895 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 220 transitions. [2018-02-04 18:02:58,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:02:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 220 transitions. [2018-02-04 18:02:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 18:02:58,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:02:58,896 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, 1, 1, 1, 1] [2018-02-04 18:02:58,896 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:02:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1507118755, now seen corresponding path program 1 times [2018-02-04 18:02:58,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:02:58,896 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:02:58,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,897 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:58,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:02:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:58,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:02:58,911 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:02:58,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:02:58,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:02:58,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:02:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:02:58,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:02:58,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, 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:02:58,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:02:58,962 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:02:58,963 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:02:58,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,973 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:02:58,975 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:02:58,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:58,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-02-04 18:02:58,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 21 treesize of output 16 [2018-02-04 18:02:58,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:58,999 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:02:59,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,016 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:02:59,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,019 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:02:59,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-04 18:02:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-04 18:02:59,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,055 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 29 treesize of output 37 [2018-02-04 18:02:59,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,076 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 36 treesize of output 29 [2018-02-04 18:02:59,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,083 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 29 treesize of output 37 [2018-02-04 18:02:59,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2018-02-04 18:02:59,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,122 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:02:59,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-02-04 18:02:59,184 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 28 treesize of output 29 [2018-02-04 18:02:59,186 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:02:59,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,209 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 28 treesize of output 37 [2018-02-04 18:02:59,210 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:02:59,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,227 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:68 [2018-02-04 18:02:59,254 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 59 treesize of output 58 [2018-02-04 18:02:59,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,257 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 27 [2018-02-04 18:02:59,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,312 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:02:59,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,315 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 27 [2018-02-04 18:02:59,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-04 18:02:59,385 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 66 treesize of output 63 [2018-02-04 18:02:59,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-04 18:02:59,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,422 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 52 treesize of output 53 [2018-02-04 18:02:59,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,426 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:02:59,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:100 [2018-02-04 18:02:59,477 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 75 treesize of output 70 [2018-02-04 18:02:59,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-04 18:02:59,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,527 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 61 treesize of output 60 [2018-02-04 18:02:59,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,534 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 30 treesize of output 77 [2018-02-04 18:02:59,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:126, output treesize:118 [2018-02-04 18:02:59,628 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 90 treesize of output 83 [2018-02-04 18:02:59,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:02:59,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,703 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 76 treesize of output 73 [2018-02-04 18:02:59,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:02:59,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:156, output treesize:118 [2018-02-04 18:02:59,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2018-02-04 18:02:59,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 48 [2018-02-04 18:02:59,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,859 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 97 treesize of output 88 [2018-02-04 18:02:59,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 71 [2018-02-04 18:02:59,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:02:59,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:144, output treesize:140 [2018-02-04 18:02:59,955 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 321 treesize of output 294 [2018-02-04 18:02:59,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:02:59,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 281 [2018-02-04 18:02:59,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,067 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 310 treesize of output 272 [2018-02-04 18:03:00,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 299 [2018-02-04 18:03:00,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,128 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:03:00,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:351, output treesize:297 [2018-02-04 18:03:00,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,190 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 298 treesize of output 229 [2018-02-04 18:03:00,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,197 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 83 treesize of output 147 [2018-02-04 18:03:00,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 111 [2018-02-04 18:03:00,215 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:03:00,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:00,246 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 92 treesize of output 70 [2018-02-04 18:03:00,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:00,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2018-02-04 18:03:00,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,269 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 16 treesize of output 11 [2018-02-04 18:03:00,269 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:00,274 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:03:00,275 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:314, output treesize:10 [2018-02-04 18:03:00,316 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:03:00,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:00,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:03:00,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:03:00,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:03:00,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:03:00,317 INFO L87 Difference]: Start difference. First operand 195 states and 220 transitions. Second operand 18 states. [2018-02-04 18:03:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:03,621 INFO L93 Difference]: Finished difference Result 271 states and 297 transitions. [2018-02-04 18:03:03,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:03:03,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-02-04 18:03:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:03,622 INFO L225 Difference]: With dead ends: 271 [2018-02-04 18:03:03,622 INFO L226 Difference]: Without dead ends: 271 [2018-02-04 18:03:03,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 18:03:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-04 18:03:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 222. [2018-02-04 18:03:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 18:03:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 249 transitions. [2018-02-04 18:03:03,625 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 249 transitions. Word has length 53 [2018-02-04 18:03:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:03,625 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 249 transitions. [2018-02-04 18:03:03,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:03:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 249 transitions. [2018-02-04 18:03:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 18:03:03,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:03,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:03,626 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:03,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1435298844, now seen corresponding path program 1 times [2018-02-04 18:03:03,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:03,626 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:03,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:03,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:03,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:03,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:03,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:03,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:03,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:03,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:03,763 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:03:03,765 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:03:03,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-02-04 18:03:03,786 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:03:03,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,788 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:03:03,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 18:03:03,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 36 treesize of output 29 [2018-02-04 18:03:03,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,815 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 29 treesize of output 37 [2018-02-04 18:03:03,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 18:03:03,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,835 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 13 treesize of output 6 [2018-02-04 18:03:03,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:9 [2018-02-04 18:03:03,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:03,842 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:03:03,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 18:03:03,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, 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:03:03,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:8 [2018-02-04 18:03:03,888 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:03:03,889 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:03:03,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:03,893 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:03:03,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-02-04 18:03:03,936 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 16 treesize of output 12 [2018-02-04 18:03:03,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 18:03:03,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:03,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:03,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:03,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-02-04 18:03:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:04,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:03:04,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 24 [2018-02-04 18:03:04,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 18:03:04,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 18:03:04,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-04 18:03:04,017 INFO L87 Difference]: Start difference. First operand 222 states and 249 transitions. Second operand 24 states. [2018-02-04 18:03:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:04,706 INFO L93 Difference]: Finished difference Result 343 states and 380 transitions. [2018-02-04 18:03:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:03:04,707 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-02-04 18:03:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:04,708 INFO L225 Difference]: With dead ends: 343 [2018-02-04 18:03:04,708 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 18:03:04,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 18:03:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 18:03:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 222. [2018-02-04 18:03:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 18:03:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 248 transitions. [2018-02-04 18:03:04,712 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 248 transitions. Word has length 53 [2018-02-04 18:03:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:04,713 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 248 transitions. [2018-02-04 18:03:04,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 18:03:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 248 transitions. [2018-02-04 18:03:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 18:03:04,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:04,713 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, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:04,714 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash -211889822, now seen corresponding path program 1 times [2018-02-04 18:03:04,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:04,714 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:04,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:04,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:04,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:04,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:04,734 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:04,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:04,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:04,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:04,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:04,785 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:03:04,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,791 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:03:04,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:03:04,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:04,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:04,824 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:03:04,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,832 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:03:04,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,838 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:03:04,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-02-04 18:03:04,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:04,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:04,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:04,853 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 16 treesize of output 20 [2018-02-04 18:03:04,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:04,863 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 17 treesize of output 34 [2018-02-04 18:03:04,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:04,870 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 1 xjuncts. [2018-02-04 18:03:04,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:23 [2018-02-04 18:03:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:04,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:04,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 18:03:04,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:03:04,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:03:04,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:03:04,894 INFO L87 Difference]: Start difference. First operand 222 states and 248 transitions. Second operand 7 states. [2018-02-04 18:03:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:05,108 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2018-02-04 18:03:05,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:03:05,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-02-04 18:03:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:05,109 INFO L225 Difference]: With dead ends: 277 [2018-02-04 18:03:05,109 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 18:03:05,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:03:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 18:03:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 197. [2018-02-04 18:03:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 18:03:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-04 18:03:05,112 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 55 [2018-02-04 18:03:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:05,112 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-04 18:03:05,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:03:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-04 18:03:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 18:03:05,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:05,113 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:05,113 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2142007066, now seen corresponding path program 1 times [2018-02-04 18:03:05,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:05,113 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:05,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:05,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:05,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:05,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:05,121 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:05,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:05,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:05,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:05,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:05,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,216 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:03:05,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,230 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:03:05,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 18:03:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:03:05,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:05,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 18:03:05,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:03:05,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:03:05,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:03:05,273 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 10 states. [2018-02-04 18:03:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:05,653 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2018-02-04 18:03:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:03:05,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 18:03:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:05,654 INFO L225 Difference]: With dead ends: 207 [2018-02-04 18:03:05,654 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 18:03:05,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:03:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 18:03:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-02-04 18:03:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 18:03:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-02-04 18:03:05,657 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 55 [2018-02-04 18:03:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:05,657 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-02-04 18:03:05,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:03:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-02-04 18:03:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 18:03:05,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:05,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:05,658 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2142007015, now seen corresponding path program 1 times [2018-02-04 18:03:05,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:05,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:05,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:05,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:05,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:05,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:05,669 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:05,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:05,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:05,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:05,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:05,743 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:03:05,746 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:03:05,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,758 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:03:05,760 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:03:05,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-04 18:03:05,784 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:03:05,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,787 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:03:05,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,808 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:03:05,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,810 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:03:05,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-04 18:03:05,834 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 36 treesize of output 29 [2018-02-04 18:03:05,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,839 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 29 treesize of output 37 [2018-02-04 18:03:05,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,856 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 36 treesize of output 29 [2018-02-04 18:03:05,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,861 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 29 treesize of output 37 [2018-02-04 18:03:05,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2018-02-04 18:03:05,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:05,877 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:03:05,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:53 [2018-02-04 18:03:05,922 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:03:05,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:57 [2018-02-04 18:03:05,953 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 33 [2018-02-04 18:03:05,954 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:03:05,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,973 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 33 [2018-02-04 18:03:05,974 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:03:05,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:05,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-02-04 18:03:06,051 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:06,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-02-04 18:03:06,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,065 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 36 treesize of output 55 [2018-02-04 18:03:06,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,098 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:06,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2018-02-04 18:03:06,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,117 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 4 case distinctions, treesize of input 32 treesize of output 69 [2018-02-04 18:03:06,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 18:03:06,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:03:06,192 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:03:06,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:258 [2018-02-04 18:03:06,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,282 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 103 treesize of output 103 [2018-02-04 18:03:06,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,286 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 64 treesize of output 74 [2018-02-04 18:03:06,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,397 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 99 treesize of output 104 [2018-02-04 18:03:06,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,400 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 77 [2018-02-04 18:03:06,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 114 [2018-02-04 18:03:06,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,519 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 75 treesize of output 92 [2018-02-04 18:03:06,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,610 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 125 treesize of output 130 [2018-02-04 18:03:06,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,634 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 77 [2018-02-04 18:03:06,634 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,653 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,749 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 103 treesize of output 102 [2018-02-04 18:03:06,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,752 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 38 treesize of output 49 [2018-02-04 18:03:06,752 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,769 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 105 [2018-02-04 18:03:06,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:06,853 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 93 [2018-02-04 18:03:06,854 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:03:06,880 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:06,933 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:03:06,933 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:336, output treesize:360 [2018-02-04 18:03:07,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 183 [2018-02-04 18:03:07,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 150 [2018-02-04 18:03:07,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 167 [2018-02-04 18:03:07,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,209 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 125 [2018-02-04 18:03:07,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:03:07,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 121 [2018-02-04 18:03:07,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,366 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 61 treesize of output 112 [2018-02-04 18:03:07,366 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,385 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,470 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 206 treesize of output 195 [2018-02-04 18:03:07,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 179 [2018-02-04 18:03:07,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,499 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,604 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 133 treesize of output 130 [2018-02-04 18:03:07,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,609 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 51 treesize of output 63 [2018-02-04 18:03:07,609 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,627 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,688 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 124 [2018-02-04 18:03:07,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,729 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 113 [2018-02-04 18:03:07,731 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:03:07,771 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:07,845 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:03:07,845 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:474, output treesize:502 [2018-02-04 18:03:07,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 156 [2018-02-04 18:03:07,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:07,911 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 207 [2018-02-04 18:03:07,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:07,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:08,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,070 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:08,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 148 [2018-02-04 18:03:08,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 81 [2018-02-04 18:03:08,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,198 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:08,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2018-02-04 18:03:08,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 57 [2018-02-04 18:03:08,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,318 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:08,319 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 107 treesize of output 107 [2018-02-04 18:03:08,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,330 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 105 [2018-02-04 18:03:08,331 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:08,344 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:08,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,401 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 205 treesize of output 174 [2018-02-04 18:03:08,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 237 [2018-02-04 18:03:08,404 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,426 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,474 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:08,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182 [2018-02-04 18:03:08,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 122 [2018-02-04 18:03:08,479 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,500 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:08,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:03:08,538 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:483, output treesize:419 [2018-02-04 18:03:08,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,998 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:08,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:08,999 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 132 treesize of output 125 [2018-02-04 18:03:09,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,018 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 115 [2018-02-04 18:03:09,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-02-04 18:03:09,065 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 2 case distinctions, treesize of input 53 treesize of output 50 [2018-02-04 18:03:09,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,138 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 68 treesize of output 54 [2018-02-04 18:03:09,146 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 2 case distinctions, treesize of input 28 treesize of output 25 [2018-02-04 18:03:09,146 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,163 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 24 treesize of output 18 [2018-02-04 18:03:09,163 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-02-04 18:03:09,165 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,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, 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 59 [2018-02-04 18:03:09,188 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 28 treesize of output 17 [2018-02-04 18:03:09,188 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,200 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 13 treesize of output 10 [2018-02-04 18:03:09,200 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,209 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,254 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 167 treesize of output 131 [2018-02-04 18:03:09,259 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:09,265 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 29 treesize of output 29 [2018-02-04 18:03:09,265 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,287 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 25 treesize of output 22 [2018-02-04 18:03:09,287 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,289 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 17 [2018-02-04 18:03:09,289 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,306 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,352 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 90 treesize of output 71 [2018-02-04 18:03:09,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,383 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 73 [2018-02-04 18:03:09,383 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:03:09,393 INFO L267 ElimStorePlain]: Start of recursive call 17: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 31 xjuncts. [2018-02-04 18:03:09,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,464 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 44 [2018-02-04 18:03:09,464 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,466 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 34 treesize of output 30 [2018-02-04 18:03:09,466 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,477 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:09,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,479 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 85 treesize of output 66 [2018-02-04 18:03:09,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:09,494 INFO L477 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 66 [2018-02-04 18:03:09,496 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,516 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 2 case distinctions, treesize of input 16 treesize of output 17 [2018-02-04 18:03:09,517 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,523 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:09,554 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 9 variables, input treesize:300, output treesize:36 [2018-02-04 18:03:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:09,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:09,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 18:03:09,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 18:03:09,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 18:03:09,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:03:09,653 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 23 states. [2018-02-04 18:03:10,317 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 72 DAG size of output 72 [2018-02-04 18:03:10,562 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 124 DAG size of output 124 [2018-02-04 18:03:10,909 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 175 DAG size of output 175 [2018-02-04 18:03:11,155 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 124 DAG size of output 124 [2018-02-04 18:03:11,388 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 126 DAG size of output 126 [2018-02-04 18:03:11,580 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 126 DAG size of output 126 [2018-02-04 18:03:11,803 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 129 DAG size of output 129 [2018-02-04 18:03:12,002 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 138 DAG size of output 137 [2018-02-04 18:03:12,172 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 134 DAG size of output 133 [2018-02-04 18:03:12,336 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 131 DAG size of output 126 [2018-02-04 18:03:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:12,590 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2018-02-04 18:03:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 18:03:12,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-04 18:03:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:12,591 INFO L225 Difference]: With dead ends: 331 [2018-02-04 18:03:12,591 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 18:03:12,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 18:03:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 18:03:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 225. [2018-02-04 18:03:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 18:03:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 246 transitions. [2018-02-04 18:03:12,594 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 246 transitions. Word has length 55 [2018-02-04 18:03:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:12,594 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 246 transitions. [2018-02-04 18:03:12,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 18:03:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 246 transitions. [2018-02-04 18:03:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 18:03:12,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:12,595 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1] [2018-02-04 18:03:12,595 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1011802750, now seen corresponding path program 1 times [2018-02-04 18:03:12,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:12,595 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:12,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:12,595 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:12,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:12,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:12,606 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:12,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:12,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:12,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:12,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:12,625 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:03:12,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:03:12,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:12,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:12,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 18:03:12,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2018-02-04 18:03:12,733 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:03:12,734 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:03:12,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 18:03:12,760 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 47 treesize of output 41 [2018-02-04 18:03:12,761 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 16 treesize of output 15 [2018-02-04 18:03:12,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,772 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:03:12,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:52 [2018-02-04 18:03:12,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-02-04 18:03:12,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 7 treesize of output 1 [2018-02-04 18:03:12,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,839 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 25 treesize of output 10 [2018-02-04 18:03:12,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2018-02-04 18:03:12,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:12,889 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 15 [2018-02-04 18:03:12,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:12,895 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:03:12,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-02-04 18:03:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:12,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:12,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 18:03:12,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:03:12,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:03:12,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:03:12,917 INFO L87 Difference]: Start difference. First operand 225 states and 246 transitions. Second operand 15 states. [2018-02-04 18:03:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:13,550 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2018-02-04 18:03:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:03:13,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 18:03:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:13,551 INFO L225 Difference]: With dead ends: 295 [2018-02-04 18:03:13,551 INFO L226 Difference]: Without dead ends: 295 [2018-02-04 18:03:13,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-02-04 18:03:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-04 18:03:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 265. [2018-02-04 18:03:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 18:03:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2018-02-04 18:03:13,554 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 56 [2018-02-04 18:03:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:13,554 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2018-02-04 18:03:13,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:03:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2018-02-04 18:03:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 18:03:13,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:13,555 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1] [2018-02-04 18:03:13,555 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1011802751, now seen corresponding path program 1 times [2018-02-04 18:03:13,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:13,555 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:13,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:13,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:13,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:13,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:13,565 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:13,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:13,565 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:13,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:13,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:13,584 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:03:13,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:03:13,604 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:03:13,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:13,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:13,613 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:03:13,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 18:03:13,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, 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:03:13,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, 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:03:13,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,686 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:03:13,688 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:03:13,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-02-04 18:03:13,716 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 68 treesize of output 62 [2018-02-04 18:03:13,720 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:03:13,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,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, 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:03:13,743 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:03:13,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:57 [2018-02-04 18:03:13,763 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 57 treesize of output 41 [2018-02-04 18:03:13,764 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 17 [2018-02-04 18:03:13,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,769 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:03:13,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,778 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 26 treesize of output 24 [2018-02-04 18:03:13,779 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:03:13,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,783 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 3 [2018-02-04 18:03:13,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:13,786 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:03:13,786 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:9 [2018-02-04 18:03:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:13,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:13,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 18:03:13,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:03:13,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:03:13,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:03:13,808 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand 11 states. [2018-02-04 18:03:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:14,185 INFO L93 Difference]: Finished difference Result 307 states and 333 transitions. [2018-02-04 18:03:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:03:14,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-02-04 18:03:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:14,186 INFO L225 Difference]: With dead ends: 307 [2018-02-04 18:03:14,186 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 18:03:14,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:03:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 18:03:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 274. [2018-02-04 18:03:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 18:03:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 306 transitions. [2018-02-04 18:03:14,189 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 306 transitions. Word has length 56 [2018-02-04 18:03:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:14,190 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 306 transitions. [2018-02-04 18:03:14,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:03:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 306 transitions. [2018-02-04 18:03:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 18:03:14,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:14,191 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, 1, 1, 1, 1, 1] [2018-02-04 18:03:14,191 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1301113422, now seen corresponding path program 1 times [2018-02-04 18:03:14,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:14,191 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:14,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:14,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:14,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:14,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:14,205 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:14,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:14,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:14,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:14,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:14,251 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:03:14,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:03:14,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:14,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:14,269 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:03:14,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 18:03:14,319 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:03:14,320 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 10 treesize of output 9 [2018-02-04 18:03:14,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 18:03:14,342 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 46 treesize of output 40 [2018-02-04 18:03:14,343 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 16 treesize of output 15 [2018-02-04 18:03:14,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,351 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:03:14,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:42 [2018-02-04 18:03:14,366 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 45 treesize of output 31 [2018-02-04 18:03:14,367 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 24 treesize of output 9 [2018-02-04 18:03:14,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,371 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:03:14,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:4 [2018-02-04 18:03:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:14,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:14,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 18:03:14,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:03:14,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:03:14,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:03:14,394 INFO L87 Difference]: Start difference. First operand 274 states and 306 transitions. Second operand 13 states. [2018-02-04 18:03:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:14,764 INFO L93 Difference]: Finished difference Result 304 states and 329 transitions. [2018-02-04 18:03:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:03:14,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-04 18:03:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:14,765 INFO L225 Difference]: With dead ends: 304 [2018-02-04 18:03:14,765 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 18:03:14,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-02-04 18:03:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 18:03:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2018-02-04 18:03:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 18:03:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 304 transitions. [2018-02-04 18:03:14,769 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 304 transitions. Word has length 57 [2018-02-04 18:03:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:14,769 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 304 transitions. [2018-02-04 18:03:14,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:03:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 304 transitions. [2018-02-04 18:03:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 18:03:14,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:14,770 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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:03:14,770 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1679836416, now seen corresponding path program 1 times [2018-02-04 18:03:14,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:14,770 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:14,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:14,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:14,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:14,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:14,794 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:14,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:14,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:14,795 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:14,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:14,845 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:03:14,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:03:14,860 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:03:14,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:14,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:14,872 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:03:14,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 18:03:14,914 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:03:14,916 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:03:14,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,934 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:03:14,936 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:03:14,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-02-04 18:03:14,979 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 73 [2018-02-04 18:03:14,981 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:03:14,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:14,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,007 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:03:15,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, 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:03:15,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:73 [2018-02-04 18:03:15,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-02-04 18:03:15,075 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:03:15,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,084 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 45 treesize of output 22 [2018-02-04 18:03:15,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,104 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 26 treesize of output 24 [2018-02-04 18:03:15,127 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 3 [2018-02-04 18:03:15,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,153 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:03:15,153 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,161 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:03:15,162 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:91, output treesize:23 [2018-02-04 18:03:15,198 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:03:15,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-02-04 18:03:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:15,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:15,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 18:03:15,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:03:15,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:03:15,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:03:15,246 INFO L87 Difference]: Start difference. First operand 274 states and 304 transitions. Second operand 14 states. [2018-02-04 18:03:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:15,803 INFO L93 Difference]: Finished difference Result 324 states and 351 transitions. [2018-02-04 18:03:15,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:03:15,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 18:03:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:15,805 INFO L225 Difference]: With dead ends: 324 [2018-02-04 18:03:15,805 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 18:03:15,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:03:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 18:03:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 285. [2018-02-04 18:03:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 18:03:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 321 transitions. [2018-02-04 18:03:15,809 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 321 transitions. Word has length 58 [2018-02-04 18:03:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:15,809 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 321 transitions. [2018-02-04 18:03:15,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:03:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 321 transitions. [2018-02-04 18:03:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 18:03:15,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:15,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:15,810 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2091620674, now seen corresponding path program 1 times [2018-02-04 18:03:15,810 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:15,810 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:15,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:15,811 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:15,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:15,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:15,824 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:15,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:15,825 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:15,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:15,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:15,873 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:03:15,875 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:03:15,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,884 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:03:15,886 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:03:15,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-02-04 18:03:15,902 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 23 treesize of output 18 [2018-02-04 18:03:15,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,905 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 27 [2018-02-04 18:03:15,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,921 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 23 treesize of output 18 [2018-02-04 18:03:15,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,924 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 27 [2018-02-04 18:03:15,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-02-04 18:03:15,950 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:03:15,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,958 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:03:15,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:15,990 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:03:15,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:15,996 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:03:15,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-02-04 18:03:16,028 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 39 treesize of output 30 [2018-02-04 18:03:16,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,040 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 30 treesize of output 77 [2018-02-04 18:03:16,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,066 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 39 treesize of output 30 [2018-02-04 18:03:16,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,074 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 30 treesize of output 77 [2018-02-04 18:03:16,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:74 [2018-02-04 18:03:16,135 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 54 treesize of output 43 [2018-02-04 18:03:16,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:03:16,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,193 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 54 treesize of output 43 [2018-02-04 18:03:16,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:03:16,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:112, output treesize:74 [2018-02-04 18:03:16,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,236 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:03:16,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:83 [2018-02-04 18:03:16,290 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:03:16,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:87 [2018-02-04 18:03:16,324 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:03:16,325 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:03:16,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,349 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 53 treesize of output 54 [2018-02-04 18:03:16,351 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:03:16,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,371 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:03:16,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:95 [2018-02-04 18:03:16,417 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:16,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-02-04 18:03:16,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 131 [2018-02-04 18:03:16,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:03:16,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:03:16,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 131 [2018-02-04 18:03:16,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 157 [2018-02-04 18:03:16,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2018-02-04 18:03:16,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 139 [2018-02-04 18:03:16,649 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2018-02-04 18:03:16,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,682 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:16,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 121 [2018-02-04 18:03:16,692 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,775 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:03:16,775 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:144, output treesize:419 [2018-02-04 18:03:16,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 190 [2018-02-04 18:03:16,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:16,857 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 35 treesize of output 76 [2018-02-04 18:03:16,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:16,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,004 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 208 treesize of output 199 [2018-02-04 18:03:17,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 77 [2018-02-04 18:03:17,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,137 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 150 treesize of output 135 [2018-02-04 18:03:17,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,156 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 69 treesize of output 86 [2018-02-04 18:03:17,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,312 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 160 treesize of output 153 [2018-02-04 18:03:17,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,315 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 25 treesize of output 54 [2018-02-04 18:03:17,315 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,340 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 171 [2018-02-04 18:03:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,429 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:17,429 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 35 treesize of output 99 [2018-02-04 18:03:17,429 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,464 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 143 [2018-02-04 18:03:17,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,544 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 27 treesize of output 44 [2018-02-04 18:03:17,544 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,562 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,626 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:03:17,626 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:497, output treesize:579 [2018-02-04 18:03:17,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 223 [2018-02-04 18:03:17,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,723 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:17,725 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 68 treesize of output 166 [2018-02-04 18:03:17,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,894 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 217 treesize of output 208 [2018-02-04 18:03:17,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:17,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 88 [2018-02-04 18:03:17,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:17,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 259 [2018-02-04 18:03:18,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,055 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 68 treesize of output 131 [2018-02-04 18:03:18,055 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,093 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,202 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 253 treesize of output 242 [2018-02-04 18:03:18,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,208 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 79 treesize of output 111 [2018-02-04 18:03:18,208 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,327 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 184 treesize of output 167 [2018-02-04 18:03:18,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,332 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 82 treesize of output 100 [2018-02-04 18:03:18,333 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,356 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 156 [2018-02-04 18:03:18,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,447 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 40 treesize of output 77 [2018-02-04 18:03:18,448 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,471 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,532 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:03:18,532 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:693, output treesize:579 [2018-02-04 18:03:18,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,543 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 300 treesize of output 246 [2018-02-04 18:03:18,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,566 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:18,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 347 [2018-02-04 18:03:18,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,730 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:18,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 214 [2018-02-04 18:03:18,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 236 [2018-02-04 18:03:18,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,885 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:18,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 209 [2018-02-04 18:03:18,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:18,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 297 [2018-02-04 18:03:18,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:18,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,020 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 197 treesize of output 155 [2018-02-04 18:03:19,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 153 treesize of output 186 [2018-02-04 18:03:19,030 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,056 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,136 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:19,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 161 [2018-02-04 18:03:19,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2018-02-04 18:03:19,148 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 199 [2018-02-04 18:03:19,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 204 treesize of output 243 [2018-02-04 18:03:19,265 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:03:19,287 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:19,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:03:19,348 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:756, output treesize:619 [2018-02-04 18:03:19,633 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:19,634 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 209 treesize of output 166 [2018-02-04 18:03:19,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,636 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:19,636 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 30 treesize of output 14 [2018-02-04 18:03:19,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,656 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 77 [2018-02-04 18:03:19,656 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:03:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:19,731 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 195 treesize of output 154 [2018-02-04 18:03:19,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,733 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 15 [2018-02-04 18:03:19,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-02-04 18:03:19,755 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,766 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,827 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 268 treesize of output 176 [2018-02-04 18:03:19,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,829 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 30 treesize of output 21 [2018-02-04 18:03:19,830 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:19,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:19,859 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 107 [2018-02-04 18:03:19,859 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:19,878 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:03:19,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-02-04 18:03:19,910 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:673, output treesize:269 [2018-02-04 18:03:20,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,041 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 88 [2018-02-04 18:03:20,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,060 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 115 [2018-02-04 18:03:20,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2018-02-04 18:03:20,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,184 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 2 case distinctions, treesize of input 61 treesize of output 74 [2018-02-04 18:03:20,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:20,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,277 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 67 treesize of output 59 [2018-02-04 18:03:20,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,370 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 53 treesize of output 48 [2018-02-04 18:03:20,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,448 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 32 treesize of output 26 [2018-02-04 18:03:20,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,450 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 39 [2018-02-04 18:03:20,450 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,451 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 40 treesize of output 32 [2018-02-04 18:03:20,451 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,452 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 41 treesize of output 35 [2018-02-04 18:03:20,453 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,528 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 48 treesize of output 61 [2018-02-04 18:03:20,528 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:03:20,648 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 80 [2018-02-04 18:03:20,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,651 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 65 treesize of output 59 [2018-02-04 18:03:20,651 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:20,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,701 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 2 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 18:03:20,701 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:20,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,774 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 98 [2018-02-04 18:03:20,776 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-02-04 18:03:20,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:20,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 174 [2018-02-04 18:03:20,916 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-02-04 18:03:20,924 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 20 xjuncts. [2018-02-04 18:03:21,083 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 69 treesize of output 64 [2018-02-04 18:03:21,083 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:21,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2018-02-04 18:03:21,170 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:21,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,253 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2018-02-04 18:03:21,253 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:21,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,261 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-02-04 18:03:21,261 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:21,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:21,316 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 23 treesize of output 17 [2018-02-04 18:03:21,316 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:21,339 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:03:21,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:03:21,383 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:183, output treesize:39 [2018-02-04 18:03:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:21,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:21,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:03:21,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:03:21,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:03:21,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:03:21,447 INFO L87 Difference]: Start difference. First operand 285 states and 321 transitions. Second operand 19 states. [2018-02-04 18:03:22,032 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 86 DAG size of output 81 [2018-02-04 18:03:22,195 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 101 DAG size of output 95 [2018-02-04 18:03:22,632 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 210 DAG size of output 206 [2018-02-04 18:03:23,107 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 212 DAG size of output 208 [2018-02-04 18:03:23,483 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 263 DAG size of output 259 [2018-02-04 18:03:23,624 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 82 DAG size of output 77 [2018-02-04 18:03:23,794 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 168 DAG size of output 164 [2018-02-04 18:03:23,979 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 97 DAG size of output 91 [2018-02-04 18:03:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:24,303 INFO L93 Difference]: Finished difference Result 351 states and 389 transitions. [2018-02-04 18:03:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 18:03:24,304 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-02-04 18:03:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:24,305 INFO L225 Difference]: With dead ends: 351 [2018-02-04 18:03:24,305 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 18:03:24,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 18:03:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 18:03:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 288. [2018-02-04 18:03:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 18:03:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 324 transitions. [2018-02-04 18:03:24,309 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 324 transitions. Word has length 58 [2018-02-04 18:03:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:24,310 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 324 transitions. [2018-02-04 18:03:24,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:03:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 324 transitions. [2018-02-04 18:03:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 18:03:24,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:24,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:24,311 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash 415730698, now seen corresponding path program 1 times [2018-02-04 18:03:24,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:24,311 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:24,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:24,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:24,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:24,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:24,323 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:24,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:24,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:24,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:24,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:24,495 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:03:24,496 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:03:24,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:24,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:24,503 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:03:24,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:46 [2018-02-04 18:03:24,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2018-02-04 18:03:24,614 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 42 treesize of output 37 [2018-02-04 18:03:24,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:24,636 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2018-02-04 18:03:24,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-02-04 18:03:24,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 34 [2018-02-04 18:03:24,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:03:24,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-02-04 18:03:24,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-02-04 18:03:24,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:194 [2018-02-04 18:03:24,927 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int) (v_prenex_93 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~1.base 1))) (let ((.cse1 (store .cse0 v_prenex_93 0))) (and (= 0 (select .cse0 v_prenex_93)) (= (select .cse1 main_~x~1.base) 1) (not (= 0 v_prenex_93)) (= 0 (select |c_old(#valid)| main_~x~1.base)) (= |c_#valid| (store .cse1 main_~x~1.base 0)) (not (= 0 main_~x~1.base)))))) is different from true [2018-02-04 18:03:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 18:03:24,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:24,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:03:24,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:03:24,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:03:24,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=260, Unknown=7, NotChecked=32, Total=342 [2018-02-04 18:03:24,940 INFO L87 Difference]: Start difference. First operand 288 states and 324 transitions. Second operand 19 states. [2018-02-04 18:03:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:25,750 INFO L93 Difference]: Finished difference Result 292 states and 327 transitions. [2018-02-04 18:03:25,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:03:25,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-04 18:03:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:25,751 INFO L225 Difference]: With dead ends: 292 [2018-02-04 18:03:25,751 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 18:03:25,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=844, Unknown=14, NotChecked=60, Total=1056 [2018-02-04 18:03:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 18:03:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-02-04 18:03:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 18:03:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 307 transitions. [2018-02-04 18:03:25,754 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 307 transitions. Word has length 59 [2018-02-04 18:03:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:25,754 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 307 transitions. [2018-02-04 18:03:25,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:03:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 307 transitions. [2018-02-04 18:03:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 18:03:25,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:25,754 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 18:03:25,754 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 546255556, now seen corresponding path program 1 times [2018-02-04 18:03:25,754 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:25,755 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:25,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:25,755 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:25,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:25,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:03:25,764 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:25,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:25,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:25,765 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:25,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:25,797 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:03:25,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:03:25,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:03:25,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 18:03:25,826 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:03:25,827 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:03:25,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 18:03:25,839 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 21 treesize of output 16 [2018-02-04 18:03:25,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,840 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 16 treesize of output 23 [2018-02-04 18:03:25,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 18:03:25,856 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 36 treesize of output 29 [2018-02-04 18:03:25,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,860 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 29 treesize of output 37 [2018-02-04 18:03:25,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2018-02-04 18:03:25,872 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:03:25,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:03:25,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,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 30 treesize of output 31 [2018-02-04 18:03:25,885 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 10 treesize of output 9 [2018-02-04 18:03:25,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-02-04 18:03:25,914 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 125 treesize of output 103 [2018-02-04 18:03:25,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,917 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 59 treesize of output 152 [2018-02-04 18:03:25,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 128 [2018-02-04 18:03:25,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 18:03:25,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:117 [2018-02-04 18:03:25,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:25,962 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 126 treesize of output 116 [2018-02-04 18:03:25,963 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:03:25,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,970 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 95 treesize of output 72 [2018-02-04 18:03:25,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:25,979 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:03:25,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:135, output treesize:81 [2018-02-04 18:03:26,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,032 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 96 treesize of output 65 [2018-02-04 18:03:26,033 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 38 treesize of output 23 [2018-02-04 18:03:26,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,039 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 35 treesize of output 30 [2018-02-04 18:03:26,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:96, output treesize:5 [2018-02-04 18:03:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:26,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:26,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 18:03:26,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:03:26,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:03:26,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:03:26,072 INFO L87 Difference]: Start difference. First operand 272 states and 307 transitions. Second operand 17 states. [2018-02-04 18:03:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:26,767 INFO L93 Difference]: Finished difference Result 337 states and 378 transitions. [2018-02-04 18:03:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:03:26,767 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-02-04 18:03:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:26,768 INFO L225 Difference]: With dead ends: 337 [2018-02-04 18:03:26,768 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 18:03:26,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 18:03:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 18:03:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 296. [2018-02-04 18:03:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 18:03:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 339 transitions. [2018-02-04 18:03:26,770 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 339 transitions. Word has length 62 [2018-02-04 18:03:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:26,771 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 339 transitions. [2018-02-04 18:03:26,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:03:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 339 transitions. [2018-02-04 18:03:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 18:03:26,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:26,771 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 18:03:26,771 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 546255557, now seen corresponding path program 1 times [2018-02-04 18:03:26,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:26,771 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:26,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:26,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:26,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:26,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:26,781 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:26,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:26,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:26,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:26,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:26,810 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:03:26,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:03:26,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,850 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:03:26,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-04 18:03:26,889 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:03:26,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, 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:03:26,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,903 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:03:26,904 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:03:26,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:38 [2018-02-04 18:03:26,924 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 21 treesize of output 16 [2018-02-04 18:03:26,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,926 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:03:26,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,940 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 21 treesize of output 16 [2018-02-04 18:03:26,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,942 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 16 treesize of output 23 [2018-02-04 18:03:26,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-02-04 18:03:26,970 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 36 treesize of output 29 [2018-02-04 18:03:26,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,974 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 29 treesize of output 37 [2018-02-04 18:03:26,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,991 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 36 treesize of output 29 [2018-02-04 18:03:26,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:26,994 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 29 treesize of output 37 [2018-02-04 18:03:26,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:26,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2018-02-04 18:03:27,011 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 30 treesize of output 31 [2018-02-04 18:03:27,013 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 10 treesize of output 9 [2018-02-04 18:03:27,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,032 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 30 treesize of output 43 [2018-02-04 18:03:27,034 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:03:27,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:86 [2018-02-04 18:03:27,072 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 132 treesize of output 110 [2018-02-04 18:03:27,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:27,074 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 37 treesize of output 66 [2018-02-04 18:03:27,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:27,097 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 59 treesize of output 44 [2018-02-04 18:03:27,099 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 40 [2018-02-04 18:03:27,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:146, output treesize:130 [2018-02-04 18:03:27,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:27,181 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 22 treesize of output 10 [2018-02-04 18:03:27,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,191 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:03:27,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:153, output treesize:132 [2018-02-04 18:03:27,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:27,234 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 83 [2018-02-04 18:03:27,235 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 67 treesize of output 46 [2018-02-04 18:03:27,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:27,244 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:27,245 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 0 case distinctions, treesize of input 56 treesize of output 40 [2018-02-04 18:03:27,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,258 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 47 treesize of output 39 [2018-02-04 18:03:27,259 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 3 [2018-02-04 18:03:27,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,265 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 0 case distinctions, treesize of input 21 treesize of output 15 [2018-02-04 18:03:27,266 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:27,271 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:03:27,271 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:146, output treesize:10 [2018-02-04 18:03:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:27,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:27,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:03:27,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:03:27,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:03:27,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:03:27,309 INFO L87 Difference]: Start difference. First operand 296 states and 339 transitions. Second operand 18 states. [2018-02-04 18:03:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:28,156 INFO L93 Difference]: Finished difference Result 337 states and 377 transitions. [2018-02-04 18:03:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:03:28,156 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-04 18:03:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:28,157 INFO L225 Difference]: With dead ends: 337 [2018-02-04 18:03:28,157 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 18:03:28,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 18:03:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 18:03:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 295. [2018-02-04 18:03:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 18:03:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 336 transitions. [2018-02-04 18:03:28,160 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 336 transitions. Word has length 62 [2018-02-04 18:03:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:28,160 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 336 transitions. [2018-02-04 18:03:28,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:03:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 336 transitions. [2018-02-04 18:03:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 18:03:28,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:28,160 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:28,160 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -241022493, now seen corresponding path program 1 times [2018-02-04 18:03:28,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:28,161 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:28,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:28,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:28,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:28,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:28,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:28,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:28,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:28,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:03:28,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:03:28,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-02-04 18:03:28,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:03:28,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:03:28,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:03:28,324 INFO L87 Difference]: Start difference. First operand 295 states and 336 transitions. Second operand 12 states. [2018-02-04 18:03:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:28,469 INFO L93 Difference]: Finished difference Result 319 states and 361 transitions. [2018-02-04 18:03:28,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:03:28,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-04 18:03:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:28,470 INFO L225 Difference]: With dead ends: 319 [2018-02-04 18:03:28,470 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 18:03:28,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:03:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 18:03:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 295. [2018-02-04 18:03:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 18:03:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 335 transitions. [2018-02-04 18:03:28,472 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 335 transitions. Word has length 63 [2018-02-04 18:03:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:28,472 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 335 transitions. [2018-02-04 18:03:28,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:03:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 335 transitions. [2018-02-04 18:03:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 18:03:28,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:28,473 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 18:03:28,473 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash -133295177, now seen corresponding path program 2 times [2018-02-04 18:03:28,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:28,473 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:28,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:28,473 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:28,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:28,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:28,483 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:28,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:28,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:28,483 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:03:28,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:03:28,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:03:28,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:28,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:03:28,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-04 18:03:28,588 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:03:28,589 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:03:28,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,629 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:03:28,631 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:03:28,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-02-04 18:03:28,664 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 23 treesize of output 18 [2018-02-04 18:03:28,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,667 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 27 [2018-02-04 18:03:28,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,696 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 23 treesize of output 18 [2018-02-04 18:03:28,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,699 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 27 [2018-02-04 18:03:28,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-02-04 18:03:28,742 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 30 treesize of output 23 [2018-02-04 18:03:28,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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:03:28,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,774 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 30 treesize of output 23 [2018-02-04 18:03:28,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,777 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:03:28,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-02-04 18:03:28,819 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 39 treesize of output 30 [2018-02-04 18:03:28,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,824 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 30 treesize of output 77 [2018-02-04 18:03:28,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,854 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 39 treesize of output 30 [2018-02-04 18:03:28,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-04 18:03:28,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:85 [2018-02-04 18:03:28,914 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 54 treesize of output 43 [2018-02-04 18:03:28,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:03:28,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-04 18:03:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:28,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:03:28,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:85 [2018-02-04 18:03:28,991 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 48 treesize of output 49 [2018-02-04 18:03:28,992 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:03:28,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:28,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,017 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 48 treesize of output 49 [2018-02-04 18:03:29,019 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 10 treesize of output 9 [2018-02-04 18:03:29,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:103 [2018-02-04 18:03:29,068 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 173 treesize of output 135 [2018-02-04 18:03:29,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 79 [2018-02-04 18:03:29,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,101 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:29,102 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 85 treesize of output 59 [2018-02-04 18:03:29,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 56 [2018-02-04 18:03:29,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:185, output treesize:143 [2018-02-04 18:03:29,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,365 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 142 treesize of output 105 [2018-02-04 18:03:29,399 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 42 treesize of output 103 [2018-02-04 18:03:29,399 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-02-04 18:03:29,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 104 dim-0 vars, End of recursive call: 104 dim-0 vars, and 112 xjuncts. [2018-02-04 18:03:29,765 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 80 treesize of output 63 [2018-02-04 18:03:29,766 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:03:29,767 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 83 treesize of output 66 [2018-02-04 18:03:29,767 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:03:29,768 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 80 treesize of output 63 [2018-02-04 18:03:29,768 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:03:29,769 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 76 treesize of output 54 [2018-02-04 18:03:29,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-04 18:03:29,858 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 61 treesize of output 49 [2018-02-04 18:03:29,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,868 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 2 case distinctions, treesize of input 28 treesize of output 33 [2018-02-04 18:03:29,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:29,876 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:29,878 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 70 treesize of output 58 [2018-02-04 18:03:29,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,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, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2018-02-04 18:03:29,885 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:29,897 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:29,899 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 73 treesize of output 61 [2018-02-04 18:03:29,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,904 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 0 case distinctions, treesize of input 28 treesize of output 25 [2018-02-04 18:03:29,904 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,908 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:29,910 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 70 treesize of output 58 [2018-02-04 18:03:29,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:29,917 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 28 treesize of output 29 [2018-02-04 18:03:29,917 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:29,929 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:29,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:03:29,964 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:149, output treesize:117 [2018-02-04 18:03:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:03:30,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:30,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 18:03:30,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:03:30,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:03:30,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:03:30,104 INFO L87 Difference]: Start difference. First operand 295 states and 335 transitions. Second operand 26 states. [2018-02-04 18:03:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:31,398 INFO L93 Difference]: Finished difference Result 337 states and 376 transitions. [2018-02-04 18:03:31,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:03:31,398 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-02-04 18:03:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:31,399 INFO L225 Difference]: With dead ends: 337 [2018-02-04 18:03:31,399 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 18:03:31,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=2667, Unknown=2, NotChecked=0, Total=3080 [2018-02-04 18:03:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 18:03:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 303. [2018-02-04 18:03:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 18:03:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 343 transitions. [2018-02-04 18:03:31,401 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 343 transitions. Word has length 65 [2018-02-04 18:03:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:31,402 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 343 transitions. [2018-02-04 18:03:31,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:03:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 343 transitions. [2018-02-04 18:03:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 18:03:31,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:31,402 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 18:03:31,402 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 162816053, now seen corresponding path program 2 times [2018-02-04 18:03:31,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:31,402 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:31,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:31,403 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:03:31,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:31,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:31,413 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:31,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:31,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:31,414 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:03:31,434 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:03:31,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:03:31,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:31,524 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:03:31,525 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:03:31,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-02-04 18:03:31,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:31,554 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 55 treesize of output 59 [2018-02-04 18:03:31,556 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 16 treesize of output 15 [2018-02-04 18:03:31,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,567 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:03:31,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:60 [2018-02-04 18:03:31,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:31,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 54 treesize of output 48 [2018-02-04 18:03:31,614 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 41 treesize of output 22 [2018-02-04 18:03:31,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,619 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:03:31,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:31,627 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:69, output treesize:27 [2018-02-04 18:03:31,672 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~1.base 1))) (and (= 0 (select |c_old(#valid)| main_~x~1.base)) (= (select .cse0 c_main_~first~0.base) 0) (= (store (store .cse0 c_main_~first~0.base 1) main_~x~1.base 0) |c_#valid|) (not (= 0 main_~x~1.base))))) is different from true [2018-02-04 18:03:31,675 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_subst_5 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_5 1))) (and (= (select .cse1 c_main_~x~1.base) 0) (= |c_#valid| (store (store .cse1 c_main_~x~1.base 1) v_subst_5 0)) (= 0 (select |c_old(#valid)| v_subst_5)) (not (= 0 v_subst_5))))))) (or (and (not (= 0 c_main_~x~1.base)) .cse0) (and (not (= c_main_~x~1.offset 0)) .cse0))) is different from true [2018-02-04 18:03:31,678 WARN L1033 $PredicateComparison]: unable to prove that (or (and (not (= 0 c_main_~x~1.base)) (exists ((v_subst_5 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_5 1))) (and (= (select .cse0 c_main_~x~1.base) 0) (= |c_#valid| (store (store .cse0 c_main_~x~1.base 1) v_subst_5 0)) (= 0 (select |c_old(#valid)| v_subst_5)) (not (= 0 v_subst_5)))))) (and (not (= c_main_~x~1.offset 0)) (exists ((v_prenex_204 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_204 1))) (and (= (select .cse1 c_main_~x~1.base) 0) (= |c_#valid| (store (store .cse1 c_main_~x~1.base 1) v_prenex_204 0)) (= 0 (select |c_old(#valid)| v_prenex_204)) (not (= 0 v_prenex_204))))))) is different from true [2018-02-04 18:03:31,736 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int) (v_subst_5 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_5 1))) (and (= (select .cse0 main_~x~1.base) 0) (= 0 (select |c_old(#valid)| v_subst_5)) (not (= 0 v_subst_5)) (not (= 0 main_~x~1.base)) (= |c_#valid| (store (store (store .cse0 main_~x~1.base 1) v_subst_5 0) main_~x~1.base 0))))) is different from true [2018-02-04 18:03:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2018-02-04 18:03:31,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:03:31,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:03:31,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:03:31,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:03:31,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=211, Unknown=4, NotChecked=124, Total=380 [2018-02-04 18:03:31,753 INFO L87 Difference]: Start difference. First operand 303 states and 343 transitions. Second operand 20 states. [2018-02-04 18:03:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:03:32,340 INFO L93 Difference]: Finished difference Result 319 states and 358 transitions. [2018-02-04 18:03:32,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 18:03:32,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-02-04 18:03:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:03:32,341 INFO L225 Difference]: With dead ends: 319 [2018-02-04 18:03:32,341 INFO L226 Difference]: Without dead ends: 297 [2018-02-04 18:03:32,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=516, Unknown=5, NotChecked=196, Total=812 [2018-02-04 18:03:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-04 18:03:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-02-04 18:03:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 18:03:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 334 transitions. [2018-02-04 18:03:32,343 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 334 transitions. Word has length 66 [2018-02-04 18:03:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:03:32,343 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 334 transitions. [2018-02-04 18:03:32,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:03:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 334 transitions. [2018-02-04 18:03:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 18:03:32,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:03:32,344 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:03:32,344 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:03:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1754759384, now seen corresponding path program 1 times [2018-02-04 18:03:32,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:03:32,344 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:03:32,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:32,344 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:03:32,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:03:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:32,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:03:32,358 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:03:32,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:03:32,359 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:03:32,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:03:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:03:32,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:03:32,426 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:03:32,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:03:32,439 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:03:32,440 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:03:32,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,449 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:03:32,450 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:03:32,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-02-04 18:03:32,465 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:03:32,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,466 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:03:32,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,477 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:03:32,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,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:03:32,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-04 18:03:32,497 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 36 treesize of output 29 [2018-02-04 18:03:32,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,501 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 29 treesize of output 37 [2018-02-04 18:03:32,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,515 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 36 treesize of output 29 [2018-02-04 18:03:32,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,518 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 29 treesize of output 37 [2018-02-04 18:03:32,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2018-02-04 18:03:32,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,544 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:03:32,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-02-04 18:03:32,578 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 28 treesize of output 29 [2018-02-04 18:03:32,579 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:03:32,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,597 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 28 treesize of output 37 [2018-02-04 18:03:32,598 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:03:32,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:68 [2018-02-04 18:03:32,634 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 59 treesize of output 58 [2018-02-04 18:03:32,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,637 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 27 [2018-02-04 18:03:32,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,664 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:03:32,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,666 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 27 [2018-02-04 18:03:32,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-04 18:03:32,713 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 66 treesize of output 63 [2018-02-04 18:03:32,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-04 18:03:32,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,790 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 52 treesize of output 53 [2018-02-04 18:03:32,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,795 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:03:32,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:100 [2018-02-04 18:03:32,854 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 75 treesize of output 70 [2018-02-04 18:03:32,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-04 18:03:32,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-02-04 18:03:32,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,918 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 30 treesize of output 77 [2018-02-04 18:03:32,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:32,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:126, output treesize:118 [2018-02-04 18:03:32,991 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 90 treesize of output 83 [2018-02-04 18:03:32,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:32,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:03:33,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,061 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 76 treesize of output 73 [2018-02-04 18:03:33,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 18:03:33,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:156, output treesize:118 [2018-02-04 18:03:33,106 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:03:33,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:124, output treesize:123 [2018-02-04 18:03:33,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 103 [2018-02-04 18:03:33,260 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:03:33,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,435 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 4 case distinctions, treesize of input 78 treesize of output 93 [2018-02-04 18:03:33,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 18:03:33,570 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 83 treesize of output 82 [2018-02-04 18:03:33,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 135 [2018-02-04 18:03:33,673 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 18:03:33,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:03:33,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 123 [2018-02-04 18:03:33,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:33,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 112 [2018-02-04 18:03:33,894 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,918 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 122 [2018-02-04 18:03:33,926 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 30 [2018-02-04 18:03:33,926 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,942 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:33,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 158 [2018-02-04 18:03:33,969 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:03:33,969 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:34,117 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 124 treesize of output 123 [2018-02-04 18:03:34,117 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:34,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 190 [2018-02-04 18:03:34,302 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-02-04 18:03:34,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:03:34,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 123 [2018-02-04 18:03:34,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:34,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 112 [2018-02-04 18:03:34,490 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:34,516 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:34,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 122 [2018-02-04 18:03:34,525 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 30 [2018-02-04 18:03:34,525 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:34,555 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:34,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-04 18:03:34,720 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:149, output treesize:891 [2018-02-04 18:03:34,919 WARN L143 SmtUtils]: Spent 168ms on a formula simplification that was a NOOP. DAG size: 109 [2018-02-04 18:03:35,130 WARN L143 SmtUtils]: Spent 175ms on a formula simplification that was a NOOP. DAG size: 112 [2018-02-04 18:03:35,138 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:35,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:35,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 170 [2018-02-04 18:03:35,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:35,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:35,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:35,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:35,175 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 6 case distinctions, treesize of input 34 treesize of output 110 [2018-02-04 18:03:35,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-02-04 18:03:35,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:03:38,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,529 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:38,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 162 [2018-02-04 18:03:38,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:38,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 131 [2018-02-04 18:03:38,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 16 xjuncts. [2018-02-04 18:03:38,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:03:43,548 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 160 [2018-02-04 18:03:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,563 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 175 [2018-02-04 18:03:43,568 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:43,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:43,609 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 160 [2018-02-04 18:03:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,621 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 175 [2018-02-04 18:03:43,627 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:43,665 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:43,667 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,669 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 165 [2018-02-04 18:03:43,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,677 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 137 [2018-02-04 18:03:43,684 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:43,717 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:43,719 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:43,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164 [2018-02-04 18:03:43,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:43,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 180 [2018-02-04 18:03:43,752 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 18:03:43,849 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:03:46,786 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 164 [2018-02-04 18:03:46,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:46,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:46,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:46,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:46,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:46,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:46,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 123 [2018-02-04 18:03:46,813 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-02-04 18:03:46,896 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:03:49,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:49,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 172 [2018-02-04 18:03:49,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:49,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:49,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:49,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:49,980 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 6 case distinctions, treesize of input 34 treesize of output 97 [2018-02-04 18:03:49,981 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-02-04 18:03:50,064 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:03:54,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 152 [2018-02-04 18:03:54,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,094 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:54,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 87 treesize of output 162 [2018-02-04 18:03:54,098 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:54,135 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 156 [2018-02-04 18:03:54,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 149 [2018-02-04 18:03:54,159 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-02-04 18:03:54,238 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:03:54,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,241 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:54,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 159 [2018-02-04 18:03:54,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,247 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:54,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 143 [2018-02-04 18:03:54,254 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:54,286 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:54,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,290 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:54,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 159 [2018-02-04 18:03:54,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:54,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 151 [2018-02-04 18:03:54,304 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:54,335 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:57,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 155 [2018-02-04 18:03:57,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,418 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:57,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,421 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:57,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 153 [2018-02-04 18:03:57,428 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:57,469 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:03:57,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 151 [2018-02-04 18:03:57,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,491 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:57,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 94 treesize of output 194 [2018-02-04 18:03:57,520 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 16 xjuncts. [2018-02-04 18:03:57,671 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:03:57,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 155 [2018-02-04 18:03:57,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:03:57,683 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:03:57,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 155 [2018-02-04 18:03:57,688 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 18:03:57,718 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:00,040 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:00,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:00,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 166 [2018-02-04 18:04:00,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:00,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:00,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:00,066 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 4 case distinctions, treesize of input 36 treesize of output 96 [2018-02-04 18:04:00,066 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-02-04 18:04:00,145 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:04:02,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 158 [2018-02-04 18:04:02,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 141 [2018-02-04 18:04:02,630 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-02-04 18:04:02,712 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:04:02,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2018-02-04 18:04:02,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,725 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:02,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 75 treesize of output 152 [2018-02-04 18:04:02,729 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:02,762 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:02,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2018-02-04 18:04:02,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:02,776 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:02,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 75 treesize of output 144 [2018-02-04 18:04:02,781 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:02,813 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:04,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:04,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 172 [2018-02-04 18:04:04,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:04,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:04,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:04,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:04,768 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 6 case distinctions, treesize of input 34 treesize of output 97 [2018-02-04 18:04:04,769 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 8 xjuncts. [2018-02-04 18:04:04,860 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:04:06,904 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:06,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 176 [2018-02-04 18:04:06,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:06,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:06,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:06,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:06,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:06,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:06,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 136 [2018-02-04 18:04:06,953 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 16 xjuncts. [2018-02-04 18:04:07,085 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:04:09,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,421 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:09,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 157 [2018-02-04 18:04:09,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 119 [2018-02-04 18:04:09,433 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:09,464 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:09,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 154 [2018-02-04 18:04:09,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 165 [2018-02-04 18:04:09,490 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-02-04 18:04:09,561 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:04:09,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 150 [2018-02-04 18:04:09,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,581 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:09,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 81 treesize of output 156 [2018-02-04 18:04:09,585 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:09,619 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:09,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,622 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:09,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 157 [2018-02-04 18:04:09,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,628 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:09,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:09,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 135 [2018-02-04 18:04:09,634 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:09,665 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:11,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 182 treesize of output 172 [2018-02-04 18:04:11,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,625 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:11,626 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 258 [2018-02-04 18:04:11,630 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:11,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,755 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:11,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 240 [2018-02-04 18:04:11,765 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-02-04 18:04:11,889 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:04:11,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 182 treesize of output 172 [2018-02-04 18:04:11,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,921 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:11,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:11,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 234 [2018-02-04 18:04:11,933 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-02-04 18:04:12,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,098 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:12,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,100 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:12,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 236 [2018-02-04 18:04:12,104 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:12,225 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:04:12,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 182 treesize of output 160 [2018-02-04 18:04:12,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,249 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:12,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,251 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:12,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 145 [2018-02-04 18:04:12,256 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:12,292 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:12,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 182 treesize of output 168 [2018-02-04 18:04:12,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,326 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:12,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 220 [2018-02-04 18:04:12,330 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:12,382 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:12,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 188 treesize of output 176 [2018-02-04 18:04:12,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,414 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:12,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 167 treesize of output 260 [2018-02-04 18:04:12,440 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 16 xjuncts. [2018-02-04 18:04:12,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:12,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 229 [2018-02-04 18:04:12,808 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 8 xjuncts. [2018-02-04 18:04:13,126 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 18:04:15,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 155 [2018-02-04 18:04:15,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,149 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:15,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 106 [2018-02-04 18:04:15,157 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,188 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 143 [2018-02-04 18:04:15,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 138 [2018-02-04 18:04:15,204 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,238 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 155 [2018-02-04 18:04:15,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,247 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:15,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 104 [2018-02-04 18:04:15,259 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,293 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 149 [2018-02-04 18:04:15,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 140 [2018-02-04 18:04:15,323 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 4 xjuncts. [2018-02-04 18:04:15,412 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:04:15,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 143 [2018-02-04 18:04:15,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,423 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:04:15,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:15,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 139 [2018-02-04 18:04:15,430 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:15,466 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:04:17,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-2 vars, End of recursive call: 7 dim-0 vars, and 34 xjuncts. [2018-02-04 18:04:17,122 INFO L202 ElimStorePlain]: Needed 74 recursive calls to eliminate 21 variables, input treesize:1185, output treesize:5019 [2018-02-04 18:04:20,777 WARN L146 SmtUtils]: Spent 3550ms on a formula simplification. DAG size of input: 270 DAG size of output 239 [2018-02-04 18:04:20,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:20,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 237 [2018-02-04 18:04:20,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:20,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 233 [2018-02-04 18:04:20,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:04:21,149 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 187 treesize of output 186 [2018-02-04 18:04:21,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:04:21,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:21,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:21,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:21,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:21,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:21,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:04:21,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 265 [2018-02-04 18:04:21,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 18:04:21,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. Received shutdown request... [2018-02-04 18:06:14,559 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 18:06:14,559 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:06:14,562 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:06:14,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:06:14 BoogieIcfgContainer [2018-02-04 18:06:14,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:06:14,563 INFO L168 Benchmark]: Toolchain (without parser) took 205275.74 ms. Allocated memory was 406.8 MB in the beginning and 978.8 MB in the end (delta: 572.0 MB). Free memory was 360.9 MB in the beginning and 433.0 MB in the end (delta: -72.1 MB). Peak memory consumption was 499.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:06:14,563 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:06:14,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.60 ms. Allocated memory is still 406.8 MB. Free memory was 360.9 MB in the beginning and 350.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:06:14,564 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 347.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:06:14,564 INFO L168 Benchmark]: RCFGBuilder took 268.43 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 318.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 5.3 GB. [2018-02-04 18:06:14,564 INFO L168 Benchmark]: TraceAbstraction took 204825.23 ms. Allocated memory was 406.8 MB in the beginning and 978.8 MB in the end (delta: 572.0 MB). Free memory was 318.3 MB in the beginning and 433.0 MB in the end (delta: -114.8 MB). Peak memory consumption was 457.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:06:14,565 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.11 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.60 ms. Allocated memory is still 406.8 MB. Free memory was 360.9 MB in the beginning and 350.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.93 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 347.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.43 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 318.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 204825.23 ms. Allocated memory was 406.8 MB in the beginning and 978.8 MB in the end (delta: 572.0 MB). Free memory was 318.3 MB in the beginning and 433.0 MB in the end (delta: -114.8 MB). Peak memory consumption was 457.2 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 639). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1236. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 39 error locations. TIMEOUT Result, 204.7s OverallTime, 45 OverallIterations, 3 TraceHistogramMax, 22.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2915 SDtfs, 8568 SDslu, 12348 SDs, 0 SdLazy, 13617 SolverSat, 1004 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1854 GetRequests, 1106 SyntacticMatches, 13 SemanticMatches, 735 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3745 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 1940 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 3182 NumberOfCodeBlocks, 3182 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1915 ConstructedInterpolants, 206 QuantifiedInterpolants, 2680904 SizeOfPredicates, 332 NumberOfNonLiveVariables, 5915 ConjunctsInSsa, 854 ConjunctsInUnsatCore, 46 InterpolantComputations, 21 PerfectInterpolantSequences, 203/508 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/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-06-14-569.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-06-14-569.csv Completed graceful shutdown